Sciweavers

1429 search results - page 119 / 286
» Efficient processing of XPath queries using indexes
Sort
View
SIGMOD
2001
ACM
213views Database» more  SIGMOD 2001»
14 years 9 months ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...
GIS
2003
ACM
14 years 10 months ago
Processing in-route nearest neighbor queries: a comparison of alternative approaches
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, e.g., locationbased services, advanced traveler information syst...
Shashi Shekhar, Jin Soung Yoo
VLDB
2002
ACM
126views Database» more  VLDB 2002»
13 years 8 months ago
Plan Selection Based on Query Clustering
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, ...
EDBT
2008
ACM
128views Database» more  EDBT 2008»
14 years 9 months ago
Processing transitive nearest-neighbor queries in multi-channel access environments
Wireless broadcast is an efficient way for information dissemination due to its good scalability [10]. Existing works typically assume mobile devices, such as cell phones and PDAs...
Xiao Zhang, Wang-Chien Lee, Prasenjit Mitra, Baihu...
COSIT
1995
Springer
111views GIS» more  COSIT 1995»
14 years 17 days ago
Range Queries Involving Spatial Relations: A Performance Analysis
: Spatial relations are becoming an important aspect of spatial access methods because of the increasing interest on qualitative spatial information processing. In this paper we sh...
Yannis Theodoridis, Dimitris Papadias