Sciweavers

9209 search results - page 1444 / 1842
» Data Space Randomization
Sort
View
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 6 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
OSDI
2008
ACM
16 years 6 months ago
Lightweight, High-Resolution Monitoring for Troubleshooting Production Systems
Production systems are commonly plagued by intermittent problems that are difficult to diagnose. This paper describes a new diagnostic tool, called Chopstix, that continuously col...
Sapan Bhatia, Abhishek Kumar, Marc E. Fiuczynski, ...
VLDB
2001
ACM
107views Database» more  VLDB 2001»
16 years 6 months ago
A survey of approaches to automatic schema matching
Schema matching is a basic problem in many database application domains, such as data integration, Ebusiness, data warehousing, and semantic query processing. In current implementa...
Erhard Rahm, Philip A. Bernstein
VLDB
2004
ACM
119views Database» more  VLDB 2004»
16 years 6 months ago
Evaluating holistic aggregators efficiently for very large datasets
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
Lixin Fu, Sanguthevar Rajasekaran
VLDB
2007
ACM
145views Database» more  VLDB 2007»
16 years 6 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
« Prev « First page 1444 / 1842 Last » Next »