메뉴 건너뛰기




Volumn 93, Issue 3-4, 1996, Pages 187-210

Methodology for index configurations in object-oriented databases

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ECONOMICS; MATHEMATICAL TECHNIQUES; MAXIMUM PRINCIPLE; OPTIMAL SYSTEMS;

EID: 0030241235     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0255(96)00057-6     Document Type: Article
Times cited : (1)

References (20)
  • 3
    • 0024686488 scopus 로고
    • Indexing techniques for queries on nested objects
    • E. Bertino and W. Kim, Indexing techniques for queries on nested objects, IEEE Trans. Knowl. Data Eng. 1(2): 196-214 (1989).
    • (1989) IEEE Trans. Knowl. Data Eng. , vol.1 , Issue.2 , pp. 196-214
    • Bertino, E.1    Kim, W.2
  • 8
    • 84976836562 scopus 로고
    • The difficulty of optimum index selection
    • D. Comer, The difficulty of optimum index selection, ACM Trans. Database Syst. 3(4):440-445 (1978).
    • (1978) ACM Trans. Database Syst. , vol.3 , Issue.4 , pp. 440-445
    • Comer, D.1
  • 10
    • 0021393083 scopus 로고
    • Separability - An approach to physical database design
    • K. Y. Whang, G. Wiederhold, and D. Sagalowicz, Separability - an approach to physical database design, IEEE Trans. Comput. 33(3):209-222 (1984).
    • (1984) IEEE Trans. Comput. , vol.33 , Issue.3 , pp. 209-222
    • Whang, K.Y.1    Wiederhold, G.2    Sagalowicz, D.3
  • 12
    • 0018480749 scopus 로고
    • The ubiquitous B-tree
    • D. Comer, The ubiquitous B-tree, ACM Comput. Surv. 11(2):121-137 (1979).
    • (1979) ACM Comput. Surv. , vol.11 , Issue.2 , pp. 121-137
    • Comer, D.1
  • 13
    • 0022028915 scopus 로고
    • Expressions for batched searching of sequential and hierarchical files
    • P. Palvia, Expressions for batched searching of sequential and hierarchical files, ACM Trans. Database Syst. 10(2):97-106 (1985).
    • (1985) ACM Trans. Database Syst. , vol.10 , Issue.2 , pp. 97-106
    • Palvia, P.1
  • 14
    • 84976777554 scopus 로고
    • Approximating block accesses in database organizations
    • S. B. Yao, Approximating block accesses in database organizations, Commun. ACM 20(4):260-261 (1977).
    • (1977) Commun. ACM , vol.20 , Issue.4 , pp. 260-261
    • Yao, S.B.1
  • 19
    • 0042502601 scopus 로고
    • On the selection of optimal index configuration in OO databases
    • S. S. Chawathe, M. S. Chen, and P. S. Yu, On the selection of optimal index configuration in OO databases, in Proceedings of VLDB Conference, 1994, pp. 331-341.
    • (1994) Proceedings of VLDB Conference , pp. 331-341
    • Chawathe, S.S.1    Chen, M.S.2    Yu, P.S.3
  • 20
    • 0002546746 scopus 로고
    • Join index hierarchies for supporting efficient navigations in object-oriented databases
    • Z. Xie and J. Han, Join index hierarchies for supporting efficient navigations in object-oriented databases, in Proceedings of VLDB Conference, 1994, pp. 522-533.
    • (1994) Proceedings of VLDB Conference , pp. 522-533
    • Xie, Z.1    Han, J.2


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