Sciweavers

685 search results - page 38 / 137
» Efficient Filtering Query Indexing in Data Stream
Sort
View
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 10 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
EDBT
2010
ACM
206views Database» more  EDBT 2010»
14 years 3 months ago
Efficient computation of trade-off skylines
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval p...
Christoph Lofi, Ulrich Güntzer, Wolf-Tilo Bal...
DEXA
2009
Springer
222views Database» more  DEXA 2009»
14 years 3 months ago
On Index-Free Similarity Search in Metric Spaces
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
Tomás Skopal, Benjamin Bustos
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
14 years 9 months ago
B-tree indexes for high update rates
ct In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering usi...
Goetz Graefe
DEBS
2008
ACM
13 years 10 months ago
Real-time, load-adaptive processing of continuous queries over data streams
We introduce a new type of query, called a real-time continuous query (RCQ), that captures the real-time requirements of processing data streams. We develop techniques to efficien...
Dhananjay Kulkarni, Chinya V. Ravishankar, Mitch C...