Sciweavers

6004 search results - page 436 / 1201
» Parallelizing query optimization
Sort
View
COCOON
1999
Springer
15 years 11 months ago
An External Memory Data Structure for Shortest Path Queries
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
David A. Hutchinson, Anil Maheshwari, Norbert Zeh
CIDR
2009
129views Algorithms» more  CIDR 2009»
15 years 8 months ago
Extracting and Querying a Comprehensive Web Database
Recent research in domain-independent information extraction holds the promise of an automatically-constructed structured database derived from the Web. A query system based on th...
Michael J. Cafarella
EDBT
2004
ACM
143views Database» more  EDBT 2004»
16 years 7 months ago
OGSA-DQP: A Service for Distributed Querying on the Grid
OGSA-DQP is a distributed query processor exposed to users as an Open Grid Services Architecture (OGSA)-compliant Grid service. This service supports the compilation and evaluation...
M. Nedim Alpdemir, Arijit Mukherjee, Anastasios Go...
DAGSTUHL
2004
15 years 8 months ago
Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults
A well-studied problem in fault diagnosis is to identify the set of all good processors in a given set {p1, p2, . . . , pn} of processors via asking some processors pi to test whet...
William I. Gasarch, Frank Stephan
COCOON
1998
Springer
15 years 11 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...