Sciweavers

2985 search results - page 8 / 597
» Indexing Distributed Complex Data for Complex Queries
Sort
View
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
14 years 9 months ago
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
Mirit Shalem, Ziv Bar-Yossef
GIR
2006
ACM
14 years 1 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai
MICAI
2004
Springer
14 years 1 months ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
GIS
2004
ACM
14 years 8 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, ...
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
14 years 1 months ago
Optimizing Multiple Queries in Distributed Data Stream Systems
We consider the problem of query optimization in distributed stream based systems where multiple continuous queries may be executing simultaneously. In such systems, distribution ...
Sangeetha Seshadri, Vibhore Kumar, Brian F. Cooper