메뉴 건너뛰기




Volumn 2005-January, Issue January, 2005, Pages 210-220

Efficient relational joins with arithmetic constraints on multiple attributes

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

EID: 66149181017     PISSN: 10988068     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IDEAS.2005.24     Document Type: Conference Paper
Times cited : (6)

References (24)
  • 1
    • 0031645633 scopus 로고    scopus 로고
    • Efficient searching with linear constraints
    • ACM press, Seatle, Washington, United States
    • Agarwal, P.K., Arge, L., Erickson, J., Franciosa, P.G. and Vitter, J.S., Efficient searching with linear constraints. PODS, ACM press, Seatle, Washington, United States, 1998.
    • (1998) PODS
    • Agarwal, P.K.1    Arge, L.2    Erickson, J.3    Franciosa, P.G.4    Vitter, J.S.5
  • 3
    • 0039253775 scopus 로고    scopus 로고
    • Eddies: Continuously adaptive query processing
    • Dallas, TX, USA
    • Avnur, R. and Hellerstein, J.M., Eddies: continuously adaptive query processing. SIGMOD, Dallas, TX, USA, 2000, pp. 261-272.
    • (2000) SIGMOD , pp. 261-272
    • Avnur, R.1    Hellerstein, J.M.2
  • 8
    • 0019339562 scopus 로고
    • Knowledge based query processing
    • Hammer, M. and Zdonik, S.B., Knowledge based query processing. VLDB, 1980, pp. 137-147.
    • (1980) VLDB , pp. 137-147
    • Hammer, M.1    Zdonik, S.B.2
  • 10
    • 0026941401 scopus 로고
    • Generic arc-consistency algorithm and its specializations
    • Hentenryck, P.V., Deville, Y. and Teng, C.-M., Generic arc-consistency algorithm and its specializations, Artificial Intelligence, 57 (1992) 291-321.
    • (1992) Artificial Intelligence , vol.57 , pp. 291-321
    • Hentenryck, P.V.1    Deville, Y.2    Teng, C.-M.3
  • 11
    • 6344287791 scopus 로고    scopus 로고
    • Supporting top-K join queries in relational databases
    • Morgan Kaufmann, Berlin, Germany
    • Ilyas, I.F., Aref, W.G. and Elmagarmid, A.K., Supporting Top-K Join Queries in Relational Databases. VLDB 2003, Morgan Kaufmann, Berlin, Germany, 2003.
    • (2003) VLDB 2003
    • Ilyas, I.F.1    Aref, W.G.2    Elmagarmid, A.K.3
  • 12
    • 0019689911 scopus 로고
    • QUIST A system for semantic query optimization in relational databases
    • Cannes, France
    • King, J.J., "QUIST A system for semantic query optimization in relational databases. 7th Int. VLDB Conference, Cannes, France, 1981, pp. 510-517.
    • (1981) 7th Int. VLDB Conference , pp. 510-517
    • King, J.J.1
  • 13
    • 0031618504 scopus 로고    scopus 로고
    • Conjunctive-query containment and constraint satisfaction
    • ACM press, Seattle, Washington, United States
    • Kolaitis, P.G. and Vardi, M.Y., Conjunctive-query containment and constraint satisfaction. PODS, ACM press, Seattle, Washington, United States, 1998, pp. 205-213.
    • (1998) PODS , pp. 205-213
    • Kolaitis, P.G.1    Vardi, M.Y.2
  • 19
    • 0034826137 scopus 로고    scopus 로고
    • Content integration for e-business
    • ACM press, Santa Barbara, California, United States
    • Stonebraker, M. and Hellerstein, J.M., Content integration for e-business. PODS, ACM press, Santa Barbara, California, United States, 2001, pp. 552-560.
    • (2001) PODS , pp. 552-560
    • Stonebraker, M.1    Hellerstein, J.M.2
  • 21
    • 0033705777 scopus 로고    scopus 로고
    • Constraint satisfaction and database theory: A tutorial
    • ACM Press, Dallas, Texas, United States
    • Vardi, M.Y., Constraint satisfaction and database theory: a tutorial. PODS, ACM Press, Dallas, Texas, United States, 2000, pp. 75-85.
    • (2000) PODS , pp. 75-85
    • Vardi, M.Y.1
  • 22
    • 0002680001 scopus 로고
    • Understanding line drawings of scenes with shadows
    • P.H. Winston (Ed.), McGraw-Hill, New York
    • Waltz, D.L., Understanding line drawings of scenes with shadows. In P.H. Winston (Ed.), The Psychology of Computer Vision, McGraw-Hill, New York, 1975, pp. 19-21.
    • (1975) The Psychology of Computer Vision , pp. 19-21
    • Waltz, D.L.1
  • 23
    • 0026137724 scopus 로고
    • Optimal buffer partitioning for the nested block join algorithm
    • Kobe, Japan
    • Wolf, J.L., Iyer, B.R., Pattipati, K.R. and Turek, J., Optimal buffer partitioning for the nested block join algorithm. ICDE, Kobe, Japan, 1991.
    • (1991) ICDE
    • Wolf, J.L.1    Iyer, B.R.2    Pattipati, K.R.3    Turek, J.4


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