Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
New algorithms for the LCA problem and the binary tree reconstruction problem
Information Processing Letters
Integrating keyword search into XML query processing
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
DBXplorer: enabling keyword search over relational databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
The Index-Based XXL Search Engine for Querying XML Data with Relevance Ranking
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Querying Semistructured Heterogeneous Information
DOOD '95 Proceedings of the Fourth International Conference on Deductive and Object-Oriented Databases
Querying XML Documents Made Easy: Nearest Concept Queries
Proceedings of the 17th International Conference on Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
Searching XML documents via XML fragments
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Querying structured text in an XML database
Proceedings of the 2003 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
Texquery: a full-text search extension to xquery
Proceedings of the 13th international conference on World Wide Web
FleXPath: flexible structure and full-text querying for XML
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
IBM Systems Journal
Efficient keyword search for smallest LCAs in XML databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
NaLIX: an interactive natural language interface for querying XML
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Discover: keyword search in relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
BANKS: browsing and keyword searching in relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XSEarch: a semantic search engine for XML
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Making database systems usable
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Assigning semantics to partial tree-pattern queries
Data & Knowledge Engineering
Information Systems
Information Systems
Exploring XML web collections with DescribeX
ACM Transactions on the Web (TWEB)
Structural consistency: enabling XML keyword search to eliminate spurious results consistently
The VLDB Journal — The International Journal on Very Large Data Bases
Exploit keyword query semantics and structure of data for effective XML keyword search
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
Nearest keyword search in XML documents
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Relevant answers for XML keyword search: a skyline approach
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
Effective keyword search for candidate fragments of XML documents
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
K-graphs: selecting top-k data sources for XML keyword queries
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Constructing a generic natural language interface for an XML database
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Top-K data source selection for keyword queries over multiple XML data sources
Journal of Information Science
DNIS'11 Proceedings of the 7th international conference on Databases in Networked Information Systems
Hi-index | 0.00 |
The widespread adoption of XML holds the promise that document structure can be exploited to specify precise database queries. However, users may have only a limited knowledge of the XML structure, and may be unable to produce a correct XQuery expression, especially in the context of a heterogeneous information collection. The default is to use keyword-based search and we are all too familiar with how difficult it is to obtain precise answers by these means. We seek to address these problems by introducing the notion of Meaningful Query Focus (MQF) for finding related nodes within an XML document. MQF enables users to take full advantage of the preciseness and efficiency of XQuery without requiring (perfect) knowledge of the document structure. Such a Schema-Free XQuery is potentially of value not just to casual users with partial knowledge of schema, but also to experts working in data integration or data evolution. In such a context, a schema-free query, once written, can be applied universally to multiple data sources that supply similar content under different schemas, and applied "forever" as these schemas evolve. Our experimental evaluation found that it is possible to express a wide variety of queries in a schema-free manner and efficiently retrieve correct results over a broad diversity of schemas. Furthermore, the evaluation of a schema-free query is not expensive: using a novel stack-based algorithm we developed for computing MQF, the overhead is from 1 to 4 times the execution time of an equivalent schema-aware query. The evaluation cost of schema-free queries can be further reduced by as much as 68% using a selectivity-based algorithm we develop to enable the integration of MQF operation into the query pipeline.