Sciweavers

471 search results - page 56 / 95
» Graphical Querying of Multidimensional Databases
Sort
View
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
14 years 9 months ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani
ICDE
2006
IEEE
135views Database» more  ICDE 2006»
14 years 10 months ago
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
Man Lung Yiu, Nikos Mamoulis
ITCC
2002
IEEE
14 years 1 months ago
Performance of KDB-Trees with Query-Based Splitting
While the persistent data of many advanced database applications, such as OLAP and scientific studies, are characterized by very high dimensionality, typical queries posed on thes...
Yves Lépouchard, John L. Pfaltz, Ratko Orla...
GPC
2007
Springer
14 years 2 months ago
Design of PeerSum: A Summary Service for P2P Applications
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
SSDBM
2003
IEEE
95views Database» more  SSDBM 2003»
14 years 2 months ago
A Quad-Tree Based Multiresolution Approach for Two-dimensional Summary Data
In many application contexts, like statistical databases, scientific databases, query optimizers, OLAP, and so on, data are often summarized into synopses of aggregate values. Su...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...