Sciweavers

6974 search results - page 1053 / 1395
» Querying Semi-Structured Data
Sort
View
CEC
2011
IEEE
14 years 4 months ago
Multi-level indexing in a distributed self-organized storage system
—In many systems providing storage and retrieval operations on data, indices are used to make these operations more efficient. Distributed storage systems provide means to distr...
Hannes Mühleisen, Tilman Walther, Robert Tolk...
FOCS
2008
IEEE
15 years 11 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
206
Voted
ICDE
2007
IEEE
127views Database» more  ICDE 2007»
16 years 6 months ago
Efficiently Detecting Inclusion Dependencies
Data sources for data integration often come with spurious schema definitions such as undefined foreign key constraints. Such metadata are important for querying the database and ...
Jana Bauckmann, Ulf Leser, Felix Naumann, Veroniqu...
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
16 years 6 months ago
SD-Rtree: A Scalable Distributed Rtree
We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point and window queries over possibly large spatial datasets distributed on c...
Cédric du Mouza, Philippe Rigaux, Witold Li...
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 5 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
« Prev « First page 1053 / 1395 Last » Next »