Sciweavers

2859 search results - page 110 / 572
» Querying Complex Structured Databases
Sort
View
VLDB
2005
ACM
226views Database» more  VLDB 2005»
14 years 1 months 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
CIKM
2010
Springer
13 years 6 months ago
Probabilistic ranking for relational databases based on correlations
This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query ...
Jaehui Park, Sang-goo Lee
SAC
2005
ACM
14 years 1 months ago
A pivot-based index structure for combination of feature vectors
We present a novel indexing schema that provides efficient nearest-neighbor queries in multimedia databases consisting of objects described by multiple feature vectors. The bene...
Benjamin Bustos, Daniel A. Keim, Tobias Schreck
IC
2007
13 years 9 months ago
Native Temporal Slicing Support for XML Databases
Abstract XML databases, providing structural querying support, are becoming more and more popular. As we know, XML data may change over time and providing an efficient support to q...
Federica Mandreoli, Riccardo Martoglia, Enrico Ron...
CORR
2012
Springer
209views Education» more  CORR 2012»
12 years 3 months ago
Aggregation in Probabilistic Databases via Knowledge Compilation
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
Robert Fink, Larisa Han, Dan Olteanu