31 search results - page 6 / 7 » Partial Selection Query in Peer-to-Peer Databases |
SSDBM
2000
IEEE
13 years 9 months ago
2000
IEEE
Existing datacube precompuatation schemes materialize selected datacube tuples on disk, choosing the most beneficial cuboids (i.e., combinations of dimensions) to materialize giv...
VLDB
2001
ACM
13 years 9 months ago
2001
ACM
In this paper we focus on the following problem in information management: given a large collection of recorded information and some knowledge of the process that is generating th...
BMCBI
2008
13 years 4 months ago
2008
Background: Ontologies such as the Gene Ontology can enable the construction of complex queries over biological information in a conceptual way, however existing systems to do thi...
SIGMOD
1994
ACM
13 years 8 months ago
1994
ACM
We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches ...
VLDB
2002
ACM
13 years 4 months ago
2002
ACM
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...