Sciweavers

21 search results - page 4 / 5
» Path summaries and path partitioning in modern XML databases
Sort
View
SIGMOD
2003
ACM
239views Database» more  SIGMOD 2003»
14 years 6 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
ICDE
2004
IEEE
90views Database» more  ICDE 2004»
14 years 7 months ago
Multiresolution Indexing of XML for Frequent Queries
XML and other types of semi-structured data are typically represented by a labeled directed graph. To speed up path expression queries over the graph, a variety of structural inde...
Hao He, Jun Yang 0001
DBPL
2003
Springer
144views Database» more  DBPL 2003»
13 years 11 months ago
A General Framework for Estimating XML Query Cardinality
Abstract. In the context of XML data management systems, the estimation of query cardinality is becoming more and more important: the information provided by a query result estimat...
Carlo Sartiani
ICDE
2004
IEEE
137views Database» more  ICDE 2004»
14 years 7 months ago
Selectivity Estimation for XML Twigs
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
EDBT
2006
ACM
150views Database» more  EDBT 2006»
14 years 6 months ago
Improving the Efficiency of XPath Execution on Relational Systems
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
Haris Georgiadis, Vasilis Vassalos