Sciweavers

1778 search results - page 289 / 356
» The Theory of Probabilistic Databases
Sort
View
PODS
2011
ACM
238views Database» more  PODS 2011»
14 years 25 days ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi
KDD
2007
ACM
141views Data Mining» more  KDD 2007»
15 years 10 months ago
Detecting anomalous records in categorical datasets
We consider the problem of detecting anomalies in high arity categorical datasets. In most applications, anomalies are defined as data points that are 'abnormal'. Quite ...
Kaustav Das, Jeff G. Schneider
VLDB
2003
ACM
165views Database» more  VLDB 2003»
15 years 10 months ago
Learning to match ontologies on the Semantic Web
On the Semantic Web, data will inevitably come from many different ontologies, and information processing across ontologies is not possible without knowing the semantic mappings be...
AnHai Doan, Jayant Madhavan, Robin Dhamankar, Pedr...
VLDB
2004
ACM
112views Database» more  VLDB 2004»
15 years 10 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
SIGMOD
2008
ACM
206views Database» more  SIGMOD 2008»
15 years 10 months ago
Ad-hoc aggregations of ranked lists in the presence of hierarchies
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...
Nilesh Bansal, Sudipto Guha, Nick Koudas