Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Recursive star-tree parallel data structure
SIAM Journal on Computing
A polylogarithmic approximation algorithm for the group Steiner tree problem
Journal of Algorithms
Storing and querying ordered XML using a relational database system
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
XRANK: ranked keyword search over XML documents
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Incremental computation and maintenance of temporal aggregates
The VLDB Journal — The International Journal on Very Large Data Bases
A Succinct Physical Storage Scheme for Efficient Evaluation of Path Queries in XML
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
BLAS: an efficient XPath processing system
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
On the integration of structure indexes and inverted lists
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
On boosting holism in XML twig pattern matching using structural indexing techniques
Proceedings of the 2005 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
From region encoding to extended dewey: on efficient processing of XML twig pattern matching
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Stack-based algorithms for pattern matching on DAGs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Bidirectional expansion for keyword search on graph databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Keyword Proximity Search in XML Trees
IEEE Transactions on Knowledge and Data Engineering
Sequencing XML data and query twigs for fast pattern matching
ACM Transactions on Database Systems (TODS)
Finding and approximating top-k answers in keyword proximity search
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Twig2Stack: bottom-up processing of generalized-tree-pattern queries over XML documents
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
BLINKS: ranked keyword searches on graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Identifying meaningful return information for XML keyword search
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
XSEarch: a semantic search engine for XML
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Holistic twig joins on indexed XML documents
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Enabling Schema-Free XQuery with meaningful query focus
The VLDB Journal — The International Journal on Very Large Data Bases
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
STAR: Steiner-Tree Approximation in Relationship Graphs
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Instance optimal query processing in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
Return specification inference and result clustering for keyword search on XML
ACM Transactions on Database Systems (TODS)
Proceedings of the VLDB Endowment
Theoretical and practical improvements on the RMQ-Problem, with applications to LCA and LCE
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Semantic relevance ranking for XML keyword search
Information Sciences: an International Journal
MALEX: a MAp-like exploration model on XML database
KEYS '12 Proceedings of the Third International Workshop on Keyword Search on Structured Data
Efficient keyword search on large tree structured datasets
KEYS '12 Proceedings of the Third International Workshop on Keyword Search on Structured Data
Spelling suggestion for XML keyword search based on pairwise keyword summaries
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
An extended compact TVP index for finding top-k nearest neighbors over XML data tree
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
A distance-based spelling suggestion method for XML keyword search
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Supporting range queries in XML keyword search
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Top-K nearest keyword search on large graphs
Proceedings of the VLDB Endowment
k-nearest keyword search in RDF graphs
Web Semantics: Science, Services and Agents on the World Wide Web
Spelling Suggestion for XML Keyword Search Based on XSketch Synopsis
Proceedings of International Conference on Information Integration and Web-based Applications & Services
Hi-index | 0.00 |
This paper studies the nearest keyword (NK) problem on XML documents. In general, the dataset is a tree where each node is associated with one or more keywords. Given a node q and a keyword w, an NK query returns the node that is nearest to q among all the nodes associated with w. NK search is not only useful as a stand-alone operator but also as a building brick for important tasks such as XPath query evaluation and keyword search. We present an indexing scheme that answers NK queries efficiently, in terms of both practical and worst-case performance. The query cost is provably logarithmic to the number of nodes carrying the query keyword. The proposed scheme occupies space linear to the dataset size, and can be constructed by a fast algorithm. Extensive experimentation confirms our theoretical findings, and demonstrates the effectiveness of NK retrieval as a primitive operator in XML databases.