109 search results - page 6 / 22 » Optimization Using Tuple Subsumption |
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
There has been interest recently in skyline queries, also called Pareto queries, on relational databases. Relational query languages do not support search for "best" tupl...
VLDB
2004
ACM
14 years 20 days ago
2004
ACM
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper shows a way to speed up search by using an encoding at bit level to model a particular domain. A bitboard is an unsigned integer whose bits have been given an interpret...