메뉴 건너뛰기
Proceedings of the ACM SIGMOD International Conference on Management of Data
Volumn , Issue , 2005, Pages 834-839
Optimizing recursive queries in SQL
Author keywords

[No Author keywords available]
Indexed keywords

BINARY SEQUENCES; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; LINEAR PROGRAMMING; QUERY LANGUAGES; RECURSIVE FUNCTIONS;
EID: 29844455017     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066157.1066260     Document Type: Conference Paper
Times cited : (24)
References (12)
  • 1
    • 85034850329 scopus 로고
    • SEQUEL: A structured English query language
    • D.D. Chamberlin and R.F. Boyce. SEQUEL: A structured English query language. In A CM SIGMOD Workshop, pages 249-264, 1974.
    • (1974) A CM SIGMOD Workshop , pp. 249-264
    • Chamberlin, D.D.1    Boyce, R.F.2
  • 2
    • 0032681070 scopus 로고    scopus 로고
    • Inherent complexity of recursive queries
    • S. Cosmadakis. Inherent complexity of recursive queries. In ACM PODS Conference, pages 148-154, 1999.
    • (1999) ACM PODS Conference , pp. 148-154
    • Cosmadakis, S.1
  • 3
    • 0026136023 scopus 로고
    • Optimization of generalized transitive closure queries
    • S. Dar, R. Agrawal, and H.V. Jagadish. Optimization of generalized transitive closure queries. In ICDE Conference, pages 345-354, 1991.
    • (1991) ICDE Conference , pp. 345-354
    • Dar, S.1    Agrawal, R.2    Jagadish, H.V.3
  • 4
    • 0039193061 scopus 로고    scopus 로고
    • Incremental maintenance of recursive views using relational calculus/SQL
    • G. Dong and J. Su. Incremental maintenance of recursive views using relational calculus/SQL. ACM SIGMOD Record, 29(1):44-51, 2000.
    • (2000) ACM SIGMOD Record , vol.29 , Issue.1 , pp. 44-51
    • Dong, G.1    Su, J.2
  • 5
    • 0015205185 scopus 로고
    • Boolean matrix multiplication and transitive closure
    • M.J. Fischer and A.R. Meyer. Boolean matrix multiplication and transitive closure. In IEEE FOCS Conference, pages 129-131, 1971.
    • (1971) IEEE FOCS Conference , pp. 129-131
    • Fischer, M.J.1    Meyer, A.R.2
  • 6
    • 84976753571 scopus 로고
    • Handling redundancy in the processing of recursive database queries
    • J. Han and L.J. Henschen. Handling redundancy in the processing of recursive database queries. In ACM SIGMOD Conference, pages 73-81, 1987.
    • (1987) ACM SIGMOD Conference , pp. 73-81
    • Han, J.1    Henschen, L.J.2
  • 8
    • 0009016691 scopus 로고
    • SQL*: A recursive SQL
    • K. Koymen and Q. Cai. SQL*: a recursive SQL. Inf. Syst., 18(2):121-128, 1993.
    • (1993) Inf. Syst. , vol.18 , Issue.2 , pp. 121-128
    • Koymen, K.1    Cai, Q.2
  • 9
    • 0023168755 scopus 로고
    • Non first normal form relations and recursive queries: An SQL-based approach
    • V. Linnemann. Non first normal form relations and recursive queries: An SQL-based approach. In IEEE ICDE Conference, pages 591-598, 1987.
    • (1987) IEEE ICDE Conference , pp. 591-598
    • Linnemann, V.1
  • 10
    • 26444432537 scopus 로고
    • Evaluation of recursive queries using join indices
    • P. Valduriez and H. Boral. Evaluation of recursive queries using join indices. In Expert Database Systems, pages 271-293, 1986.
    • (1986) Expert Database Systems , pp. 271-293
    • Valduriez, P.1    Boral, H.2
  • 11
    • 85139741335 scopus 로고
    • Decidability and undecidability results for boundedness of linear recursive queries
    • M.Y. Vardi. Decidability and undecidability results for boundedness of linear recursive queries. In ACM PODS Conference, pages 341-351, 1988.
    • (1988) ACM PODS Conference , pp. 341-351
    • Vardi, M.Y.1
  • 12
    • 29844437560 scopus 로고
    • Answering linear recursive queries in cyclic databases
    • C. Wu and L.J. Henschen. Answering linear recursive queries in cyclic databases. In FGCS, pages 727-734, 1988.
    • (1988) FGCS , pp. 727-734
    • Wu, C.1    Henschen, L.J.2

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