Sciweavers

186 search results - page 32 / 38
» A Practical Approach to Hypothetical Database Queries
Sort
View
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
15 years 7 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...
ASWC
2008
Springer
15 years 2 months ago
Scalable Distributed Ontology Reasoning Using DHT-Based Partitioning
Abstract. Ontology reasoning is an indispensable step to fully exploit the implicit semantics of Semantic Web data. The inherent distribution characteristic of the Semantic Web and...
Qiming Fang, Ying Zhao, Guangwen Yang, Weimin Zhen...
SIGMOD
2012
ACM
210views Database» more  SIGMOD 2012»
13 years 2 months ago
Interactive regret minimization
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, K...
ICDE
2009
IEEE
179views Database» more  ICDE 2009»
15 years 7 months ago
Self-Tuning, Bandwidth-Aware Monitoring for Dynamic Data Streams
— We present SMART, a self-tuning, bandwidth-aware monitoring system that maximizes result precision of continuous aggregate queries over dynamic data streams. While prior approa...
Navendu Jain, Praveen Yalagandula, Michael Dahlin,...
SIGMOD
2001
ACM
104views Database» more  SIGMOD 2001»
16 years 15 days ago
Independence is Good: Dependency-Based Histogram Synopses for High-Dimensional Data
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical ...
Amol Deshpande, Minos N. Garofalakis, Rajeev Rasto...