Sciweavers

171 search results - page 18 / 35
» Finger trees: a simple general-purpose data structure
Sort
View
ICDE
2006
IEEE
167views Database» more  ICDE 2006»
14 years 9 months ago
Better Burst Detection
A burst is a large number of events occurring within a certain time window. As an unusual activity, it's a noteworthy phenomenon in many natural and social processes. Many da...
Xin Zhang, Dennis Shasha
MOBIQUITOUS
2008
IEEE
14 years 2 months ago
How to edit gigabyte XML files on a mobile phone with XAS, RefTrees, and RAXS
The Open Source mobility middleware developed in the Fuego Core project provides a stack for efficient XML processing on limited devices. Its components are a persistent map API, ...
Tancred Lindholm, Jaakko Kangasharju
EDBT
2000
ACM
13 years 12 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
PPOPP
2010
ACM
14 years 4 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
13 years 8 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers