Sciweavers

303 search results - page 18 / 61
» Using a compact tree to index and query XML data
Sort
View
IS
2007
13 years 7 months ago
Efficient processing of XPath queries using indexes
: A number of indexing techniques have been proposed in recent times for optimizing the queries on XML and other semistructured data models. Most of the semistructured models use t...
Sanjay Kumar Madria, Yan Chen, Kalpdrum Passi, Sou...
ICDE
2007
IEEE
141views Database» more  ICDE 2007»
14 years 1 months ago
Self Managing Top-k (Summary, Keyword) Indexes in XML Retrieval
Retrieval queries that combine structural constraints with keyword search represent a significant challenge to XML data management systems. Queries are expected to be answered as...
Mariano P. Consens, Xin Gu, Yaron Kanza, Flavio Ri...
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
14 years 8 months ago
An Efficient XPath Query Processor for XML Streams
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
Yi Chen, Susan B. Davidson, Yifeng Zheng
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
14 years 8 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...
SIGMOD
2005
ACM
136views Database» more  SIGMOD 2005»
14 years 7 months ago
Peer-to-peer management of XML data: issues and research challenges
Peer-to-peer (p2p) systems are attracting increasing attention as an efficient means of sharing data among large, diverse and dynamic sets of users. The widespread use of XML as a...
Georgia Koloniari, Evaggelia Pitoura