Sciweavers

91 search results - page 13 / 19
» The hcC-tree: An Efficient Index Structure for Object Orient...
Sort
View
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 8 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...
ADBIS
2000
Springer
119views Database» more  ADBIS 2000»
14 years 27 days ago
A Benchmarking Technique for DBMS's with Advanced Data Models
The majority of database benchmarks currently in use in the industry were designed for relational databases. A different class of benchmarks became required for object oriented dat...
Naphtali Rishe, Alexander Vaschillo, Dmitry Vasile...
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
14 years 10 months ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe
GVD
2009
128views Database» more  GVD 2009»
13 years 6 months ago
A Self-Adaptive Insert Strategy for Content-Based Multidimensional Database Storage
In this paper, we present the current development progress of our dynamic insert strategy based on the Intelligent Cluster Index (ICIx), which is a new type of multidimensional da...
Sebastian Leuoth, Wolfgang Benn
JUCS
2007
122views more  JUCS 2007»
13 years 8 months ago
Efficient Access Methods for Temporal Interval Queries of Video Metadata
: Indexing video content is one of the most important problems in video databases. In this paper we present linear time and space algorithms for handling video metadata that repres...
Spyros Sioutas, Kostas Tsichlas, Bill Vassiliadis,...