Sciweavers

552 search results - page 68 / 111
» Efficient Algorithms for Processing XPath Queries
Sort
View
PVLDB
2010
139views more  PVLDB 2010»
14 years 6 months ago
Identifying the Most Influential Data Objects with Reverse Top-k Queries
Top-k queries are widely applied for retrieving a ranked set of the k most interesting objects based on the individual user preferences. As an example, in online marketplaces, cus...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
15 years 12 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
WWW
2008
ACM
16 years 15 days ago
Supporting anonymous location queries in mobile environments with privacygrid
This paper presents PrivacyGrid - a framework for supporting anonymous location-based queries in mobile information delivery systems. The PrivacyGrid framework offers three unique...
Bhuvan Bamba, Ling Liu, Péter Pesti, Ting W...
GIS
2008
ACM
16 years 27 days ago
The multi-rule partial sequenced route query
Trip planning search (TPS) represents an important class of queries in Geographic Information Systems (GIS). In many real-world applications, TPS requests are issued with a number...
Haiquan Chen, Wei-Shinn Ku, Min-Te Sun, Roger Zimm...
KDD
1998
ACM
99views Data Mining» more  KDD 1998»
15 years 4 months ago
On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases
For a wide variety of classification algorithms, scalability to large databases can be achieved by observing that most algorithms are driven by a set of sufficient statistics that...
Goetz Graefe, Usama M. Fayyad, Surajit Chaudhuri