메뉴 건너뛰기




Volumn 3, Issue , 2005, Pages 1342-1345

RankSQL: Supporting ranking queries in relational database management systems

Author keywords

[No Author keywords available]

Indexed keywords


EID: 33745620791     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (20)

References (3)
  • 1
    • 0036372482 scopus 로고    scopus 로고
    • Minimal probing: Supporting expensive predicates for top-k queries
    • K. C.-C. Chang and S. Hwang. Minimal probing: Supporting expensive predicates for top-k queries. In SIGMOD, pages 346-357, 2002.
    • (2002) SIGMOD , pp. 346-357
    • Chang, K.C.-C.1    Hwang, S.2
  • 2
    • 85012120419 scopus 로고    scopus 로고
    • Supporting top-k join quereis in relational databases
    • I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting top-k join quereis in relational databases. In VLDB, pages 754-765, 2003.
    • (2003) VLDB , pp. 754-765
    • Ilyas, I.F.1    Aref, W.G.2    Elmagarmid, A.K.3
  • 3
    • 29844457931 scopus 로고    scopus 로고
    • RankSQL: Query algebra and optimization for relational top-k queries
    • C. Li, K. C.-C. Chang, I. F. Ilyas, and S. Song. RankSQL: Query algebra and optimization for relational top-k queries. In SIGMOD, pages 131-142, 2005.
    • (2005) SIGMOD , pp. 131-142
    • Li, C.1    Chang, K.C.-C.2    Ilyas, I.F.3    Song, S.4


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