Sciweavers

11212 search results - page 529 / 2243
» Semi-persistent Data Structures
Sort
View
SPIRE
2009
Springer
16 years 1 months ago
Directly Addressable Variable-Length Codes
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sam...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
FOCS
2005
IEEE
16 years 17 days ago
Linear Lower Bounds on Real-World Implementations of Concurrent Objects
This paper proves   ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
Faith Ellen Fich, Danny Hendler, Nir Shavit
WISE
2002
Springer
15 years 12 months ago
Discovering Associations in XML Data
—Knowledge inference from semi-structured data can utilize frequent sub structures, in addition to frequency of data items. In fact, the working assumption of the present study i...
Amnon Meisels, Michael Orlov, Tal Maor
TOOLS
2000
IEEE
15 years 11 months ago
Spatiotemporal Data Modeling and Management: A Survey
Many data objects in the real world have attributes about location and time. Such spatiotemporal objects can be found in applications such Geographic Information Systems (GIS), env...
Xiaoyu Wang, Xiaofang Zhou, Sanglu Lu
WWW
2006
ACM
16 years 7 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee