Sciweavers

785 search results - page 111 / 157
» Efficient Processing of Top-k Queries in Uncertain Databases
Sort
View
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
16 years 6 months ago
Efficient xml data dissemination with piggybacking
Content-based dissemination of XML data using the publishsubscribe paradigm is an effective means to deliver relevant data to interested data consumers. To meet the performance ch...
Chee Yong Chan, Yuan Ni
PODS
2005
ACM
131views Database» more  PODS 2005»
16 years 6 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
WWW
2004
ACM
16 years 6 months ago
Affinity rank: a new scheme for efficient web search
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative...
Yi Liu, Benyu Zhang, Zheng Chen, Michael R. Lyu, W...
ICDE
2009
IEEE
169views Database» more  ICDE 2009»
16 years 7 months ago
Visible Reverse k-Nearest Neighbor Queries
Reverse nearest neighbor (RNN) queries have a broad application base such as decision support, profile-based marketing, resource allocation, data mining, etc. Previous work on RNN ...
Yunjun Gao, Baihua Zheng, Gencai Chen, Wang-Chien ...
ICDE
2006
IEEE
232views Database» more  ICDE 2006»
16 years 7 months ago
Dual Labeling: Answering Graph Reachability Queries in Constant Time
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
Haixun Wang, Hao He, Jeffrey Xu Yu, Jun Yang 0001,...