A general approach to d-dimensional geometric queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Communications of the ACM
A randomized algorithm for closest-point queries
SIAM Journal on Computing
A predicate matching algorithm for database rule systems
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Reporting points in halfspaces
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Vector quantization and signal compression
Vector quantization and signal compression
Ray shooting and parametric search
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Point location in arrangements of hyperplanes
Information and Computation
An algorithm for approximate closest-point queries
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Accounting for boundary effects in nearest neighbor searching
Proceedings of the eleventh annual symposium on Computational geometry
Advances in knowledge discovery and data mining
Advances in knowledge discovery and data mining
Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software (TOMS)
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Continuous queries over data streams
ACM SIGMOD Record
Subject space: a state-persistent model for publish/subscribe systems
CASCON '02 Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research
Efficient matching for state-persistent publish/subscribe systems
CASCON '03 Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research
| Hi-index | 0.01 |
In a publish/subscribe paradigm, user service discovery requires matching user preferences to available published services, e.g., a user may want to find if there is a Chinese restaurant close by. This is a difficult problem when users are mobile, wirelessly connected to a network, and dynamically roaming in different environments. The magnitude of the problem increases with respect to the number of attributes for each users' preference criteria, as matches must be done in real-time. We present an algorithm that uses Singular Value Decomposition to encode each service properties in a few values. Users' preference criteria are matched by using the same encoding to produce a value that can be rapidly compared to those of the services. We show that reasonable matches can be found in time O(m log n) where n is the number of publications and m the number of attributes in the preference criteria (subscription). This is in contrast to 'approximate nearest neighbor' techniques, which require either time or storage exponential in m.