Selection predicate indexing for active databases using interval skip lists

A new, efficient selection predicate indexing scheme for active database systems is introduced. The selection predicate index proposed uses an interval index on an attribute of a relation or object collection when one or more rule condition clauses are defined on that attribute. The selection predic...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information systems (Oxford) 1996-05, Vol.21 (3), p.269-298
Hauptverfasser: Hanson, Eric N., Johnson, Theodore
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 298
container_issue 3
container_start_page 269
container_title Information systems (Oxford)
container_volume 21
creator Hanson, Eric N.
Johnson, Theodore
description A new, efficient selection predicate indexing scheme for active database systems is introduced. The selection predicate index proposed uses an interval index on an attribute of a relation or object collection when one or more rule condition clauses are defined on that attribute. The selection predicate index uses a new type of interval index called the interval skip list (IS-list). The IS-list is designed to allow efficient retrieval of all intervals that overlap a point, while allowing dynamic insertion and deletion of intervals. IS-list algorithms are described in detail. The IS-list allows efficient on-line searches, insertions, and deletions, yet is much simpler to implement than other comparable interval index data structures such as the priority search tree and balanced interval binary search tree (IBS-tree). IS-lists require only one third as much code to implement as balanced IBS-trees. The combination of simplicity, performance, and dynamic updateability of the IS-list is unmatched by any other interval index data structure. This makes the IS-list a good interval index structure for implementation in an active database predicate index. ‡ ‡ The C++ source code for interval skip lists can be obtained at http://www.cis.ufl.edu/~hanson/IS-lists/ or by sending a request by e-mail.
doi_str_mv 10.1016/0306-4379(96)00015-4
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_57399746</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>0306437996000154</els_id><sourcerecordid>57399746</sourcerecordid><originalsourceid>FETCH-LOGICAL-c364t-8b61263016048ec4031f5be9d9b17ed6d47afcab2390da8fb310bdbec45d16883</originalsourceid><addsrcrecordid>eNp9kEtLxDAQgIMouK7-Aw85iOihmjRt2lwEWXzhggf1HPKYSrTbrpnuov_elF326GkY5pvXR8gpZ1eccXnNBJNZISp1oeQlY4yXWbFHJryuRCZZJffJZIcckiPEzwTlpVIT8vwKLbgh9B1dRvDBmQFo6Dz8hO6DNn2kJlXXQL0ZjDUISFc4lkI3QFybluJXWNI24IDH5KAxLcLJNk7J-_3d2-wxm788PM1u55kTshiy2kqeS5EOZ0UNrmCCN6UF5ZXlFXjpi8o0zthcKOZN3VjBmfU2kaXnsq7FlJxv5i5j_70CHPQioIO2NR30K9RlJZSqCpnAYgO62CNGaPQyhoWJv5ozPZrToxY9atEqJaO5lE3J2Xa-QWfaJprOBdz1Cs55rljCbjYYpF_XAaJGF6BzyWJMSrXvw_97_gAsWIJs</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>57399746</pqid></control><display><type>article</type><title>Selection predicate indexing for active databases using interval skip lists</title><source>Elsevier ScienceDirect Journals</source><creator>Hanson, Eric N. ; Johnson, Theodore</creator><creatorcontrib>Hanson, Eric N. ; Johnson, Theodore</creatorcontrib><description>A new, efficient selection predicate indexing scheme for active database systems is introduced. The selection predicate index proposed uses an interval index on an attribute of a relation or object collection when one or more rule condition clauses are defined on that attribute. The selection predicate index uses a new type of interval index called the interval skip list (IS-list). The IS-list is designed to allow efficient retrieval of all intervals that overlap a point, while allowing dynamic insertion and deletion of intervals. IS-list algorithms are described in detail. The IS-list allows efficient on-line searches, insertions, and deletions, yet is much simpler to implement than other comparable interval index data structures such as the priority search tree and balanced interval binary search tree (IBS-tree). IS-lists require only one third as much code to implement as balanced IBS-trees. The combination of simplicity, performance, and dynamic updateability of the IS-list is unmatched by any other interval index data structure. This makes the IS-list a good interval index structure for implementation in an active database predicate index. ‡ ‡ The C++ source code for interval skip lists can be obtained at http://www.cis.ufl.edu/~hanson/IS-lists/ or by sending a request by e-mail.</description><identifier>ISSN: 0306-4379</identifier><identifier>EISSN: 1873-6076</identifier><identifier>DOI: 10.1016/0306-4379(96)00015-4</identifier><identifier>CODEN: INSYD6</identifier><language>eng</language><publisher>Oxford: Elsevier Ltd</publisher><subject>Active Databases ; Applied sciences ; Computer science ; Computer science; control theory; systems ; Discrimination Networks ; Exact sciences and technology ; Information retrieval. Graph ; Information systems. Data bases ; Interval Skip Lists ; Memory organisation. Data processing ; Predicate Indexing ; Software ; Theoretical computing ; Triggers</subject><ispartof>Information systems (Oxford), 1996-05, Vol.21 (3), p.269-298</ispartof><rights>1996</rights><rights>1996 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c364t-8b61263016048ec4031f5be9d9b17ed6d47afcab2390da8fb310bdbec45d16883</citedby><cites>FETCH-LOGICAL-c364t-8b61263016048ec4031f5be9d9b17ed6d47afcab2390da8fb310bdbec45d16883</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/0306437996000154$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27903,27904,65309</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=3111290$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Hanson, Eric N.</creatorcontrib><creatorcontrib>Johnson, Theodore</creatorcontrib><title>Selection predicate indexing for active databases using interval skip lists</title><title>Information systems (Oxford)</title><description>A new, efficient selection predicate indexing scheme for active database systems is introduced. The selection predicate index proposed uses an interval index on an attribute of a relation or object collection when one or more rule condition clauses are defined on that attribute. The selection predicate index uses a new type of interval index called the interval skip list (IS-list). The IS-list is designed to allow efficient retrieval of all intervals that overlap a point, while allowing dynamic insertion and deletion of intervals. IS-list algorithms are described in detail. The IS-list allows efficient on-line searches, insertions, and deletions, yet is much simpler to implement than other comparable interval index data structures such as the priority search tree and balanced interval binary search tree (IBS-tree). IS-lists require only one third as much code to implement as balanced IBS-trees. The combination of simplicity, performance, and dynamic updateability of the IS-list is unmatched by any other interval index data structure. This makes the IS-list a good interval index structure for implementation in an active database predicate index. ‡ ‡ The C++ source code for interval skip lists can be obtained at http://www.cis.ufl.edu/~hanson/IS-lists/ or by sending a request by e-mail.</description><subject>Active Databases</subject><subject>Applied sciences</subject><subject>Computer science</subject><subject>Computer science; control theory; systems</subject><subject>Discrimination Networks</subject><subject>Exact sciences and technology</subject><subject>Information retrieval. Graph</subject><subject>Information systems. Data bases</subject><subject>Interval Skip Lists</subject><subject>Memory organisation. Data processing</subject><subject>Predicate Indexing</subject><subject>Software</subject><subject>Theoretical computing</subject><subject>Triggers</subject><issn>0306-4379</issn><issn>1873-6076</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1996</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLxDAQgIMouK7-Aw85iOihmjRt2lwEWXzhggf1HPKYSrTbrpnuov_elF326GkY5pvXR8gpZ1eccXnNBJNZISp1oeQlY4yXWbFHJryuRCZZJffJZIcckiPEzwTlpVIT8vwKLbgh9B1dRvDBmQFo6Dz8hO6DNn2kJlXXQL0ZjDUISFc4lkI3QFybluJXWNI24IDH5KAxLcLJNk7J-_3d2-wxm788PM1u55kTshiy2kqeS5EOZ0UNrmCCN6UF5ZXlFXjpi8o0zthcKOZN3VjBmfU2kaXnsq7FlJxv5i5j_70CHPQioIO2NR30K9RlJZSqCpnAYgO62CNGaPQyhoWJv5ozPZrToxY9atEqJaO5lE3J2Xa-QWfaJprOBdz1Cs55rljCbjYYpF_XAaJGF6BzyWJMSrXvw_97_gAsWIJs</recordid><startdate>19960501</startdate><enddate>19960501</enddate><creator>Hanson, Eric N.</creator><creator>Johnson, Theodore</creator><general>Elsevier Ltd</general><general>Elsevier Science</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>E3H</scope><scope>F2A</scope></search><sort><creationdate>19960501</creationdate><title>Selection predicate indexing for active databases using interval skip lists</title><author>Hanson, Eric N. ; Johnson, Theodore</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c364t-8b61263016048ec4031f5be9d9b17ed6d47afcab2390da8fb310bdbec45d16883</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1996</creationdate><topic>Active Databases</topic><topic>Applied sciences</topic><topic>Computer science</topic><topic>Computer science; control theory; systems</topic><topic>Discrimination Networks</topic><topic>Exact sciences and technology</topic><topic>Information retrieval. Graph</topic><topic>Information systems. Data bases</topic><topic>Interval Skip Lists</topic><topic>Memory organisation. Data processing</topic><topic>Predicate Indexing</topic><topic>Software</topic><topic>Theoretical computing</topic><topic>Triggers</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hanson, Eric N.</creatorcontrib><creatorcontrib>Johnson, Theodore</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Library &amp; Information Sciences Abstracts (LISA)</collection><collection>Library &amp; Information Science Abstracts (LISA)</collection><jtitle>Information systems (Oxford)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hanson, Eric N.</au><au>Johnson, Theodore</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Selection predicate indexing for active databases using interval skip lists</atitle><jtitle>Information systems (Oxford)</jtitle><date>1996-05-01</date><risdate>1996</risdate><volume>21</volume><issue>3</issue><spage>269</spage><epage>298</epage><pages>269-298</pages><issn>0306-4379</issn><eissn>1873-6076</eissn><coden>INSYD6</coden><abstract>A new, efficient selection predicate indexing scheme for active database systems is introduced. The selection predicate index proposed uses an interval index on an attribute of a relation or object collection when one or more rule condition clauses are defined on that attribute. The selection predicate index uses a new type of interval index called the interval skip list (IS-list). The IS-list is designed to allow efficient retrieval of all intervals that overlap a point, while allowing dynamic insertion and deletion of intervals. IS-list algorithms are described in detail. The IS-list allows efficient on-line searches, insertions, and deletions, yet is much simpler to implement than other comparable interval index data structures such as the priority search tree and balanced interval binary search tree (IBS-tree). IS-lists require only one third as much code to implement as balanced IBS-trees. The combination of simplicity, performance, and dynamic updateability of the IS-list is unmatched by any other interval index data structure. This makes the IS-list a good interval index structure for implementation in an active database predicate index. ‡ ‡ The C++ source code for interval skip lists can be obtained at http://www.cis.ufl.edu/~hanson/IS-lists/ or by sending a request by e-mail.</abstract><cop>Oxford</cop><pub>Elsevier Ltd</pub><doi>10.1016/0306-4379(96)00015-4</doi><tpages>30</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0306-4379
ispartof Information systems (Oxford), 1996-05, Vol.21 (3), p.269-298
issn 0306-4379
1873-6076
language eng
recordid cdi_proquest_miscellaneous_57399746
source Elsevier ScienceDirect Journals
subjects Active Databases
Applied sciences
Computer science
Computer science
control theory
systems
Discrimination Networks
Exact sciences and technology
Information retrieval. Graph
Information systems. Data bases
Interval Skip Lists
Memory organisation. Data processing
Predicate Indexing
Software
Theoretical computing
Triggers
title Selection predicate indexing for active databases using interval skip lists
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T00%3A21%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Selection%20predicate%20indexing%20for%20active%20databases%20using%20interval%20skip%20lists&rft.jtitle=Information%20systems%20(Oxford)&rft.au=Hanson,%20Eric%20N.&rft.date=1996-05-01&rft.volume=21&rft.issue=3&rft.spage=269&rft.epage=298&rft.pages=269-298&rft.issn=0306-4379&rft.eissn=1873-6076&rft.coden=INSYD6&rft_id=info:doi/10.1016/0306-4379(96)00015-4&rft_dat=%3Cproquest_cross%3E57399746%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=57399746&rft_id=info:pmid/&rft_els_id=0306437996000154&rfr_iscdi=true