Generalizing "search" in generalized search trees
The generalized search tree, or GiST, defines a framework of basic interfaces required to construct a hierarchical access method for database systems. As originally specified, GiST only supports record selection. We show how a small number of additional interfaces enable GiST to support a much large...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 389 |
|---|---|
| container_issue | |
| container_start_page | 380 |
| container_title | |
| container_volume | |
| creator | Aoki, P.M. |
| description | The generalized search tree, or GiST, defines a framework of basic interfaces required to construct a hierarchical access method for database systems. As originally specified, GiST only supports record selection. We show how a small number of additional interfaces enable GiST to support a much larger class of operations. Members of this class, which includes, nearest-neighbor and ranked search, user-defined aggregation and index-assisted selectivity estimation, are increasingly common in new database applications. The advantages of implementing these operations in the GiST framework include reduction of user development effort and the ability to use industrial strength concurrency and recovery mechanisms provided by expert implementers. |
| doi_str_mv | 10.1109/ICDE.1998.655801 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_655801</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>655801</ieee_id><sourcerecordid>655801</sourcerecordid><originalsourceid>FETCH-LOGICAL-i146t-8cd7b070c85466bc2f3b467f3cc2412fe61820eb0669056f88fccac1fdc9ba773</originalsourceid><addsrcrecordid>eNo1j89Lw0AQhRd_gLH2Lp5C74kzu9nZ2aPEWgsFLwreymYzW1dqkKQX_esVqu_y4HvwwVPqGqFGBH-7bu-XNXrPNVnLgCeq0MbZCjS9nqpLYGRizV6fqQKBTEWG9YWaT9M7_MY3iBYKhSsZZAz7_J2HXbmYJIzxbVHmodz9D9KXR1weRpHpSp2nsJ9k_tcz9fKwfG4fq83Tat3ebaqMDR0qjr3rwEFk2xB1USfTNeSSiVE3qJMQsgbpgMiDpcScYgwRUx99F5wzM3Vz9GYR2X6O-SOMX9vjWfMDRqlFew</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Generalizing "search" in generalized search trees</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Aoki, P.M.</creator><creatorcontrib>Aoki, P.M.</creatorcontrib><description>The generalized search tree, or GiST, defines a framework of basic interfaces required to construct a hierarchical access method for database systems. As originally specified, GiST only supports record selection. We show how a small number of additional interfaces enable GiST to support a much larger class of operations. Members of this class, which includes, nearest-neighbor and ranked search, user-defined aggregation and index-assisted selectivity estimation, are increasingly common in new database applications. The advantages of implementing these operations in the GiST framework include reduction of user development effort and the ability to use industrial strength concurrency and recovery mechanisms provided by expert implementers.</description><identifier>ISSN: 1063-6382</identifier><identifier>ISBN: 0818682892</identifier><identifier>ISBN: 9780818682896</identifier><identifier>EISSN: 2375-026X</identifier><identifier>DOI: 10.1109/ICDE.1998.655801</identifier><language>eng</language><publisher>IEEE</publisher><subject>Access protocols ; Computer interfaces ; Concurrency control ; Cost function ; Database systems ; Image databases ; Marine vehicles ; Multimedia databases ; Optimization methods ; Robustness</subject><ispartof>Proceedings 14th International Conference on Data Engineering, 1998, p.380-389</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/655801$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/655801$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Aoki, P.M.</creatorcontrib><title>Generalizing "search" in generalized search trees</title><title>Proceedings 14th International Conference on Data Engineering</title><addtitle>ICDE</addtitle><description>The generalized search tree, or GiST, defines a framework of basic interfaces required to construct a hierarchical access method for database systems. As originally specified, GiST only supports record selection. We show how a small number of additional interfaces enable GiST to support a much larger class of operations. Members of this class, which includes, nearest-neighbor and ranked search, user-defined aggregation and index-assisted selectivity estimation, are increasingly common in new database applications. The advantages of implementing these operations in the GiST framework include reduction of user development effort and the ability to use industrial strength concurrency and recovery mechanisms provided by expert implementers.</description><subject>Access protocols</subject><subject>Computer interfaces</subject><subject>Concurrency control</subject><subject>Cost function</subject><subject>Database systems</subject><subject>Image databases</subject><subject>Marine vehicles</subject><subject>Multimedia databases</subject><subject>Optimization methods</subject><subject>Robustness</subject><issn>1063-6382</issn><issn>2375-026X</issn><isbn>0818682892</isbn><isbn>9780818682896</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1998</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1j89Lw0AQhRd_gLH2Lp5C74kzu9nZ2aPEWgsFLwreymYzW1dqkKQX_esVqu_y4HvwwVPqGqFGBH-7bu-XNXrPNVnLgCeq0MbZCjS9nqpLYGRizV6fqQKBTEWG9YWaT9M7_MY3iBYKhSsZZAz7_J2HXbmYJIzxbVHmodz9D9KXR1weRpHpSp2nsJ9k_tcz9fKwfG4fq83Tat3ebaqMDR0qjr3rwEFk2xB1USfTNeSSiVE3qJMQsgbpgMiDpcScYgwRUx99F5wzM3Vz9GYR2X6O-SOMX9vjWfMDRqlFew</recordid><startdate>1998</startdate><enddate>1998</enddate><creator>Aoki, P.M.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>1998</creationdate><title>Generalizing "search" in generalized search trees</title><author>Aoki, P.M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i146t-8cd7b070c85466bc2f3b467f3cc2412fe61820eb0669056f88fccac1fdc9ba773</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Access protocols</topic><topic>Computer interfaces</topic><topic>Concurrency control</topic><topic>Cost function</topic><topic>Database systems</topic><topic>Image databases</topic><topic>Marine vehicles</topic><topic>Multimedia databases</topic><topic>Optimization methods</topic><topic>Robustness</topic><toplevel>online_resources</toplevel><creatorcontrib>Aoki, P.M.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Aoki, P.M.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Generalizing "search" in generalized search trees</atitle><btitle>Proceedings 14th International Conference on Data Engineering</btitle><stitle>ICDE</stitle><date>1998</date><risdate>1998</risdate><spage>380</spage><epage>389</epage><pages>380-389</pages><issn>1063-6382</issn><eissn>2375-026X</eissn><isbn>0818682892</isbn><isbn>9780818682896</isbn><abstract>The generalized search tree, or GiST, defines a framework of basic interfaces required to construct a hierarchical access method for database systems. As originally specified, GiST only supports record selection. We show how a small number of additional interfaces enable GiST to support a much larger class of operations. Members of this class, which includes, nearest-neighbor and ranked search, user-defined aggregation and index-assisted selectivity estimation, are increasingly common in new database applications. The advantages of implementing these operations in the GiST framework include reduction of user development effort and the ability to use industrial strength concurrency and recovery mechanisms provided by expert implementers.</abstract><pub>IEEE</pub><doi>10.1109/ICDE.1998.655801</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1063-6382 |
| ispartof | Proceedings 14th International Conference on Data Engineering, 1998, p.380-389 |
| issn | 1063-6382 2375-026X |
| language | eng |
| recordid | cdi_ieee_primary_655801 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Access protocols Computer interfaces Concurrency control Cost function Database systems Image databases Marine vehicles Multimedia databases Optimization methods Robustness |
| title | Generalizing "search" in generalized search trees |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T03%3A19%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Generalizing%20%22search%22%20in%20generalized%20search%20trees&rft.btitle=Proceedings%2014th%20International%20Conference%20on%20Data%20Engineering&rft.au=Aoki,%20P.M.&rft.date=1998&rft.spage=380&rft.epage=389&rft.pages=380-389&rft.issn=1063-6382&rft.eissn=2375-026X&rft.isbn=0818682892&rft.isbn_list=9780818682896&rft_id=info:doi/10.1109/ICDE.1998.655801&rft_dat=%3Cieee_6IE%3E655801%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=655801&rfr_iscdi=true |