Sciweavers

995 search results - page 149 / 199
» Optimization of Complex Nested Queries in Relational Databas...
Sort
View
159
Voted
EDBT
2010
ACM
200views Database» more  EDBT 2010»
16 years 1 months ago
Rewrite techniques for performance optimization of schema matching processes
A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures. In order to reduce the manual effor...
Eric Peukert, Henrike Berthold, Erhard Rahm
EDBT
2010
ACM
185views Database» more  EDBT 2010»
16 years 1 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
188
Voted
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
16 years 6 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
201
Voted
VLDB
2004
ACM
227views Database» more  VLDB 2004»
16 years 2 days 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...
174
Voted
VLDB
1995
ACM
97views Database» more  VLDB 1995»
15 years 10 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