On the average number of maxima in a set of vectors
Information Processing Letters
Distribution issues in the design and implementation of a virtual market place
Computer Networks: The International Journal of Computer and Telecommunications Networking - electronic commerce
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Proceedings of the 17th International Conference on Data Engineering
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
Querying high-dimensional data in single-dimensional space
The VLDB Journal — The International Journal on Very Large Data Bases
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Maximal vector computation in large data sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Efficient computation of the skyline cube
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Catching the best views of skyline: a semantic approach based on decisive subspaces
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Discovering strong skyline points in high dimensional spaces
Proceedings of the 14th ACM international conference on Information and knowledge management
Finding k-dominant skylines in high dimensional space
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Towards multidimensional subspace skyline analysis
ACM Transactions on Database Systems (TODS)
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient skyline computation over low-cardinality domains
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient sort-based skyline evaluation
ACM Transactions on Database Systems (TODS)
Optimal Preference Elicitation for Skyline Queries over Categorical Domains
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
A Skyline Approach to the Matchmaking Web Service
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Skyline queries based on user locations and preferences for making location-based recommendations
Proceedings of the 2009 International Workshop on Location Based Social Networks
Efficient computation of trade-off skylines
Proceedings of the 13th International Conference on Extending Database Technology
A fast and progressive algorithm for skyline queries with totally- and partially-ordered domains
Journal of Systems and Software
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Exploiting preference queries for searching learning resources
EC-TEL'07 Proceedings of the Second European conference on Technology Enhanced Learning: creating new learning experiences on a global scale
Hi-index | 0.00 |
In this article, we present a skyline-based matchmaking framework. The current method of carrying out the matchmaking procedure identifies items based on users' specifications. We rethink matchmaking procedures in such a way that they can find items that can satisfy a specific computing demand from a user and recommend a collection of better candidates among the identified items. This endows a user with the right of choice on deciding the best-possible items. We approach the recommendation from the perspective of skyline computation and present an efficient skyline algorithm that gathers interesting item candidates efficiently. To devise an efficient sequential skyline algorithm, we adopt (i) lattice-based indexing using a lattice composition technique and (ii) an optimized dominance-check algorithm. Moreover, we parallelize the algorithm using breadth-first-search (BFS). Our extensive experimental results show that our algorithm outperforms current state-of-the-art algorithms, and the speedup factor of the parallelized algorithm is near-linear.