137 search results - page 26 / 28 » Efficient Processing of Top-k Spatial Preference Queries |
KES
2008
Springer
13 years 6 months ago
2008
Springer
Users prefer to navigate subjects from organized topics in an abundance resources than to list pages retrieved from search engines. We propose a framework to cluster frequent items...
DASFAA
2004
IEEE
13 years 10 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
COMAD
2008
13 years 7 months ago
2008
In existing database systems there is a strong need for searching data according to many attributes. In commercial database platforms, the standard search over multiple attributes...
ICIP
2004
IEEE
14 years 8 months ago
2004
IEEE
In many image or video retrieval systems, the search of similar objects in the database includes a spatial access method to a multidimensional feature space. This step is generall...
SIGMOD
2009
ACM
14 years 6 months ago
2009
ACM
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...