Sciweavers

8220 search results - page 62 / 1644
» Querying XML Data
Sort
View
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
14 years 10 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...
ICDE
2005
IEEE
131views Database» more  ICDE 2005»
14 years 10 months ago
On the Sequencing of Tree Structures for XML Indexing
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
Haixun Wang, Xiaofeng Meng
ENTCS
2006
133views more  ENTCS 2006»
13 years 9 months ago
A Data Model for Data Integration
Data integration systems provide a uniform query interface (UQI) to multiple, autonomous data sources [4]. This paper presents the universal data model (UDM) that captures the sem...
James J. Lu
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
14 years 10 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 10 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...