research-article

Keyword proximity search in complex data graphs

Authors:

Konstantin Golenberg,

Benny Kimelfeld,

Yehoshua SagivAuthors Info & Claims

SIGMOD '08: Proceedings of the 2008 ACM SIGMOD international conference on Management of data

Pages 927 - 940

https://doi.org/10.1145/1376616.1376708

Published: 09 June 2008 Publication History

Abstract

In keyword search over data graphs, an answer is a nonredundant subtree that includes the given keywords. An algorithm for enumerating answers is presented within an architecture that has two main components: an engine that generates a set of candidate answers and a ranker that evaluates their score. To be effective, the engine must have three fundamental properties. It should not miss relevant answers, has to be efficient and must generate the answers in an order that is highly correlated with the desired ranking. It is shown that none of the existing systems has implemented an engine that has all of these properties. In contrast, this paper presents an engine that generates all the answers with provable guarantees. Experiments show that the engine performs well in practice. It is also shown how to adapt this engine to queries under the OR semantics. In addition, this paper presents a novel approach for implementing rankers destined for eliminating redundancy. Essentially, an answer is ranked according to its individual properties (relevancy) and its intersection with the answers that have already been presented to the user. Within this approach, experiments with specific rankers are described.

References

[1]

S. Agrawal, S. Chaudhuri, and G. Das. DBXplorer: enabling keyword search over relational databases. In SIGMOD, 2002.

Digital Library

[2]

J. Allan, V. Lavrenko, and H. Jin. First story detection in TDT is hard. In CIKM, 2000.

Digital Library

[3]

G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using BANKS. In ICDE, 2002.

Digital Library

[4]

B. Ding, J. X. Yu, S. Wang, L. Qin, X. Zhang, and X. Lin. Finding top-k min-cost connected trees in databases. In ICDE, 2007.

[5]

R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, 2001.

Digital Library

[6]

N. Fuhr and K. Großjohann. XIRQL: A query language for information retrieval in XML documents. In SIGIR, 2001.

Digital Library

[7]

N. Fuhr, M. Lalmas, S. Malik, and G. Kazai, editors. 4th International Workshop of the Initiative for the Evaluation of XML Retrieval. Springer, 2006.

Digital Library

[8]

V. Hristidis, L. Gravano, and Y. Papakonstantinou. Efficient IR-style keyword search over relational databases. In VLDB, 2003.

Digital Library

[9]

V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword search in relational databases. In VLDB, 2002.

Digital Library

[10]

V. Hristidis, Y. Papakonstantinou, and A. Balmin. Keyword proximity search on XML graphs. In ICDE, 2003.

[11]

D. Johnson, M. Yannakakis, and C. Papadimitriou. On generating all maximal independent sets. Info. Proc. Lett., 27, 1988.

Digital Library

[12]

V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph databases. In VLDB, 2005.

Digital Library

[13]

G. Kazai and M. Lalmas. extended cumulated gain measures for the evaluation of content-oriented XML retrieval. ACM Trans. Inf. Syst., 24(4), 2006.

Digital Library

[14]

B. Kimelfeld and Y. Sagiv. Efficiently enumerating results of keyword search. In DBPL, 2005.

Digital Library

[15]

B. Kimelfeld and Y. Sagiv. Finding and approximating top-k answers in keyword proximity search. In PODS, 2006.

Digital Library

[16]

B. Kimelfeld and Y. Sagiv. Efficiently enumerating results of keyword search over data graphs. To appear in Information Systems, 2008.

Digital Library

[17]

E. L. Lawler. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Science, 18, 1972.

[18]

W.-S. Li, K. S. Candan, Q. Vu, and D. Agrawal. Retrieving and organizing web pages by ?information unit?. In WWW, 2001.

Digital Library

[19]

F. Liu, C. T. Yu, W. Meng, and A. Chowdhury. Effective keyword search in relational databases. In SIGMOD Conference, 2006.

Digital Library

[20]

D. Quass, A. Rajaraman, Y. Sagiv, J. D. Ullman, and J. Widom. Querying semistructured heterogeneous information. In DOOD, 1995.

Digital Library

[21]

N. Stokes and J. Carthy. Combining semantic and syntactic document classifiers to improve first story detection. In SIGIR. ACM, 2001.

Digital Library

[22]

M. Theobald, R. Schenkel, and G. Weikum. An efficient and versatile query engine for topx search. In VLDB, 2005.

Digital Library

[23]

S. Wang, Z. Peng, J. Zhang, L. Qin, S. Wang, J. X. Yu, and B. Ding. NUITS: A novel user interface for efficient keyword search over databases. In VLDB, 2006.

Digital Library

[24]

J. Y. Yen. Finding the k shortest loopless paths in a network. Management Science, 17, 1971.

[25]

J. Y. Yen. Another algorithm for finding the k shortest loopless network paths. In Proc. 41st Mtg. Operations Research Society of America, volume 20, 1972.

[26]

Y. Zhang, J. P. Callan, and T. P. Minka. Novelty and redundancy detection in adaptive filtering. In SIGIR. ACM, 2002.

Digital Library

Cited By

Dyreson CShatnawi ABhowmick SSharma V(2024)Temporal JSON Keyword SearchProceedings of the ACM on Management of Data10.1145/36549802:3(1-27)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654980
Ge YChen ZLiu Y(2023)An Efficient Keywords Search in Temporal Social NetworksData Science and Engineering10.1007/s41019-023-00218-78:4(368-384)Online publication date: 9-Sep-2023
https://doi.org/10.1007/s41019-023-00218-7
Qayyum MTaher M(2022)How LAM Sector Can Improve Quality of Life for Underserved Groups via a Whole Person ApproachHandbook of Research on the Role of Libraries, Archives, and Museums in Achieving Civic Engagement and Social Justice in Smart Cities10.4018/978-1-7998-8363-0.ch015(283-294)Online publication date: 2022
https://doi.org/10.4018/978-1-7998-8363-0.ch015
Show More Cited By

Index Terms

Keyword proximity search in complex data graphs
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
  2. Information retrieval
    1. Information retrieval query processing
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Finding and approximating top-k answers in keyword proximity search
PODS '06: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Various approaches for keyword proximity search have been implemented in relational databases, XML and the Web. Yet, in all of them, an answer is a Q-fragment, namely, a subtree T of the given data graph G, such that T contains all the keywords of the ...
Exploratory keyword search on data graphs
SIGMOD '10: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data

A system for keyword search on data graphs is demonstrated on two challenging datasets: the large DBLP and Mondial (which is highly cyclic and has a complex schema). The system supports search, exploration and question answering. The demonstration shows ...
Knowledge Management for Keyword Search over Data Graphs
CIKM '14: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management

This demo presents exploratory keyword search over data graphs by means of semantic facets. The demo starts with a keyword search over data graphs. Answers are first ranked by an existing search engine that considers their textual relevance and semantic ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '08: Proceedings of the 2008 ACM SIGMOD international conference on Management of data

June 2008

1396 pages

ISBN:9781605581026

DOI:10.1145/1376616

General Chairs:
Laks V. S. Lakshmanan
University of British Columbia, Canada
,
Raymond T. Ng
University of British Columbia, Canada
,
Dennis Shasha
New York University, USA

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 June 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGMOD/PODS '08

Sponsor:

SIGMOD/PODS '08: SIGMOD/PODS '08 - International Conference on Management of Data

June 9 - 12, 2008

Vancouver, Canada

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

134
Total Citations
View Citations
1,355
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)2

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Dyreson CShatnawi ABhowmick SSharma V(2024)Temporal JSON Keyword SearchProceedings of the ACM on Management of Data10.1145/36549802:3(1-27)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654980
Ge YChen ZLiu Y(2023)An Efficient Keywords Search in Temporal Social NetworksData Science and Engineering10.1007/s41019-023-00218-78:4(368-384)Online publication date: 9-Sep-2023
https://doi.org/10.1007/s41019-023-00218-7
Qayyum MTaher M(2022)How LAM Sector Can Improve Quality of Life for Underserved Groups via a Whole Person ApproachHandbook of Research on the Role of Libraries, Archives, and Museums in Achieving Civic Engagement and Social Justice in Smart Cities10.4018/978-1-7998-8363-0.ch015(283-294)Online publication date: 2022
https://doi.org/10.4018/978-1-7998-8363-0.ch015
Zhong MZheng YXue GLiu M(2022)Reliable Keyword Query Interpretation on Summary GraphsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2022.3144001(1-1)Online publication date: 2022
https://doi.org/10.1109/TKDE.2022.3144001
Stoddard JMustafa AGoela N(2021)Tanium revealProceedings of the VLDB Endowment10.14778/3476311.347638614:12(3096-3109)Online publication date: 28-Oct-2021
https://dl.acm.org/doi/10.14778/3476311.3476386
Khalid SWu SWahid AAlam AUllah I(2021)An Effective Scholarly Search by Combining Inverted Indices and Structured Search With Citation Networks AnalysisIEEE Access10.1109/ACCESS.2021.31079399(120210-120226)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3107939
Yang JYao WZhang W(2021)Keyword Search on Large Graphs: A SurveyData Science and Engineering10.1007/s41019-021-00154-46:2(142-162)Online publication date: 31-Mar-2021
https://doi.org/10.1007/s41019-021-00154-4
Qiao LZhang ZYuan YChen CWang G(2021)Keyword-Centric Community Search over Large Heterogeneous Information NetworksDatabase Systems for Advanced Applications10.1007/978-3-030-73194-6_12(158-173)Online publication date: 6-Apr-2021
https://doi.org/10.1007/978-3-030-73194-6_12
Ghanbarpour ANiknafs KNaderi H(2020)Efficient keyword search over graph-structured data based on minimal covered r-cliquesFrontiers of Information Technology & Electronic Engineering10.1631/FITEE.180013321:3(448-464)Online publication date: 1-Apr-2020
https://doi.org/10.1631/FITEE.1800133
Koide SXiao CIshikawa Y(2020)Fast subtrajectory similarity search in road networks under weighted edit distance constraintsProceedings of the VLDB Endowment10.14778/3407790.340781813:12(2188-2201)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.14778/3407790.3407818
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents