Sciweavers

705 search results - page 25 / 141
» Approximating Extended Answer Sets
Sort
View
ESA
2004
Springer
98views Algorithms» more  ESA 2004»
15 years 3 months ago
Competitive Online Approximation of the Optimal Search Ratio
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elm...
AMW
2009
14 years 10 months ago
Consistent Query Answering in Data Warehouses
Abstract. A Data Warehouse (DW) is a data repository that organizes and physically integrates data from multiple sources under special kinds of schemas. A DW is composed by a set o...
Leopoldo E. Bertossi, Loreto Bravo, Mónica ...
90
Voted
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 3 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
169
Voted
ICDE
2003
IEEE
160views Database» more  ICDE 2003»
15 years 11 months ago
SWAT: Hierarchical Stream Summarization in Large Networks
The problem of statistics and aggregate maintenance over data streams has gained popularity in recent years especially in telecommunications network monitoring, trend-related anal...
Ahmet Bulut, Ambuj K. Singh
67
Voted
ICDE
2008
IEEE
106views Database» more  ICDE 2008»
15 years 4 months ago
Weighted Boolean conditions for ranking
— Current database systems are tailored to efficiently evaluate Boolean expressions which are typically used as selection conditions to restrict the result set. We propose to ad...
Matthias Beck, Burkhard Freitag