research-article

Reasoning and identifying relevant matches for XML keyword search

Authors:

Yi CherAuthors Info & Claims

Proceedings of the VLDB Endowment, Volume 1, Issue 1

Pages 921 - 932

https://doi.org/10.14778/1453856.1453956

Published: 01 August 2008 Publication History

Abstract

Keyword search is a user-friendly mechanism for retrieving XML data in web and scientific applications. An intuitively compelling but vaguely defined goal is to identify matches to query keywords that are relevant to the user. However, it is hard to directly evaluate the relevance of query results due to the inherent ambiguity of search semantics. In this work, we investigate an axiomatic framework that includes two intuitive and non-trivial properties that an XML keyword search technique should ideally satisfy: monotonicity and consistency, with respect to data and query. This is the first work that reasons about keyword search strategies from a formal perspective.

Then we propose a novel semantics for identifying relevant matches, which, to the best of our knowledge, is the only existing algorithm that satisfies both properties. An efficient algorithm is designed for realizing this semantics. Extensive experimental studies have verified the intuition of the properties and shown the effectiveness of the proposed algorithm.

References

[1]

Oracle berkeley db. http://www.oracle.com/technology/products/berkeley-db/index.html.

[2]

Timber project. http://www.eecs.umich.edu/db/timber/.

[3]

K. Arrow. Social Choice and Individual Values. 1951.

[4]

M. Barg and R. K. Wong. Structural proximity searching for large collections of semi-structured data. In CIKM, 2001.

Digital Library

[5]

S. Cohen, J. Mamou, Y. Kanza, and Y. Sagiv. XSEarch: A Semantic Search Engine for XML. In VLDB, 2003.

Digital Library

[6]

L. Guo, F. Shao, C. Botev, and J. Shanmugasundaram. XRANK: Ranked Keyword Search over XML Documents. In SIGMOD, 2003.

Digital Library

[7]

P. Hansen and F. S. Roberts. An impossibility result in axiomatic location theory. In Mathematics of Operations Research, 1996.

Digital Library

[8]

V. Hristidis, N. Koudas, Y. Papakonstantinou, and D. Srivastava. Keyword Proximity Search in XML Trees. IEEE Transactions on Knowledge and Data Engineering, 18(4), 2006.

Digital Library

[9]

V. Hristidis, Y. Papakonstantinou, and A. Balmin. Keyword Proximity Search on XML Graphs. In ICDE, 2003.

[10]

Y. Huang, Z. Liu, and Y. Chen. Query Biased Snippet Generation in XML Search. In SIGMOD, 2008.

Digital Library

[11]

J. Kleinberg. An Impossibility Theorem for Clustering. In NIPS, 2002.

[12]

G. Koutrika, A. Simitsis, and Y. E. Ioannidis. Précis: The essence of a query answer. In ICDE, 2006.

Digital Library

[13]

G. Li, J. Feng, J. Wang, and L. Zhou. Effective Keyword Search for Valuable LCAs over XML Documents. In CIKM, 2007.

Digital Library

[14]

Y. Li, C. Yu, and H. V. Jagadish. Schema-Free XQuery. In VLDB, 2004.

Digital Library

[15]

Z. Liu and Y. Chen. Identifying Meaningful Return Information for XML Keyword Search. In SIGMOD, 2007.

Digital Library

[16]

Z. Liu and Y. Chen. Answering Keyword Queries on XML Using Materialized Views. In ICDE, 2008.

Digital Library

[17]

M. J. Osborne and A. Rubinstein. A Course in Game Theory. In MIT Press, 1994.

[18]

D. M. Pennock, E. Horvitz, and C. L. Giles. An Impossibility Theorem for Clustering. In AAAI, 2000.

[19]

C. Sun, C.-Y. Chan, and A. Goenka. Multiway SLCA-based Keyword Search in XML Data. In WWW, 2007.

Digital Library

[20]

V. Vesper. Let's Do Dewey. http://www.mtsu.edu/vvesper/dewey.html.

[21]

