Sciweavers

165 search results - page 21 / 33
» Auditing Sum Queries
Sort
View
AI
2010
Springer
13 years 7 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
CIKM
2007
Springer
14 years 1 months ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
ICDE
2007
IEEE
137views Database» more  ICDE 2007»
14 years 8 months ago
SAO: A Stream Index for Answering Linear Optimization Queries
Linear optimization queries retrieve the top-K tuples in a sliding window of a data stream that maximize/minimize the linearly weighted sums of certain attribute values. To effici...
Gang Luo, Kun-Lung Wu, Philip S. Yu
ICDT
2010
ACM
219views Database» more  ICDT 2010»
14 years 4 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...
AAAI
2007
13 years 9 months ago
From Whence Does Your Authority Come? Utilizing Community Relevance in Ranking
A web page may be relevant to multiple topics; even when nominally on a single topic, the page may attract attention (and thus links) from multiple communities. Instead of indiscr...
Lan Nie, Brian D. Davison, Baoning Wu