Sciweavers

2514 search results - page 109 / 503
» On the Computation of Approximations of Database Queries
Sort
View
VLDB
2006
ACM
147views Database» more  VLDB 2006»
16 years 6 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
TPDS
1998
112views more  TPDS 1998»
15 years 6 months ago
Parallel Computation in Biological Sequence Analysis
—A massive volume of biological sequence data is available in over 36 different databases worldwide, including the sequence data generated by the Human Genome project. These data...
Tieng K. Yap, Ophir Frieder, Robert L. Martino
SIGMOD
2003
ACM
147views Database» more  SIGMOD 2003»
16 years 6 months ago
Formal semantics and analysis of object queries
Modern database systems provide not only powerful data models but also complex query languages supporting powerful features such as the ability to create new database objects and ...
Gavin M. Bierman
CIDR
2007
165views Algorithms» more  CIDR 2007»
15 years 7 months ago
A Black-Box Approach to Query Cardinality Estimation
We present a “black-box” approach to estimating query cardinality that has no knowledge of query execution plans and data distribution, yet provides accurate estimates. It doe...
Tanu Malik, Randal C. Burns, Nitesh V. Chawla
DASFAA
2007
IEEE
208views Database» more  DASFAA 2007»
16 years 23 days ago
Probabilistic Nearest-Neighbor Query on Uncertain Objects
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...
Hans-Peter Kriegel, Peter Kunath, Matthias Renz