Sciweavers

56 search results - page 6 / 12
» Dynamic Structures for Top- k Queries on Uncertain Data
Sort
View
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
15 years 9 months ago
FleXPath: Flexible Structure and Full-Text Querying for XML
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank ...
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
15 years 3 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
CORR
2010
Springer
151views Education» more  CORR 2010»
14 years 8 months ago
Dynamic Range Reporting in External Memory
In this paper we describe a dynamic external memory data structure that supports range reporting queries in three dimensions in O(log2 B N + k B ) I/O operations, where k is the nu...
Yakov Nekrich
IPL
2007
101views more  IPL 2007»
14 years 9 months ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
14 years 11 months ago
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
Guy E. Blelloch