Sciweavers

184 search results - page 35 / 37
» A new range query algorithm for Universal B-trees
Sort
View
ADBIS
2007
Springer
117views Database» more  ADBIS 2007»
15 years 3 months ago
Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
Tomás Skopal, David Hoksza
SSD
2001
Springer
113views Database» more  SSD 2001»
15 years 1 months ago
Object-Relational Indexing for General Interval Relationships
Intervals represent a fundamental data type for temporal, scientific, and spatial databases where time stamps and point data are extended to time spans and range data, respectively...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
85
Voted
SIGGRAPH
2000
ACM
15 years 1 months ago
Conservative volumetric visibility with occluder fusion
Visibility determination is a key requirement in a wide range of graphics algorithms. This paper introduces a new approach to the computation of volume visibility, the detection o...
Gernot Schaufler, Julie Dorsey, Xavier Déco...
TON
2010
188views more  TON 2010»
14 years 4 months ago
Self-Chord: A Bio-Inspired P2P Framework for Self-Organizing Distributed Systems
This paper presents "Self-Chord," a peer-to-peer (P2P) system that inherits the ability of Chord-like structured systems for the construction and maintenance of an overla...
Agostino Forestiero, Emilio Leonardi, Carlo Mastro...
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
15 years 11 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...