Sciweavers

555 search results - page 67 / 111
» Aggregate Evaluability in Statistical Databases
Sort
View
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
14 years 4 days 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
SIGMOD
1997
ACM
135views Database» more  SIGMOD 1997»
13 years 12 months ago
High-Performance Sorting on Networks of Workstations
We report the performance of NOW-Sort, a collection of sorting implementations on a Network of Workstations (NOW). We find that parallel sorting on a NOW is competitive to sortin...
Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau,...
DEXA
2010
Springer
319views Database» more  DEXA 2010»
13 years 8 months ago
An Efficient Similarity Join Algorithm with Cosine Similarity Predicate
Given a large collection of objects, finding all pairs of similar objects, namely similarity join, is widely used to solve various problems in many application domains.Computation ...
Dongjoo Lee, Jaehui Park, Junho Shim, Sang-goo Lee
ICOODB
2010
129views Database» more  ICOODB 2010»
13 years 6 months ago
Solving ORM by MAGIC: MApping GeneratIon and Composition
Object-relational mapping (ORM) technologies have been proposed as a solution for the impedance mismatch problem between object-oriented applications and relational databases. Exis...
David Kensche, Christoph Quix, Xiang Li 0002, Sand...
MIS
2004
Springer
162views Multimedia» more  MIS 2004»
14 years 1 months ago
Integrating the Results of Multimedia Sub-Queries Using Qualitative Preferences
When similarity queries over multimedia databases are processed by splitting the overall query condition into a set of sub-queries, the problem of how to efficiently and effectiv...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...