skip to main content

A quadtree-based dynamic attribute indexing method

TAYEB, J ; ULUSOY, O ; WOLFSON, O

Computer journal, 1998-01, Vol.41 (3), p.185-200 [Periódico revisado por pares]

Oxford: Oxford University Press

Texto completo disponível

Citações Citado por
  • Título:
    A quadtree-based dynamic attribute indexing method
  • Autor: TAYEB, J ; ULUSOY, O ; WOLFSON, O
  • Assuntos: Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Information systems. Data bases ; Memory organisation. Data processing ; Software
  • É parte de: Computer journal, 1998-01, Vol.41 (3), p.185-200
  • Notas: ObjectType-Article-2
    SourceType-Scholarly Journals-1
    ObjectType-Feature-1
    content type line 23
  • Descrição: Dynamic attributes are attributes that change continuously over time making it impractical to issue explicit updates for every change. In this paper, a variant of the quadtree structure to solve the problem of indexing dynamic attributes is presented. The approach is based on the key idea of using a linear function of time for each dynamic attribute that allows prediction of its value in the future. An algorithm for regenerating the quadtree-based index periodically that minimizes CPU and disk access cost is described and an experimental study of performance focusing on query processing and index update overheads is presented. (Original abstract - amended)
  • Editor: Oxford: Oxford University Press
  • Idioma: Inglês

Buscando em bases de dados remotas. Favor aguardar.