Sciweavers

431 search results - page 3 / 87
» KPYR: An Efficient Indexing Method
Sort
View
DEBU
2010
238views more  DEBU 2010»
13 years 7 months ago
Spatio-Temporal Access Methods: Part 2 (2003 - 2010)
In spatio-temporal applications, moving objects detect their locations via location-aware devices and update their locations continuously to the server. With the ubiquity and mass...
Long-Van Nguyen-Dinh, Walid G. Aref, Mohamed F. Mo...
DAWAK
1999
Springer
13 years 11 months ago
Efficient Bulk Loading of Large High-Dimensional Indexes
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
Christian Böhm, Hans-Peter Kriegel
IS
2007
13 years 7 months ago
Efficient processing of XPath queries using indexes
: A number of indexing techniques have been proposed in recent times for optimizing the queries on XML and other semistructured data models. Most of the semistructured models use t...
Sanjay Kumar Madria, Yan Chen, Kalpdrum Passi, Sou...
JUCS
2007
122views more  JUCS 2007»
13 years 7 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,...
DATESO
2004
81views Database» more  DATESO 2004»
13 years 9 months ago
Pivoting M-tree: A Metric Access Method for Efficient Similarity Search
In this paper pivoting M-tree (PM-tree) is introduced, a metric access method combining M-tree with the pivot-based approach. While in M-tree a metric region is represented by a hy...
Tomás Skopal