Sciweavers

491 search results - page 23 / 99
» Optimizing Large OODB Queries
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
Optimized Inverted List Assignment in Distributed Search Engine Architectures
We study efficient query processing in distributed web search engines with global index organization. The main performance bottleneck in this case is due to the large amount of i...
Jiangong Zhang, Torsten Suel
ICDT
1995
ACM
79views Database» more  ICDT 1995»
13 years 11 months ago
Optimization Using Tuple Subsumption
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
Venky Harinarayan, Ashish Gupta
WAE
2000
128views Algorithms» more  WAE 2000»
13 years 9 months ago
Planar Point Location for Large Data Sets: To Seek or Not to Seek
We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket metho...
Jan Vahrenhold, Klaus Hinrichs
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 10 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
ICDT
2005
ACM
124views Database» more  ICDT 2005»
14 years 1 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken