Highly Scalable Multiprocessing Algorithms for Preference-Based Database Retrieval
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 246-260
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Spending Moore's dividendCommunications of the ACM, 2009
- Efficient sort-based skyline evaluationACM Transactions on Database Systems, 2008
- Algorithms and Data Structures for External MemoryFoundations and Trends® in Theoretical Computer Science, 2008
- Pictures from Mongolia. Extracting the Top Elements from a Partially Ordered SetTheory of Computing Systems, 2008
- Algorithms and analyses for maximal vector computationThe VLDB Journal, 2006
- Progressive skyline computation in database systemsACM Transactions on Database Systems, 2005
- Preference formulas in relational queriesACM Transactions on Database Systems, 2003
- Indexing for progressive skyline computationData & Knowledge Engineering, 2003
- The Skyline operator2002
- Fast linear expected-time algorithms for computing maxima and convex hullsAlgorithmica, 1993