Storing and querying ordered XML using a relational database system
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
XRANK: ranked keyword search over XML documents
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient keyword search for smallest LCAs in XML databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Keyword Proximity Search in XML Trees
IEEE Transactions on Knowledge and Data Engineering
Multiway SLCA-based keyword search in XML data
Proceedings of the 16th international conference on World Wide Web
XSEarch: a semantic search engine for XML
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Effective keyword search for valuable lcas over xml documents
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Efficient LCA based keyword search in XML data
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Reasoning and identifying relevant matches for XML keyword search
Proceedings of the VLDB Endowment
Retrieving meaningful relaxed tightest fragments for XML keyword search
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Hash-Search: An Efficient SLCA-Based Keyword Search Algorithm on XML Documents
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Fast ELCA computation for keyword queries on XML data
Proceedings of the 13th International Conference on Extending Database Technology
Keyword-based search and exploration on databases
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Fast SLCA and ELCA Computation for XML Keyword Queries Based on Set Intersection
ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
Hi-index | 0.00 |
Efficiently answering XML keyword queries has attracted much research effort in the last decade. One key factors resulting in the inefficiency of existing methods are the common-ancestor-repetition (CAR) and visiting-useless-nodes (VUN) problems. In this paper, we propose a generic top-down processing strategy to answer a given keyword query w.r.t. LCA/SLCA/ELCA semantics. By top-down, we mean that we visit all common ancestor (CA) nodes in a depth-first, left-to-right order, thus avoid the CAR problem; by generic, we mean that our method is independent of the labeling schemes and query semantics. We show that the satisfiability of a node v w.r.t. the given semantics can be determined by v's child nodes, based on which our methods avoid the VUN problem. We propose two algorithms that are based on either traditional inverted lists or our newly proposed LLists to improve the overall performance. The experimental results verify the benefits of our methods according to various evaluation metrics.