Sciweavers

4337 search results - page 749 / 868
» Cache-Oblivious Query Processing
Sort
View
SIGMOD
2003
ACM
152views Database» more  SIGMOD 2003»
14 years 10 months ago
Using Sets of Feature Vectors for Similarity Search on Voxelized CAD Objects
In modern application domains such as multimedia, molecular biology and medical imaging, similarity search in database systems is becoming an increasingly important task. Especial...
Hans-Peter Kriegel, Stefan Brecheisen, Peer Kr&oum...
SIGMOD
2003
ACM
196views Database» more  SIGMOD 2003»
14 years 10 months ago
Spreadsheets in RDBMS for OLAP
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozk...
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 10 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
SIGMOD
2001
ACM
135views Database» more  SIGMOD 2001»
14 years 10 months ago
The Network is the Database: Data Management for Highly Distributed Systems
This paper describes the methodology and implementation of a data management system for highly distributed systems, which was built to solve the scalability and reliability proble...
Julio C. Navas, Michael J. Wynblatt
PODS
2003
ACM
158views Database» more  PODS 2003»
14 years 10 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv