Sciweavers

751 search results - page 95 / 151
» A Dialogue Manager for Accessing Databases
Sort
View
GIS
2009
ACM
14 years 9 months ago
PROS: A Peer-to-Peer System for Location Privacy Protection on Road Networks
The k-anonymity technique is widely used to provide location privacy protection for accessing location-based services (LBS), i.e., the exact location of a query initiator is cloak...
Jie Bao 0003, Haiquan Chen, Wei-Shinn Ku
VLDB
2001
ACM
157views Database» more  VLDB 2001»
14 years 8 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 8 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 8 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
14 years 8 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner