Sciweavers

25 search results - page 2 / 5
» Selectivity Estimation for XML Twigs
Sort
View
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
14 years 6 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
ICDE
2006
IEEE
136views Database» more  ICDE 2006»
14 years 6 months ago
XCluster Synopses for Structured XML Content
We tackle the difficult problem of summarizing the path/branching structure and value content of an XML database that comprises both numeric and textual values. We introduce a nov...
Neoklis Polyzotis, Minos N. Garofalakis
DBKDA
2010
IEEE
169views Database» more  DBKDA 2010»
13 years 9 months ago
XLeaf: Twig Evaluation with Skipping Loop Joins and Virtual Nodes
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
Nils Grimsmo, Truls Amundsen Bjørklund, &Os...
DATESO
2008
131views Database» more  DATESO 2008»
13 years 6 months ago
Towards Cost-based Optimizations of Twig Content-based Queries
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
Michal Krátký, Radim Baca
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
14 years 4 months ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....