Sciweavers

1500 search results - page 202 / 300
» Query Optimization in Database Grid
Sort
View
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 9 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
2007
ACM
182views Database» more  VLDB 2007»
14 years 3 months ago
Continuous Queries in Oracle
This paper describes Continuous Queries (CQ) in Oracle RDBMS, a feature that incorporates stream and complex event processing into an RDBMS, the first such attempt in commercial d...
Sankar Subramanian, Srikanth Bellamkonda, Hua-Gang...
VLDB
2004
ACM
227views Database» more  VLDB 2004»
14 years 2 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...
EDBT
2002
ACM
141views Database» more  EDBT 2002»
14 years 9 months ago
Efficient OLAP Query Processing in Distributed Data Warehouses
Abstract. The success of Internet applications has led to an explosive growth in the demand for bandwidth from ISPs. Managing an IP network requires collecting and analyzing networ...
Michael O. Akinde, Michael H. Böhlen, Theodor...
VLDB
1995
ACM
97views Database» more  VLDB 1995»
14 years 25 days 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