Sciweavers

951 search results - page 136 / 191
» Groupwise Processing of Relational Queries
Sort
View
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 8 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
159
Voted
CIKM
1994
Springer
15 years 8 months ago
TID Hash Joins
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...
Robert Marek, Erhard Rahm
TCSV
2008
150views more  TCSV 2008»
15 years 3 months ago
Robust Video Fingerprinting for Content-Based Video Identification
Video fingerprints are feature vectors that uniquely characterize one video clip from another. The goal of video fingerprinting is to identify a given video query in a database (DB...
Sunil Lee, Chang Dong Yoo
127
Voted
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 10 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
VLDB
2004
ACM
128views Database» more  VLDB 2004»
16 years 4 months ago
Operator scheduling in data stream systems
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or realtime query responses in su...
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev ...