Sciweavers

962 search results - page 148 / 193
» Efficient Algorithms for Eulerian Extension
Sort
View
SIGMOD
2007
ACM
112views Database» more  SIGMOD 2007»
15 years 10 months ago
A random walk approach to sampling hidden databases
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden backend database to provide answers to user queries. ...
Arjun Dasgupta, Gautam Das, Heikki Mannila
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
15 years 10 months ago
Graph-based synopses for relational selectivity estimation
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
Joshua Spiegel, Neoklis Polyzotis
SIGMOD
2005
ACM
74views Database» more  SIGMOD 2005»
15 years 10 months ago
Online B-tree Merging
Many scenarios involve merging of two B-tree indexes, both covering the same key range. Increasing demand for continuous availability and high performance requires that such mergi...
Xiaowei Sun, Rui Wang 0002, Betty Salzberg, Chendo...
PODS
2005
ACM
124views Database» more  PODS 2005»
15 years 10 months ago
Diagnosis of asynchronous discrete event systems: datalog to the rescue!
We consider query optimization techniques for data intensive P2P applications. We show how to adapt an old technique from deductive databases, namely Query-Sub-Query (QSQ), to a s...
Serge Abiteboul, Stefan Haar, Tova Milo, Zoë ...
ICSE
2004
IEEE-ACM
15 years 9 months ago
A Hybrid Architectural Style for Distributed Parallel Processing of Generic Data Streams
Immersive, interactive applications grouped under the concept of Immersipresence require on-line processing and mixing of multimedia data streams and structures. One critical issu...
Alexandre R. J. François