Sciweavers

750 search results - page 117 / 150
» Aggregates in Possibilistic Databases
Sort
View
SIGMOD
1997
ACM
135views Database» more  SIGMOD 1997»
14 years 2 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,...
ESWS
2008
Springer
13 years 11 months ago
Integrating Open Sources and Relational Data with SPARQL
We believe that the possibility to use SPARQL as a front end to heterogeneous data without significant cost in performance or expressive power is key to RDF taking its rightful pla...
Orri Erling, Ivan Mikhailov
BNCOD
1997
76views Database» more  BNCOD 1997»
13 years 11 months ago
Query Evaluation in CROQUE - Calculus and Algebra Coincide
With the substantial change of declarative query languages from plain SQL to the so-called \object SQLs", in particular OQL, there has surprisingly been not much change in the...
Torsten Grust, Joachim Kröger, Dieter Gluche,...
DEXA
2010
Springer
319views Database» more  DEXA 2010»
13 years 10 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 8 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...