Sciweavers

312 search results - page 52 / 63
» Indexing Gapped-Factors Using a Tree
Sort
View
ICDIM
2009
IEEE
16 years 16 days ago
The mqr-tree: Improving upon a 2-dimensional spatial access method
We propose the mqr-tree, a two-dimensional spatial access method that improves upon the 2DR-tree. The 2DRtree uses two-dimensional nodes so that the relationships between all obje...
Marc Moreau, Wendy Osborn, Brad Anderson
GIS
2004
ACM
16 years 7 months ago
Object-relational management of complex geographical objects
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new re...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
SIGMETRICS
2003
ACM
147views Hardware» more  SIGMETRICS 2003»
15 years 11 months ago
Effect of node size on the performance of cache-conscious B+-trees
In main-memory databases, the number of processor cache misses has a critical impact on the performance of the system. Cacheconscious indices are designed to improve performance b...
Richard A. Hankins, Jignesh M. Patel
ICALP
2003
Springer
15 years 11 months ago
Quantum Search on Bounded-Error Inputs
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
Peter Høyer, Michele Mosca, Ronald de Wolf
EJC
2003
15 years 7 months ago
An Algebraic Approach for Specifying Compound Terms in Faceted Taxonomies
Abstract. A faceted taxonomy is a set of taxonomies, each describing a given domain from a different aspect, or facet. The indexing of domain objects is done through conjunctive c...
Yannis Tzitzikas, Anastasia Analyti, Nicolas Spyra...