Sciweavers

716 search results - page 110 / 144
» Optimizing Queries in Extended Relational Databases
Sort
View
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
15 years 5 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 6 months ago
Optimizing joins in a map-reduce environment
Implementations of map-reduce are being used to perform many operations on very large data. We examine strategies for joining several relations in the map-reduce environment. Our ...
Foto N. Afrati, Jeffrey D. Ullman
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
15 years 11 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 4 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
VLDB
1995
ACM
97views Database» more  VLDB 1995»
15 years 2 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch