Sciweavers

96 search results - page 7 / 20
» On Implicate Discovery and Query Optimization
Sort
View
ICC
2009
IEEE
150views Communications» more  ICC 2009»
13 years 6 months ago
Efficient Resource Discovery in Mobile Ad Hoc Networks
Abstract--The highly dynamic nature of infrastructureless adhoc networks poses new challenges during resource discovery. In this paper, we propose a novel algorithm for resource di...
Ravi Thanawala, Jie Wu, Avinash Srinivasan
CINQ
2004
Springer
163views Database» more  CINQ 2004»
14 years 2 months ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau
KDD
1995
ACM
140views Data Mining» more  KDD 1995»
14 years 5 days ago
Discovery and Maintenance of Functional Dependencies by Independencies
For semantic query optimization one needs detailed knowledgeabout the contents of the database. Traditional techniquesuse static knowledgeabout all possible states of the database...
Siegfried Bell
ICDE
2010
IEEE
177views Database» more  ICDE 2010»
14 years 3 months ago
Optimal load shedding with aggregates and mining queries
— To cope with bursty arrivals of high-volume data, a DSMS has to shed load while minimizing the degradation of Quality of Service (QoS). In this paper, we show that this problem...
Barzan Mozafari, Carlo Zaniolo
AI
2010
Springer
13 years 8 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim