Sciweavers

720 search results - page 81 / 144
» Gossiping personalized queries
Sort
View
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
16 years 2 days ago
Asynchronous view maintenance for VLSD databases
The query models of the recent generation of very large scale distributed (VLSD) shared-nothing data storage systems, including our own PNUTS and others (e.g. BigTable, Dynamo, Ca...
Parag Agrawal, Adam Silberstein, Brian F. Cooper, ...
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 2 days ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
16 years 2 days ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
188
Voted
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
16 years 17 hour ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...
EDBT
2010
ACM
135views Database» more  EDBT 2010»
15 years 6 months ago
Region-based online promotion analysis
This paper addresses a fundamental and challenging problem with broad applications: efficient processing of region-based promotion queries, i.e., to discover the top-k most inter...
Tianyi Wu, Yizhou Sun, Cuiping Li, Jiawei Han