Sciweavers

707 search results - page 11 / 142
» Processing queries on tree-structured data efficiently
Sort
View
JSS
2008
139views more  JSS 2008»
15 years 2 months ago
Dynamic interval-based labeling scheme for efficient XML query and update processing
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
Jung-Hee Yun, Chin-Wan Chung
DKE
2006
110views more  DKE 2006»
15 years 2 months ago
Efficient recursive XML query processing using relational database systems
Recursive queries are quite important in the context of XML databases. In addition, several recent papers have investigated a relational approach to store XML data and there is gr...
Sandeep Prakash, Sourav S. Bhowmick, Sanjay Kumar ...
133
Voted
CIKM
2006
Springer
15 years 4 months ago
Processing relaxed skylines in PDMS using distributed data summaries
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...
Katja Hose, Christian Lemke, Kai-Uwe Sattler
VLDB
2007
ACM
102views Database» more  VLDB 2007»
16 years 2 months ago
Randomized Algorithms for Data Reconciliation in Wide Area Aggregate Query Processing
Many aspects of the data integration problem have been considered in the literature: how to match schemas across different data sources, how to decide when different records refer...
Fei Xu, Chris Jermaine
VLDB
2005
ACM
120views Database» more  VLDB 2005»
15 years 7 months ago
Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an effic...
Jost Enderle, Nicole Schneider, Thomas Seidl