Sciweavers

2859 search results - page 90 / 572
» Querying Complex Structured Databases
Sort
View
OPODIS
2007
13 years 9 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...
SIGMOD
2003
ACM
174views Database» more  SIGMOD 2003»
14 years 8 months ago
ViST: A Dynamic Index Method for Querying XML Data by Tree Structures
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this pape...
Haixun Wang, Sanghyun Park, Wei Fan, Philip S. Yu
PODS
2002
ACM
154views Database» more  PODS 2002»
14 years 8 months ago
How to Evaluate Multiple Range-Sum Queries Progressively
Decision support system users typically submit batches of range-sum queries simultaneously rather than issuing individual, unrelated queries. We propose a wavelet based technique ...
Rolfe R. Schmidt, Cyrus Shahabi
SIGMOD
2003
ACM
239views Database» more  SIGMOD 2003»
14 years 8 months ago
D(k)-Index: An Adaptive Structural Summary for Graph-Structured Data
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...
Chen Qun, Andrew Lim, Kian Win Ong
IDEAS
2005
IEEE
111views Database» more  IDEAS 2005»
14 years 1 months ago
Evaluation of Queries on Tree-Structured Data Using Dimension Graphs
The recent proliferation of XML-based standards and technologies for managing data on the Web demonstrates the need for effective and efficient management of treestructured data....
Theodore Dalamagas, Dimitri Theodoratos, Antonis K...