메뉴 건너뛰기




Volumn , Issue , 2009, Pages 415-428

Robust and efficient algorithms for rank join evaluation

Author keywords

Adaptive pulling; Feasible region bound; Rank join; Ranking queries

Indexed keywords

COMPUTATIONAL COSTS; COMPUTATIONALLY EFFICIENT; EFFICIENT ALGORITHM; EMPIRICAL STUDIES; EXPERIMENTAL STUDIES; FEASIBLE REGIONS; JOIN OPERATORS; OPTIMALITY; ORDER OF MAGNITUDE; PERFORMANCE IMPROVEMENTS; RANKING QUERIES; SQL QUERY; THEORETICAL STUDY;

EID: 70849123514     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559890     Document Type: Conference Paper
Times cited : (47)

References (15)
  • 5
    • 70849105269 scopus 로고    scopus 로고
    • Robust and efficient algorithms for rank join evaluation
    • University of California Santa Cruz
    • J. Finger and N. Polyzotis. Robust and efficient algorithms for rank join evaluation. Technical Report UCSC-SOE-09-01, University of California Santa Cruz, 2009.
    • (2009) Technical Report UCSC-SOE-09-01
    • Finger, J.1    Polyzotis, N.2
  • 6
    • 0027608375 scopus 로고
    • Query evaluation techniques for large databases
    • G. Graefe. Query evaluation techniques for large databases. ACM Comput. Surv., 25(2):73-169, 1993.
    • (1993) ACM Comput. Surv. , vol.25 , Issue.2 , pp. 73-169
    • Graefe, G.1
  • 14
    • 85011048571 scopus 로고    scopus 로고
    • Depth estimation for ranking query optimization
    • K. Schnaitter, J. Spiegel, and N. Polyzotis. Depth estimation for ranking query optimization. In Proceedings of the 33rd International Conference on Very Large Databases, pages 902-913, 2007.
    • (2007) In , pp. 902-913
    • Schnaitter, K.1    Spiegel, J.2    Polyzotis, N.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.