Sciweavers

82 search results - page 4 / 17
» Partition Based Path Join Algorithms for XML Data
Sort
View
ICDE
2004
IEEE
137views Database» more  ICDE 2004»
14 years 9 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....
CIKM
2005
Springer
14 years 1 months ago
Optimizing cursor movement in holistic twig joins
Holistic twig join algorithms represent the state of the art for evaluating path expressions in XML queries. Using inverted indexes on XML elements, holistic twig joins move a set...
Marcus Fontoura, Vanja Josifovski, Eugene J. Sheki...
VLDB
2001
ACM
100views Database» more  VLDB 2001»
14 years 9 days ago
VXMLR: A Visual XML-Relational Database System
We demonstrate a visual based XML-Relational database system where XML data is managed by commercial RDBMS. A query interface enables users to form path expression based queries a...
Aoying Zhou, Hongjun Lu, Shihui Zheng, Yuqi Liang,...
BDA
2004
13 years 9 months ago
Path Sequence-Based XML Query Processing
We present the path sequence storage model, a new logical model for storing XML documents. This model partitions XML data and content according to the document paths; and uses orde...
Ioana Manolescu, Andrei Arion, Angela Bonifati, An...
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
14 years 8 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...