메뉴 건너뛰기




Volumn 3, Issue 1, 2010, Pages 162-172

Avalanche-Safe LINQ compilation

Author keywords

[No Author keywords available]

Indexed keywords

RELATIONAL DATABASE SYSTEMS;

EID: 80054106345     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920866     Document Type: Article
Times cited : (49)

References (25)
  • 3
    • 42149103195 scopus 로고    scopus 로고
    • Lost In Translation: Formalizing Proposed Extensions to C
    • G. M. Bierman, E. Meijer, and M. Torgersen. Lost In Translation: Formalizing Proposed Extensions to C#. In Proc. OOPSLA, 2007.
    • (2007) Proc. OOPSLA
    • Bierman, G.M.1    Meijer, E.2    Torgersen, M.3
  • 6
    • 84945724174 scopus 로고
    • Operators for Non-First-Normal-Form Relations
    • P. Fischer and S. Thomas. Operators for Non-First-Normal-Form Relations. In Proc. COMPSAC, 1983.
    • (1983) In Proc. COMPSAC
    • Fischer, P.1    Thomas, S.2
  • 11
    • 38849162045 scopus 로고    scopus 로고
    • Comprehensive Comprehensions: Comprehensions with Order by" and Group by"
    • S. P. Jones and P. Wadler. Comprehensive Comprehensions: Comprehensions with Order by" and Group by". In Proc. Haskell Workshop, 2007.
    • (2007) In Proc. Haskell Workshop
    • Jones, S.P.1    Wadler, P.2
  • 12
    • 0345114620 scopus 로고
    • A Transformation-based Approach to Optimizing Loops in Database Programming Languages
    • D. Lieuwen and D. DeWitt. A Transformation-based Approach to Optimizing Loops in Database Programming Languages. In Proc. SIGMOD, 1992.
    • (1992) In Proc. SIGMOD
    • Lieuwen, D.1    DeWitt, D.2
  • 13
    • 67650081261 scopus 로고    scopus 로고
    • Confessions of a Used Programming Language Salesman: Getting the Masses Hooked on Haskell
    • E. Meijer. Confessions of a Used Programming Language Salesman: Getting the Masses Hooked on Haskell. ACM SIGPLAN Notices, 42(10), 2007.
    • (2007) ACM SIGPLAN Notices , vol.42 , Issue.10
    • Meijer, E.1
  • 14
    • 34250666292 scopus 로고    scopus 로고
    • LINQ: Reconciling Objects, Relations, and XML in the.NET Framework
    • E. Meijer, B. Beckman, and G. Bierman. LINQ: Reconciling Objects, Relations, and XML in the .NET Framework. In Proc. SIGMOD, 2006.
    • (2006) In Proc. SIGMOD
    • Meijer, E.1    Beckman, B.2    Bierman, G.3
  • 15
    • 0012574756 scopus 로고    scopus 로고
    • Type-Directed Specialization of Polymorphism. Information and Computation
    • A. Ohori. Type-Directed Specialization of Polymorphism. Information and Computation, 155(1-2), 1999.
    • (1999) , vol.155 , Issue.1-2
    • Ohori, A.1
  • 17
    • 0032288850 scopus 로고    scopus 로고
    • Definitional Interpreters for Higher-Order Programming Languages
    • J. Reynolds. Definitional Interpreters for Higher-Order Programming Languages. Higher-Order and Symbolic Computation, 11(4), 1998.
    • (1998) Higher-Order and Symbolic Computation , vol.11 , Issue.4
    • Reynolds, J.1
  • 18
    • 0022582868 scopus 로고
    • The Relational Model with Relation-Valued Attributes
    • H. J. Schek and M. H. Scholl. The Relational Model with Relation-Valued Attributes. Information Systems, 11(2), 1986.
    • (1986) Information Systems , vol.11 , Issue.2
    • Schek, H.J.1    Scholl, M.H.2
  • 23
    • 85038459943 scopus 로고    scopus 로고
    • TPC Benchmark H. TP Council
    • TPC Benchmark H. TP Council. http://www.tpc.org/tpch/.
  • 24
    • 0034920160 scopus 로고    scopus 로고
    • Simulation of the Nested Relational Algebra by the Flat Relational Algebra, with an Application to the Complexity of Evaluating Powerset Algebra Expressions
    • J. van den Bussche. Simulation of the Nested Relational Algebra by the Flat Relational Algebra, with an Application to the Complexity of Evaluating Powerset Algebra Expressions. Theoretical Computer Science, 254(1-2), 2001.
    • (2001) Theoretical Computer Science , vol.254 , Issue.1-2
    • van den Bussche, J.1
  • 25


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