Y. Xu and Y. Papakonstantinou. Efficient Keyword Search for Smallest LCAs in XML Databases. In SIGMOD, 2005.

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
Dass AAksoy CDimitriou ATheodoratos D(2017)Relaxation of keyword pattern graphs on RDF DataJournal of Web Engineering10.5555/3177589.317759116:5-6(363-398)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.5555/3177589.3177591
Bao ZYu YShen JFu Z(2017)A query refinement framework for xml keyword searchWorld Wide Web10.1007/s11280-017-0447-z20:6(1469-1505)Online publication date: 1-Nov-2017
https://dl.acm.org/doi/10.1007/s11280-017-0447-z
Show More Cited By

Index Terms

Reasoning and identifying relevant matches for XML keyword search

Recommendations

Identifying meaningful return information for XML keyword search
SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Management of data

Keyword search enables web users to easily access XML data without the need to learn a structured query language and to study possibly complex data schemas. Existing work has addressed the problem of selecting qualified data nodes that match keywords ...
Towards an Effective XML Keyword Search

Inspired by the great success of information retrieval (IR) style keyword search on the web, keyword search on XML has emerged recently. The difference between text database and XML database results in three new challenges: 1) Identify the user search ...
Return specification inference and result clustering for keyword search on XML

Keyword search enables Web users to easily access XML data without the need to learn a structured query language and to study possibly complex data schemas. Existing work has addressed the problem of selecting qualified data nodes that match keywords ...

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the VLDB Endowment

Proceedings of the VLDB Endowment Volume 1, Issue 1

August 2008

1216 pages

ISSN:2150-8097

Issue’s Table of Contents

Publisher

VLDB Endowment

Publication History

Published: 01 August 2008

Published in PVLDB Volume 1, Issue 1

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

65
Total Citations
View Citations
338
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 12 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
Dass AAksoy CDimitriou ATheodoratos D(2017)Relaxation of keyword pattern graphs on RDF DataJournal of Web Engineering10.5555/3177589.317759116:5-6(363-398)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.5555/3177589.3177591
Bao ZYu YShen JFu Z(2017)A query refinement framework for xml keyword searchWorld Wide Web10.1007/s11280-017-0447-z20:6(1469-1505)Online publication date: 1-Nov-2017
https://dl.acm.org/doi/10.1007/s11280-017-0447-z
Yan DCheng JÖzsu MYang FLu YLui JZhang QNg W(2016)A general-purpose query-centric framework for querying big graphsProceedings of the VLDB Endowment10.14778/2904483.29044889:7(564-575)Online publication date: 1-Mar-2016
https://dl.acm.org/doi/10.14778/2904483.2904488
Le TLing T(2016)Survey on Keyword Search over XML DocumentsACM SIGMOD Record10.1145/3022860.302286345:3(17-28)Online publication date: 6-Dec-2016
https://dl.acm.org/doi/10.1145/3022860.3022863
Zhou JWang WChen ZYu JTang XLu YLi Y(2016)Top-Down XML Keyword Query ProcessingIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2016.251653628:5(1340-1353)Online publication date: 1-May-2016
https://dl.acm.org/doi/10.1109/TKDE.2016.2516536
Dimitriou ATheodoratos DSellis T(2015)Top-k-size keyword search on tree structured dataInformation Systems10.1016/j.is.2014.07.00247:C(178-193)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.1016/j.is.2014.07.002
Le TBao ZLing T(2015)Exploiting semantics for XML keyword searchData & Knowledge Engineering10.1016/j.datak.2015.06.00399:C(105-125)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1016/j.datak.2015.06.003
Chen ZLiu JZhao XZhou J(2015)Efficient subtree results computation for XML keyword queriesFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-014-3473-39:2(253-264)Online publication date: 1-Apr-2015
https://dl.acm.org/doi/10.1007/s11704-014-3473-3
Bao ZZeng YLing TZhang DLi GJagadish H(2015)A general framework to resolve the MisMatch problem in XML keyword searchThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-015-0386-124:4(493-518)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1007/s00778-015-0386-1
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 Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents