Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2007-02-27
2007-02-27
Pham, Khanh B. (Department: 2168)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
10775056
ABSTRACT:
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.
REFERENCES:
patent: 6871201 (2005-03-01), Yu et al.
patent: 2003/0061213 (2003-03-01), Yu et al.
patent: 2004/0002973 (2004-01-01), Chaudhuri et al.
Nicolas Bruno, Surajit Chaudhuri, Lusi Gravano, Top-K Selection Queries Over Relational Database: Mapping Strategies and Performance Evalution, Jun. 2, 2002, vol. 27, pp. 153-187.
Nicolas Bruno, Surajit Chaudhuri, Luis Gravano, Performance of Multiattribute Top-K Queries on Relational Systems, 2000.
Kotidis Ioannis
Koudas Nikolaos
Palpanas Themistoklis
Srivastava Divesh
Tsaparas Panayiotis
AT&T Corp.
Oni Olubnusola
Pham Khanh B.
LandOfFree
Method and apparatus for ranked join indices does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for ranked join indices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for ranked join indices will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3876303