Sciweavers

11213 search results - page 123 / 2243
» Low-contention data structures
Sort
View
CORR
2007
Springer
47views Education» more  CORR 2007»
15 years 6 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...
COCOON
1998
Springer
15 years 10 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...
SIGMOD
2004
ACM
144views Database» more  SIGMOD 2004»
16 years 6 months ago
Information-Theoretic Tools for Mining Database Structure from Large Data Sets
Periklis Andritsos, Renée J. Miller, Panayi...