Index Data Structures in Object-Oriented Databases

Mueck, Thomas A.; Polaschek, Martin L.

doi:10.1007/978-1-4615-6213-9

Cited by 3 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A selected set of the attributes of a piece of data is processed and stored as bit vectors, referred to as signatures, for efficient identifying of the existence of a piece of data in the database. The closest research is on the signature-based techniques proposed for object-oriented database systems [20,4,16,24]. Other related work includes the response-time enhance methods based on index structures, such as S-Tree [7], and their derivatives [25,26].…”

Section: Introductionmentioning

confidence: 99%

A Signature-based Grid Index Design for RFID Main-Memory Databases

Liao

Suei

et al. 2008

2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing

View full text Add to dashboard Cite

A large-scaled RFID application often needs a highly efficient database system in data processing. This research is motivated by the strong demand of an efficient index structure design for main-memory database systems of RFID applications. In this paper, a signature-based grid index structure is proposed for efficient data queries and storage. An efficient methodology is proposed to locate duplicates and to execute batch deletions and range queries based on application domain knowhow. The capability of the design is implemented in an open source main-memory database system H2 and evaluated by realistic workloads of RFID applications.

show abstract

Section: Introductionmentioning

confidence: 99%

A Signature-based Grid Index Design for RFID Main-Memory Databases

Liao

Suei

et al. 2008

2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing

View full text Add to dashboard Cite

show abstract

“…In [1][2][3][4][5] the presented structures manage to cope with path expressions, which are fundamental in object-oriented databases, but none of them has dealt with data that contain set-valued attributes. Consequently, these structures cannot readily deal with the above kind of queries.…”

Section: Introductionmentioning

confidence: 99%

Signature-based structures for objects with set-valued attributes

Tousidou

Bozanis

Manolopoulos

2002

Information Systems

View full text Add to dashboard Cite

Aiming at the efficient retrieval of objects with set-valued attributes, we introduce three variations of a new method in order to satisfy subset and superset queries. Our approach is to combine the advantages of two access methods, that of linear Hashing and of tree-shaped methods, on which other similar methods have been previously reported as well. Performance estimation analytical functions for each particular method are presented, followed by a thorough experimental comparison of all investigated structures, where analytical and experimental results deviate 10% on the average. Finally, the results of this performance evaluation are presented and discussed, clearly showing the superiority of the new methods reaching an improvement of up to 85%. r

show abstract