DMCA
Developing a DataBlade for a New Index (1999)
Cached
Download Links
| Citations: | 24 - 2 self |
BibTeX
@MISC{Bliujute99developinga,
author = {Rasa Bliujute and Simonas Saltenis and Giedrius Slivinskas and Christian S. Jensen},
title = {Developing a DataBlade for a New Index},
year = {1999}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In order to better support current and new applications, the major DBMS vendors are stepping beyond uninterpreted binary large objects, termed BLOBs, and are beginning to offer extensibility features that allow external developers to extend the DBMS with, e.g., their own data types and accompanying access methods. Existing solutions include DB2 extenders, Informix DataBlades, and Oracle cartridges. Extensible systems offer new and exciting opportunities for researchers and third-party developers alike. This paper reports on an implementation of an Informix DataBlade for the GR-tree, a new R-tree based index. This effort represents a stress test of the perhaps currently most extensible DBMS, in that the new DataBlade aims to achieve better performance, not just to add functionality. The paper provides guidelines for how to create an access method DataBlade, describes the sometimes surprising challenges that must be negotiated during DataBlade development, and evaluates the extensibility of the Informix Dynamic Server.
Keyphrases
new index extensibility feature exciting opportunity informix datablade new r-tree major dbms vendor datablade development informix dynamic server surprising challenge informix datablades oracle cartridge access method datablade extensible system access method uninterpreted binary large object external developer db2 extenders data type stress test third-party developer new application extensible dbms new datablade aim
