Method and apparatus for ranked join indices
View Patent ↗A method and apparatus for ranked join indices includes a solution providing performance guarantees for top-k join queries over two relations, when preprocessing to construct a ranked join index for a specific join condition is permitted. The concepts of ranking join indices presented herein are also applicable in the case of a single relation. In this case, the concepts herein provide a solution to the top-k selection problem with monotone linear functions, having guaranteed worst case search performance for the case of two ranked attributes and arbitrary preference vectors.
1. A method of creating a ranked join index for ordered data entries, comprising:
mapping a dominating set of the ordered data entries according to rank attributes;
determining a separating vector for each set of adjacent mapped data entries of the dominating set of ordered data entries; and
ordering the ordered data entries according to a separating point associated with each of the separating vectors, wherein the ordering is performed by a processor.
2. The method of claim 1 , wherein the ordering the ordered data entries, comprises:
sweeping a vector across a plane of the adjacent mapped data entries, wherein each time the vector crosses a separating vector, a current composition of highest ranked data entries changes by swapping a data entry in a respective set of the adjacent mapped data entries if it causes a change in the index; and
wherein each time a data entry in a respective set of adjacent mapped data entries is swapped, the highest ranked data entries are materialized and a new index entry is initiated.
3. The method of claim 1 , wherein the ordering is query independent such that any user preference query is resolved using the index.
4. The method of claim 1 , wherein each set of adjacent mapped data entries comprises more than two mapped data entries of the ordered data entries if the more than two data entries are collinear.
5. The method of claim 1 , further comprising:
providing a performance guarantee for an amount of time the index requires for resolving user queries.
6. The method of claim 1 , further comprising merging ordered data entries.
7. The method of claim 6 , wherein said merging results in a storage space requirement for said index that is characterized according to an equation:
O(nK 2 (K+m)/m)
wherein n represents a total number of data entries to be indexed, K represents an upper bound on a number of high ranking data entries that is requested by a user, and m represents a total number of data entries to be merged.
8. The method of claim 6 , wherein the merging results in a query time for the index that is characterized according to an equation:
O(log(nK 2 /m)+(K+m)log(K+m))
wherein n represents a total number of data entries to be indexed, K represents an upper bound on a number of high ranking data entries that is requested by a user, and m represents a total number of data entries to be merged.
9. The method of claim 6 , wherein the merging the ordered data entries provides a space and time tradeoff.
10. The method of claim 9 , wherein the space and time tradeoff comprises reducing a query time of the index by increasing a storage space of the index.
11. The method of claim 9 , wherein the space and time tradeoff comprises reducing a storage space required by the index by increasing a query time of the index.
12. A method of providing solutions to top-k join queries of ranked data entries for user specified preferences, comprising:
mapping a dominating set of the ranked data entries according to rank attributes;
creating a ranked join index for the ranked data entries by determining a separating vector for each set of adjacent mapped data entries of the dominating set of ranked data entries;
ordering the ranked data entries according to a separating point associated with each of the separating vectors, wherein the ordering is performed by a processor; and
providing a solution for a user preference query using the ranked join index.
13. A non-transitory computer-readable medium storing a set of instructions, which when executed by a processor, perform a method of creating a ranked join index for ordered data entries, comprising:
mapping a dominating set of the ordered data entries according to rank attributes;
determining a separating vector for each set of adjacent mapped data entries of the dominating set of ordered data entries; and
ordering the ordered data entries according to a separating point associated with each of the separating vectors.
14. The non-transitory computer-readable medium of claim 13 , wherein the ordering the ordered data entries, comprises:
sweeping a vector across a plane of the adjacent mapped data entries, wherein each time the vector crosses a separating vector, a current composition of highest ranked data entries changes by swapping a data entry in a respective set of the adjacent mapped data entries if it causes a change in the index; and
wherein each time a data entry in a respective set of adjacent mapped data entries is swapped, the highest ranked data entries are materialized and a new index entry is initiated.
15. The non-transitory computer-readable medium of claim 13 , wherein the ordering is query independent such that any user preference query is resolved using the index.
16. The non-transitory computer-readable medium of claim 13 , wherein each set of adjacent mapped data entries comprises more than two mapped data entries of the ordered data entries if the more than two data entries are collinear.
17. The non-transitory computer-readable medium of claim 13 , wherein performance guarantees are provided for an amount of time the index requires for resolving user queries.
18. The non-transitory computer-readable medium of claim 13 , further comprising merging ordered data entries.
19. The non-transitory computer-readable medium of claim 18 , wherein the merging results in a storage space requirement for the index that is characterized according to an equation:
O(nK 2 (K+m)/m)
wherein n represents a total number of data entries to be indexed, K represents an upper bound on a number of high ranking data entries that is requested by a user, and m represents a total number of data entries to be merged.
20. The non-transitory computer-readable medium of claim 18 , wherein the merging results in a query time for the index that is characterized according to an equation:
O(log(nK 2 /m)+(K+m)log(K+m))
wherein n represents a total number of data entries to be indexed, K represents an upper bound on a number of high ranking data entries that is requested by a user, and m represents a total number of data entries to be merged.