Sciweavers

2498 search results - page 63 / 500
» Data Structures with Unpredictable Timing
Sort
View
EDBT
2004
ACM
313views Database» more  EDBT 2004»
15 years 10 months ago
XQzip: Querying Compressed XML Using Structural Indexing
XML makes data flexible in representation and easily portable on the Web but it also substantially inflates data size as a consequence of using tags to describe data. Although many...
James Cheng, Wilfred Ng
FOCS
2005
IEEE
15 years 3 months 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
ESOP
2000
Springer
15 years 1 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
INFFUS
2008
175views more  INFFUS 2008»
14 years 9 months ago
Adaptive optimization of join trees for multi-join queries over sensor streams
Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sour...
Joseph S. Gomes, Hyeong-Ah Choi
RCC
2000
113views more  RCC 2000»
14 years 9 months ago
The Aristotle Approach to Open Hypermedia
Large-scale distributed hypermedia systems comprise a generation of powerful tools to meet the demands of the new information globalization era. The most promising of such systems...
Costas Petrou, Drakoulis Martakos, Michael Hatzopo...