메뉴 건너뛰기




Volumn 5, Issue 3, 1996, Pages 215-228

Index nesting - An efficient approach to indexing in object-oriented databases

Author keywords

Indexing structures; OODB; Query retrieval

Indexed keywords


EID: 0040527681     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s007780050025     Document Type: Article
Times cited : (5)

References (16)
  • 1
    • 0024686488 scopus 로고
    • Indexing techniques for queries on nested objects
    • Bertino E, Kim W (1989) Indexing techniques for queries on nested objects. IEEE Trans Knowl Data Eng 1:196-214
    • (1989) IEEE Trans Knowl Data Eng , vol.1 , pp. 196-214
    • Bertino, E.1    Kim, W.2
  • 4
    • 0018480749 scopus 로고
    • The ubiquitous B-tree
    • Comer D (1979) The ubiquitous B-tree. ACM Comput Surv 11:121-137
    • (1979) ACM Comput Surv , vol.11 , pp. 121-137
    • Comer, D.1
  • 7
    • 0039694178 scopus 로고
    • Indexing techniques for object-oriented database
    • Kim W, Lochovsky FH (eds) Addison-Wesley, Reading, Mass
    • Kim et al. 1989kkd:kim Kim W, Kim KC, Dale A (1989) Indexing techniques for object-oriented database. In: Kim W, Lochovsky FH (eds) Object-oriented concepts, databases, and applications. Addison-Wesley, Reading, Mass, pp 371-394
    • (1989) Object-oriented Concepts, Databases, and Applications , pp. 371-394
    • Kim1
  • 9
    • 0021601844 scopus 로고
    • Performance comparison of index structures for multi-key retrieval
    • Boston, Mass
    • Kriegel HP (1984) Performance comparison of index structures for multi-key retrieval. In: ACM Proc Intl Conf on Management of Data, Boston, Mass, pp 186-196
    • (1984) ACM Proc Intl Conf on Management of Data , pp. 186-196
    • Kriegel, H.P.1
  • 10
    • 85031744055 scopus 로고
    • H-trees: A dynamic associative search index for OODB
    • San Diego, Calif
    • Low CC, Ooi BC, Lu H (1992) H-trees: a dynamic associative search index for OODB. In: ACM Proc Intl Conf on Management of Data, San Diego, Calif, pp 134-143
    • (1992) ACM Proc Intl Conf on Management of Data , pp. 134-143
    • Low, C.C.1    Ooi, B.C.2    Lu, H.3
  • 14
    • 0020277962 scopus 로고
    • Multidimensional B-trees for associative searching in database systems
    • Scheuermann P, Ouksel M (1982) Multidimensional B-trees for associative searching in database systems. Inf 7:123-137
    • (1982) Inf , vol.7 , pp. 123-137
    • Scheuermann, P.1    Ouksel, M.2
  • 15
    • 0000314118 scopus 로고
    • The hcC-tree: An efficient index structure for object oriented database
    • Santiago, Chile
    • Sreenath B, Seshadri S (1994) The hcC-tree: an efficient index structure for object oriented database. In: Proc Intl Conf on Very Large Data Bases, Santiago, Chile, pp 203-213
    • (1994) Proc Intl Conf on Very Large Data Bases , pp. 203-213
    • Sreenath, B.1    Seshadri, S.2


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