Sciweavers

235 search results - page 24 / 47
» Evaluating Query Result Significance in Databases via Random...
Sort
View
VLDB
2004
ACM
119views Database» more  VLDB 2004»
15 years 12 months ago
Evaluating holistic aggregators efficiently for very large datasets
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
Lixin Fu, Sanguthevar Rajasekaran
WWW
2005
ACM
16 years 12 days ago
Adaptive query routing in peer web search
An unstructured peer network application was proposed to address the query forwarding problem of distributed search engines and scalability limitations of centralized search engin...
Le-Shin Wu, Ruj Akavipat, Filippo Menczer
DLOG
2011
14 years 3 months ago
Reasoning in Resource-Constrained Environments: a Matchmaking Engine over Relational Knowledge Bases
We present a framework for logic-based matchmaking on ALN ABoxes stored in a relational database. The proposed approach allows both non-standard reasoning and subsumption check be ...
Eufemia Tinelli, Francesco M. Donini, Michele Ruta...
LWA
2004
15 years 1 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
PODS
2007
ACM
151views Database» more  PODS 2007»
15 years 12 months ago
Optimization of continuous queries with shared expensive filters
We consider the problem of optimizing and executing multiple continuous queries, where each query is a conjunction of filters and each filter may occur in multiple queries. When f...
Kamesh Munagala, Utkarsh Srivastava, Jennifer Wido...