Sciweavers

505 search results - page 4 / 101
» Efficient Temporal Join Processing Using Indices
Sort
View
VLDB
1990
ACM
106views Database» more  VLDB 1990»
13 years 11 months ago
The Time Index: An Access Structure for Temporal Data
In this paper, we describe a new indexing technique, the time indez, for improving the performance of certain classes of temporal queries. The time index can be used to retrieve v...
Ramez Elmasri, Gene T. J. Wuu, Yeong-Joon Kim
SIGMOD
1993
ACM
78views Database» more  SIGMOD 1993»
13 years 11 months ago
Efficient Processing of Spatial Joins Using R-Trees
Thomas Brinkhoff, Hans-Peter Kriegel, Bernhard See...
CIKM
2009
Springer
13 years 11 months ago
Multidimensional routing indices for efficient distributed query processing
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
PODS
1999
ACM
133views Database» more  PODS 1999»
13 years 11 months ago
Processing and Optimization of Multiway Spatial Joins Using R-Trees
One of the most important types of query processing in spatial databases and geographic information systems is the spatial join, an operation that selects, from two relations, all...
Dimitris Papadias, Nikos Mamoulis, Yannis Theodori...
TKDE
1998
142views more  TKDE 1998»
13 years 7 months ago
Performance Analysis of Three Text-Join Algorithms
—When a multidatabase system contains textual database systems (i.e., information retrieval systems), queries against the global schema of the multidatabase system may contain a ...
Weiyi Meng, Clement T. Yu, Wei Wang 0010, Naphtali...