Sciweavers

153 search results - page 11 / 31
» Hash-Based Structural Join Algorithms
Sort
View
ADBIS
1994
Springer
87views Database» more  ADBIS 1994»
13 years 11 months ago
Variations of R-Tree Structure for Indexing of Spatial Objects
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
M. G. Martynov
SIGMOD
2003
ACM
190views Database» more  SIGMOD 2003»
14 years 7 months ago
Hardware Acceleration for Spatial Selections and Joins
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
Chengyu Sun, Divyakant Agrawal, Amr El Abbadi
ADC
2005
Springer
97views Database» more  ADC 2005»
14 years 28 days ago
Querying and Maintaining Ordered XML Data using Relational Databases
Although data stored in XML is of increasing importance, most existing data repositories are still managed by relational database systems. In light of this, recent XML database re...
William M. Shui, Franky Lam, Damien K. Fisher, Ray...
CCGRID
2009
IEEE
14 years 2 months ago
Self-Chord: A Bio-inspired Algorithm for Structured P2P Systems
This paper presents “Self-Chord”, a bio-inspired P2P algorithm that can be profitably adopted to build the information service of distributed systems, in particular Computati...
Agostino Forestiero, Carlo Mastroianni, Michela Me...
ESA
2006
Springer
125views Algorithms» more  ESA 2006»
13 years 9 months ago
Purely Functional Worst Case Constant Time Catenable Sorted Lists
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
Gerth Stølting Brodal, Christos Makris, Kos...