Sciweavers

146 search results - page 24 / 30
» Elliptic Indexing of Multidimensional Databases
Sort
View
DAWAK
2000
Springer
15 years 4 months ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton
116
Voted
EDBT
2008
ACM
102views Database» more  EDBT 2008»
15 years 11 months ago
Summary management in P2P systems
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffici...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
EDBT
2009
ACM
184views Database» more  EDBT 2009»
15 years 6 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 29 days ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
VLDB
2007
ACM
260views Database» more  VLDB 2007»
15 years 12 months ago
Approaching the Skyline in Z Order
Given a set of multidimensional data points, skyline query retrieves a set of data points that are not dominated by any other points. This query is useful for multi-preference ana...
Ken C. K. Lee, Baihua Zheng, Huajing Li, Wang-Chie...