16843 search results - page 3101 / 3369 » On Generalized Authorization Problems |
302
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
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...
280
click to vote
SIGMOD
2009
ACM
16 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...
285
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
251
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
291
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Ontology matching, aiming to obtain semantic correspondences between two ontologies, has played a key role in data exchange, data integration and metadata management. Among numero...