Sciweavers

210 search results - page 36 / 42
» On Efficient Part-match Querying of XML Data
Sort
View
EDBT
2002
ACM
129views Database» more  EDBT 2002»
14 years 9 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
SIGMOD
2003
ACM
239views Database» more  SIGMOD 2003»
14 years 9 months ago
D(k)-Index: An Adaptive Structural Summary for Graph-Structured Data
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...
Chen Qun, Andrew Lim, Kian Win Ong
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
14 years 9 months ago
The TopX DB&IR engine
This paper proposes a demo of the TopX search engine, an extensive framework for unified indexing, querying, and ranking of large collections of unstructured, semistructured, and ...
Martin Theobald, Ralf Schenkel, Gerhard Weikum
VLDB
2001
ACM
153views Database» more  VLDB 2001»
14 years 1 months ago
A Fast Index for Semistructured Data
Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special i...
Brian F. Cooper, Neal Sample, Michael J. Franklin,...
ICDE
2010
IEEE
428views Database» more  ICDE 2010»
14 years 8 months ago
Supporting Top-K Keyword Search in XML Databases
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
Liang Jeff Chen, Yannis Papakonstantinou