Sciweavers

146 search results - page 20 / 30
» Elliptic Indexing of Multidimensional Databases
Sort
View
DKE
1998
88views more  DKE 1998»
14 years 11 months ago
Temporal Grid File: A File Structure for Interval Data
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
Chiang Lee, Te-Ming Tseng
VLDB
1997
ACM
141views Database» more  VLDB 1997»
15 years 3 months ago
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimension...
Thomas Seidl, Hans-Peter Kriegel
95
Voted
PKDD
2004
Springer
118views Data Mining» more  PKDD 2004»
15 years 5 months ago
Mining Thick Skylines over Large Databases
Abstract. People recently are interested in a new operator, called skyline [3], which returns the objects that are not dominated by any other objects with regard to certain measure...
Wen Jin, Jiawei Han, Martin Ester
ICIP
2005
IEEE
16 years 1 months ago
Content-based video copy detection in large databases: a local fingerprints statistical similarity search approach
Recent methods based on interest points and local fingerprints have been proposed to perform robust CBCD (content-based copy detection) of images and video. They include two steps...
Alexis Joly, Carl Frélicot, Olivier Buisson
PODS
1997
ACM
182views Database» more  PODS 1997»
15 years 3 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...