Sciweavers

958 search results - page 26 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
VLDB
2001
ACM
115views Database» more  VLDB 2001»
13 years 12 months ago
Dynamic Update Cube for Range-sum Queries
A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the se...
Seok-Ju Chun, Chin-Wan Chung, Ju-Hong Lee, Seok-Ly...
VLDB
1990
ACM
166views Database» more  VLDB 1990»
13 years 11 months ago
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data
In this paper, we present an efficient algorithm for managing replicated data. We impose a logical tree structure on the set of copies of an object. In a failurefree environment t...
Divyakant Agrawal, Amr El Abbadi
SBBD
2004
89views Database» more  SBBD 2004»
13 years 8 months ago
DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the quer...
Marcos R. Vieira, Caetano Traina Jr., Fabio Jun Ta...
JDCTA
2010
151views more  JDCTA 2010»
13 years 2 months ago
Research on Querying Node Probability Method in Probabilistic XML Data Based on Possible World
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
Jianwei Wang, Zhongxiao Hao
VLDB
2005
ACM
226views Database» more  VLDB 2005»
14 years 27 days ago
BATON: A Balanced Tree Structure for Peer-to-Peer Networks
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure caus...
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu