메뉴 건너뛰기




Volumn WS-08-09, Issue , 2008, Pages 31-36

Optimization of preference queries under hard sum constraints

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC OPTIMIZATION; DATABASE ENGINE; DATABASE QUERIES; HANDLING TECHNIQUE; HARD CONSTRAINTS; MULTIPLE ATTRIBUTES; PERSONALIZATION; PLANNING TASKS; PREFERENCE QUERIES; PREFERENCE-BASED SEARCH; SOFT CONSTRAINT; TRANSFORMATION LAW;

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

References (14)
  • 3
    • 3142632034 scopus 로고    scopus 로고
    • Preference Formulas in Relational Queries
    • ACM Press
    • Chomicki, J. 2003. Preference Formulas in Relational Queries. In ACM Transactions on Database Systems (TODS), volume 28, 427-466. ACM Press.
    • (2003) ACM Transactions on Database Systems (TODS) , vol.28 , pp. 427-466
    • Chomicki, J.1
  • 12
    • 38049032411 scopus 로고    scopus 로고
    • Efficient Processing of Relational Queries with Sum Constraints
    • Nestorov, S.; Liu, C.; and Foster, I. T. 2007. Efficient Processing of Relational Queries with Sum Constraints. In APWeb/WAIM, 440-451.
    • (2007) APWeb/WAIM , pp. 440-451
    • Nestorov, S.1    Liu, C.2    Foster, I.T.3


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