Sciweavers

206 search results - page 18 / 42
» A nonblocking set optimized for querying the minimum value
Sort
View
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
14 years 9 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
INFOCOM
2010
IEEE
13 years 5 months ago
Measuring Availability in the Domain Name System
Abstract--The domain name system (DNS) is critical to Internet functionality. The availability of a domain name refers to its ability to be resolved correctly. We develop a model f...
Casey T. Deccio, Jeff Sedayao, Krishna Kant, Prasa...
JGTOOLS
2008
100views more  JGTOOLS 2008»
13 years 7 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
CASES
2009
ACM
14 years 2 months ago
Optimal loop parallelization for maximizing iteration-level parallelism
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
Duo Liu, Zili Shao, Meng Wang, Minyi Guo, Jingling...
VLDB
1991
ACM
165views Database» more  VLDB 1991»
13 years 11 months ago
Aggregation and Relevance in Deductive Databases
In this paper we present a technique to optimize queries on deductive databases that use aggregate operations such as min, max, and “largest Ic values.” Our approach is based ...
S. Sudarshan, Raghu Ramakrishnan