Sciweavers

958 search results - page 38 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
209
Voted
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
16 years 1 months ago
XML Prefiltering as a String Matching Problem
We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient keyword sear...
Christoph Koch, Stefanie Scherzinger, Michael Schm...
73
Voted
IJCAI
1997
15 years 1 months ago
On the Efficient Classification of Data Structures by Neural Networks
Marco Gori Dipartimento di Ingegneria deU'Informazione Universita di Siena Via Roma 56 53100 Siena, Italy Alessandro Sperduti Dipartimento di Informatica Universita di Pisa C...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
145
Voted
SEBD
2003
159views Database» more  SEBD 2003»
15 years 1 months ago
Spatial Tree Logics to reason about Semistructured Data
The Ambient Logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computations. The static part of the Ambient Logic is,...
Giovanni Conforti, Giorgio Ghelli
107
Voted
CCCG
2010
15 years 1 months ago
Towards a dynamic data structure for efficient bounded line range search
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
Thuy Le, Bradford G. Nickerson
117
Voted
FAW
2008
Springer
225views Algorithms» more  FAW 2008»
15 years 2 months ago
Versioning Tree Structures by Path-Merging
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
Khaireel A. Mohamed, Tobias Langner, Thomas Ottman...