Sciweavers

16596 search results - page 3043 / 3320
» Generalized Assignment Problems
Sort
View
SIGMOD
2009
ACM
132views Database» more  SIGMOD 2009»
16 years 6 months ago
Core schema mappings
Research has investigated mappings among data sources under two perspectives. On one side, there are studies of practical tools for schema mapping generation; these focus on algor...
Giansalvatore Mecca, Paolo Papotti, Salvatore Raun...
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 6 months 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 6 months 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...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 6 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
16 years 6 months ago
3-HOP: a high-compression indexing scheme for reachability query
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...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
« Prev « First page 3043 / 3320 Last » Next »