Sciweavers

Share
78 search results - page 1 / 16
» Finding Top-k Approximate Answers to Path Queries
Sort
View
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
9 years 5 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
8 years 8 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
DAWAK
2007
Springer
8 years 10 months ago
Mining Top-K Multidimensional Gradients
Several business applications such as marketing basket analysis, clickstream analysis, fraud detection and churning migration analysis demand gradient data analysis. By employing g...
Ronnie Alves, Orlando Belo, Joel Ribeiro
FQAS
2009
Springer
127views Database» more  FQAS 2009»
8 years 11 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of ļ¬nding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
ICDE
2007
IEEE
137views Database» more  ICDE 2007»
9 years 5 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
books