Sciweavers

332 search results - page 10 / 67
» Space Complexity vs. Query Complexity
Sort
View
DBA
2004
111views Database» more  DBA 2004»
13 years 11 months ago
Effective Decompositioning of Complex Spatial Objects into Intervals
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
JAPLL
2010
133views more  JAPLL 2010»
13 years 8 months ago
Complexity of modal logics with Presburger constraints
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
Stéphane Demri, Denis Lugiez
COCO
2010
Springer
152views Algorithms» more  COCO 2010»
14 years 1 months ago
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Derrick Stolee, Chris Bourke, N. V. Vinodchandran
EDBTW
2004
Springer
14 years 3 months ago
FliX: A Flexible Framework for Indexing Complex XML Document Collections
While there are many proposals for path indexes on XML documents, none of them is perfectly suited for indexing large-scale collections of interlinked XML documents. Existing strat...
Ralf Schenkel
EDBT
2004
ACM
133views Database» more  EDBT 2004»
14 years 10 months ago
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
Ralf Schenkel, Anja Theobald, Gerhard Weikum