메뉴 건너뛰기




Volumn , Issue , 2003, Pages 778-789

Efficient approximation of optimization queries under parametric aggregation constraints

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; OPTIMIZATION; QUERY LANGUAGES;

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

References (18)
  • 1
    • 0040438358 scopus 로고    scopus 로고
    • A framework for expressing and combining preferences
    • June
    • R. Agrawal and E. Wimmers. A Framework For Expressing and Combining Preferences. Proceedings of ACM SIGMOD, pages 297-306, June 2000.
    • (2000) Proceedings of ACM SIGMOD , pp. 297-306
    • Agrawal, R.1    Wimmers, E.2
  • 2
    • 0036211203 scopus 로고    scopus 로고
    • Evaluating topk queries over web accessible databases
    • Apr.
    • N. Bruno, L. Gravano, and A. Marian. Evaluating Topk Queries Over Web Accessible Databases. Proceedings of ICDE, Apr. 2002.
    • (2002) Proceedings of ICDE
    • Bruno, N.1    Gravano, L.2    Marian, A.3
  • 8
    • 84948956707 scopus 로고    scopus 로고
    • Incorporating user preferences in multimedia queries
    • Jan.
    • R. Fagin and E. Wimmers. Incorporating User Preferences in Multimedia Queries. ICDT, pages 247-261, Jan. 1997.
    • (1997) ICDT , pp. 247-261
    • Fagin, R.1    Wimmers, E.2
  • 11
    • 4043126187 scopus 로고    scopus 로고
    • Foundations of preferences in database systems
    • Aug.
    • W. Kiebling. Foundations of Preferences in Database Systems. Proceedings of VLDB, Aug. 2002.
    • (2002) Proceedings of VLDB
    • Kiebling, W.1
  • 12
    • 52949104320 scopus 로고    scopus 로고
    • Preference SQL: Design, implementation, experiences
    • Aug.
    • W. Kiebling and G. Kostler. Preference SQL: Design, Implementation, Experiences. Proceedings of VLDB, Aug. 2002.
    • (2002) Proceedings of VLDB
    • Kiebling, W.1    Kostler, G.2
  • 14
    • 0034503926 scopus 로고    scopus 로고
    • On the approximability of trade-offs and optimal access to web sources
    • C. Papadimitriou and M. Yannakakis. On the approximability of trade-offs and optimal access to web sources. Proceedings of FOCS, 2000.
    • (2000) Proceedings of FOCS
    • Papadimitriou, C.1    Yannakakis, M.2
  • 16
    • 0000701345 scopus 로고    scopus 로고
    • Foundations of aggregation constraints
    • An early version appeared in Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming, 1994, LNCS 874
    • K. A. Ross, D. Srivastava, P. Stuckey, and S. Sudarshan. Foundations of aggregation constraints. Theoretical Computer Science, 193(1-2):149-179, 1998. An early version appeared in Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming, 1994, LNCS 874.
    • (1998) Theoretical Computer Science , vol.193 , Issue.1-2 , pp. 149-179
    • Ross, K.A.1    Srivastava, D.2    Stuckey, P.3    Sudarshan, S.4


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