메뉴 건너뛰기




Volumn 4067 LNCS, Issue , 2006, Pages 28-49

Efficient object querying for java

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); JAVA PROGRAMMING LANGUAGE; QUERY LANGUAGES; SOFTWARE PROTOTYPING;

EID: 33746613692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11785477_3     Document Type: Conference Paper
Times cited : (25)

References (38)
  • 1
    • 0004238565 scopus 로고    scopus 로고
    • The Standard Performance Corporation. SPEC JVM98 benchmarks, http://www.spec.org/osg/jvm98, 1998.
    • (1998) SPEC JVM98 Benchmarks
  • 2
    • 0345186413 scopus 로고
    • Iterators: Signs of weakness in object-oriented languages
    • July
    • H. G. Baker. Iterators: Signs of weakness in object-oriented languages. ACM OOPS Messenger, 4(3), July 1993.
    • (1993) ACM OOPS Messenger , vol.4 , Issue.3
    • Baker, H.G.1
  • 4
    • 26444619821 scopus 로고    scopus 로고
    • The essence of data access in cw
    • Proceedings of the European Conference on Object-Oriented Programming (ECOOP). Springer-Verlag
    • G. Bierman, E. Meijer, and W. Schulte. The essence of data access in cw. In Proceedings of the European Conference on Object-Oriented Programming (ECOOP), volume 3586 of Lecture Notes in Computer Science, pages 287-311. Springer-Verlag, 2005.
    • (2005) Lecture Notes in Computer Science , vol.3586 , pp. 287-311
    • Bierman, G.1    Meijer, E.2    Schulte, W.3
  • 5
    • 26444602456 scopus 로고    scopus 로고
    • First-class relationships in an object-oriented language
    • Proceedings of the European Conference on Object-Oriented Programming (ECOOP). Springer-Verlag
    • G. Bierman and A. Wren. First-class relationships in an object-oriented language. In Proceedings of the European Conference on Object-Oriented Programming (ECOOP), volume 3586 of Lecture Notes in Computer Science, pages 262-282. Springer-Verlag, 2005.
    • (2005) Lecture Notes in Computer Science , vol.3586 , pp. 262-282
    • Bierman, G.1    Wren, A.2
  • 9
    • 33746591654 scopus 로고    scopus 로고
    • Programming languages & databases: What's the problem?
    • Department of Computer Sciences, The University of Texas at Austin
    • W. R. Cook and A. H. Ibrahim. Programming languages & databases: What's the problem? Technical report, Department of Computer Sciences, The University of Texas at Austin, 2005.
    • (2005) Technical Report
    • Cook, W.R.1    Ibrahim, A.H.2
  • 10
  • 12
    • 0031117798 scopus 로고    scopus 로고
    • My hairiest bug war stories
    • M. Eisenstadt. My hairiest bug war stories. Communications of the ACM, 40(4):30-37, 1997.
    • (1997) Communications of the ACM , vol.40 , Issue.4 , pp. 30-37
    • Eisenstadt, M.1
  • 18
    • 0021497828 scopus 로고
    • On the optimal nesting order for computing n-relational joins
    • T. Ibaraki and T. Kameda. On the optimal nesting order for computing n-relational joins. ACM Transactions on Database Systems., 9(3):482-502, 1984.
    • (1984) ACM Transactions on Database Systems , vol.9 , Issue.3 , pp. 482-502
    • Ibaraki, T.1    Kameda, T.2
  • 20
    • 84924428408 scopus 로고    scopus 로고
    • PhD thesis, University of California, Santa Barbara, TR-1999-27
    • R. Lencevicius. Query-Based Debugging. PhD thesis, University of California, Santa Barbara, 1999. TR-1999-27.
    • (1999) Query-based Debugging
    • Lencevicius, R.1
  • 23
    • 84947913382 scopus 로고    scopus 로고
    • Dynamic query-based debugging
    • Proceedings of the European Conference on Object-Oriented Programming (ECOOP). Springer-Verlag
    • R. Lencevicius, U. Hölzle, and A. K. Singh. Dynamic query-based debugging. In Proceedings of the European Conference on Object-Oriented Programming (ECOOP), volume 1628 of Lecture Notes in Computer Science, pages 135-160. Springer-Verlag, 1999.
    • (1999) Lecture Notes in Computer Science , vol.1628 , pp. 135-160
    • Lencevicius, R.1    Hölzle, U.2    Singh, A.K.3
  • 26
    • 0026826969 scopus 로고
    • Join processing in relational databases
    • P. Mishra and M. H. Eich. Join processing in relational databases. ACM Computing Surveys, 24(1):63-113, 1992.
    • (1992) ACM Computing Surveys , vol.24 , Issue.1 , pp. 63-113
    • Mishra, P.1    Eich, M.H.2
  • 27
    • 15044341833 scopus 로고    scopus 로고
    • Basic relationship patterns
    • N. Haxrison, B. Foote, and H. Rohnert, editors, chapter 6. Addison-Wesley
    • J. Noble. Basic relationship patterns. In N. Haxrison, B. Foote, and H. Rohnert, editors, Pattern Languages of Program Design 4, chapter 6, pages 73-94. Addison-Wesley, 2000.
    • (2000) Pattern Languages of Program Design , vol.4 , pp. 73-94
    • Noble, J.1
  • 34
    • 35048835831 scopus 로고    scopus 로고
    • Object invariants in dynamic contexts
    • Proceedings of the European Conference on Object-Oriented Programming (ECOOP). Springer-Verlag
    • K. Rustan, M. Leino, and P. Müller. Object invariants in dynamic contexts. In Proceedings of the European Conference on Object-Oriented Programming (ECOOP), volume 3086 of Lecture Notes in Computer Science, pages 491-516. Springer-Verlag, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3086 , pp. 491-516
    • Rustan, K.1    Leino, M.2    Müller, P.3
  • 35
    • 26444577491 scopus 로고    scopus 로고
    • Modular verification of static class invariants
    • Proceedings of the Formal Methods Conference (FM)
    • K. Rustan, M. Leino, and P. Müller. Modular verification of static class invariants. In Proceedings of the Formal Methods Conference (FM), volume 3582 of Lecture Notes in Computer Science, pages 26-42, 2005.
    • (2005) Lecture Notes in Computer Science , vol.3582 , pp. 26-42
    • Rustan, K.1    Leino, M.2    Müller, P.3
  • 36
    • 0001443955 scopus 로고    scopus 로고
    • Heuristic and randomized optimization for the join ordering problem
    • M. Steinbrunn, G. Moerkotte, and A. Kemper. Heuristic and randomized optimization for the join ordering problem. The VLDB Journal, 6(3): 191-208, 1997.
    • (1997) The VLDB Journal , vol.6 , Issue.3 , pp. 191-208
    • Steinbrunn, M.1    Moerkotte, G.2    Kemper, A.3
  • 37
    • 0027228912 scopus 로고
    • A polynomial time algorithm for optimizing join queries
    • Washington, DC, USA. IEEE Computer Society
    • A. N. Swami and B. R. lyer. A polynomial time algorithm for optimizing join queries. In Proceedings of the International Conference on Data Engineering, pages 345-354, Washington, DC, USA, 1993. IEEE Computer Society.
    • (1993) Proceedings of the International Conference on Data Engineering , pp. 345-354
    • Swami, A.N.1    Lyer, B.R.2


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