Adapting the Pyramid Technique for Indexing Ontological Data
This paper describes the implementation of an indexing mechanism on a Rete-based reasoner working with ontological data in order to optimize memory consumption of the reasoner. This newly introduced indexing mechanism is known as the Pyramid Technique [1]. Our work organizes three dimensional ontolo...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 211 |
---|---|
container_issue | |
container_start_page | 202 |
container_title | |
container_volume | |
creator | Öztürk, Övünç Özacar, Tuğba Ünalır, Murat Osman Önal, Ata |
description | This paper describes the implementation of an indexing mechanism on a Rete-based reasoner working with ontological data in order to optimize memory consumption of the reasoner. This newly introduced indexing mechanism is known as the Pyramid Technique [1]. Our work organizes three dimensional ontological data in a way that works efficiently with this indexing mechanism and it constructs a subset of the querying scheme of the Pyramid Technique that supports querying ontological data. This work also implements an optimization on the Pyramid Technique. Finally, it discusses the performance analysis of the reasoner in terms of time and memory consumptions. |
doi_str_mv | 10.1007/11902140_23 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19993319</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19993319</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-8c7e6b7276f023d151c114aae4fa7a71006251855e675b3f3268ca35c071de503</originalsourceid><addsrcrecordid>eNpNkLtOw0AURJeXRBJS8QNuKCgM9-7dh1eiQeEVKVIoQr3arNeJIbGN10jk73EUkKimmKMZzTB2iXCDAPoW0QBHAZbTERuSFCA0F6SO2QAVYkokzAkbG539eRxP2QAIeGq0oHM2jPEdALg2fMDu7nPXdGW1Srp1SF53rduWebIIfl2Vn18hKeo2mVZ5-N4j86qrN_Wq9G6TPLjOXbCzwm1iGP_qiL09PS4mL-ls_jyd3M_ShqPp0szroJaaa1UApxwlekThXBCF0073sxSXmEkZlJZLKoirzDuSHjTmQQKN2NUht3Gx7y5aV_ky2qYtt67dWTTGEKHpuesDF3urWoXWLuv6I1oEu__O_vuOfgBGK1nQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Adapting the Pyramid Technique for Indexing Ontological Data</title><source>Springer Books</source><creator>Öztürk, Övünç ; Özacar, Tuğba ; Ünalır, Murat Osman ; Önal, Ata</creator><contributor>Savaş, Erkay ; Balcısoy, Selim ; Levi, Albert ; Yenigün, Hüsnü ; Saygın, Yücel</contributor><creatorcontrib>Öztürk, Övünç ; Özacar, Tuğba ; Ünalır, Murat Osman ; Önal, Ata ; Savaş, Erkay ; Balcısoy, Selim ; Levi, Albert ; Yenigün, Hüsnü ; Saygın, Yücel</creatorcontrib><description>This paper describes the implementation of an indexing mechanism on a Rete-based reasoner working with ontological data in order to optimize memory consumption of the reasoner. This newly introduced indexing mechanism is known as the Pyramid Technique [1]. Our work organizes three dimensional ontological data in a way that works efficiently with this indexing mechanism and it constructs a subset of the querying scheme of the Pyramid Technique that supports querying ontological data. This work also implements an optimization on the Pyramid Technique. Finally, it discusses the performance analysis of the reasoner in terms of time and memory consumptions.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540472421</identifier><identifier>ISBN: 3540472428</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540472436</identifier><identifier>EISBN: 9783540472438</identifier><identifier>DOI: 10.1007/11902140_23</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Inference Engine ; Memory Consumption ; Point Query ; Query Answer ; Range Query</subject><ispartof>Computer and Information Sciences – ISCIS 2006, 2006, p.202-211</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2008 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11902140_23$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11902140_23$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19993319$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Savaş, Erkay</contributor><contributor>Balcısoy, Selim</contributor><contributor>Levi, Albert</contributor><contributor>Yenigün, Hüsnü</contributor><contributor>Saygın, Yücel</contributor><creatorcontrib>Öztürk, Övünç</creatorcontrib><creatorcontrib>Özacar, Tuğba</creatorcontrib><creatorcontrib>Ünalır, Murat Osman</creatorcontrib><creatorcontrib>Önal, Ata</creatorcontrib><title>Adapting the Pyramid Technique for Indexing Ontological Data</title><title>Computer and Information Sciences – ISCIS 2006</title><description>This paper describes the implementation of an indexing mechanism on a Rete-based reasoner working with ontological data in order to optimize memory consumption of the reasoner. This newly introduced indexing mechanism is known as the Pyramid Technique [1]. Our work organizes three dimensional ontological data in a way that works efficiently with this indexing mechanism and it constructs a subset of the querying scheme of the Pyramid Technique that supports querying ontological data. This work also implements an optimization on the Pyramid Technique. Finally, it discusses the performance analysis of the reasoner in terms of time and memory consumptions.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Inference Engine</subject><subject>Memory Consumption</subject><subject>Point Query</subject><subject>Query Answer</subject><subject>Range Query</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540472421</isbn><isbn>3540472428</isbn><isbn>3540472436</isbn><isbn>9783540472438</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkLtOw0AURJeXRBJS8QNuKCgM9-7dh1eiQeEVKVIoQr3arNeJIbGN10jk73EUkKimmKMZzTB2iXCDAPoW0QBHAZbTERuSFCA0F6SO2QAVYkokzAkbG539eRxP2QAIeGq0oHM2jPEdALg2fMDu7nPXdGW1Srp1SF53rduWebIIfl2Vn18hKeo2mVZ5-N4j86qrN_Wq9G6TPLjOXbCzwm1iGP_qiL09PS4mL-ls_jyd3M_ShqPp0szroJaaa1UApxwlekThXBCF0073sxSXmEkZlJZLKoirzDuSHjTmQQKN2NUht3Gx7y5aV_ky2qYtt67dWTTGEKHpuesDF3urWoXWLuv6I1oEu__O_vuOfgBGK1nQ</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Öztürk, Övünç</creator><creator>Özacar, Tuğba</creator><creator>Ünalır, Murat Osman</creator><creator>Önal, Ata</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>Adapting the Pyramid Technique for Indexing Ontological Data</title><author>Öztürk, Övünç ; Özacar, Tuğba ; Ünalır, Murat Osman ; Önal, Ata</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-8c7e6b7276f023d151c114aae4fa7a71006251855e675b3f3268ca35c071de503</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Inference Engine</topic><topic>Memory Consumption</topic><topic>Point Query</topic><topic>Query Answer</topic><topic>Range Query</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Öztürk, Övünç</creatorcontrib><creatorcontrib>Özacar, Tuğba</creatorcontrib><creatorcontrib>Ünalır, Murat Osman</creatorcontrib><creatorcontrib>Önal, Ata</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Öztürk, Övünç</au><au>Özacar, Tuğba</au><au>Ünalır, Murat Osman</au><au>Önal, Ata</au><au>Savaş, Erkay</au><au>Balcısoy, Selim</au><au>Levi, Albert</au><au>Yenigün, Hüsnü</au><au>Saygın, Yücel</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Adapting the Pyramid Technique for Indexing Ontological Data</atitle><btitle>Computer and Information Sciences – ISCIS 2006</btitle><date>2006</date><risdate>2006</risdate><spage>202</spage><epage>211</epage><pages>202-211</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540472421</isbn><isbn>3540472428</isbn><eisbn>3540472436</eisbn><eisbn>9783540472438</eisbn><abstract>This paper describes the implementation of an indexing mechanism on a Rete-based reasoner working with ontological data in order to optimize memory consumption of the reasoner. This newly introduced indexing mechanism is known as the Pyramid Technique [1]. Our work organizes three dimensional ontological data in a way that works efficiently with this indexing mechanism and it constructs a subset of the querying scheme of the Pyramid Technique that supports querying ontological data. This work also implements an optimization on the Pyramid Technique. Finally, it discusses the performance analysis of the reasoner in terms of time and memory consumptions.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11902140_23</doi><tpages>10</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0302-9743 |
ispartof | Computer and Information Sciences – ISCIS 2006, 2006, p.202-211 |
issn | 0302-9743 1611-3349 |
language | eng |
recordid | cdi_pascalfrancis_primary_19993319 |
source | Springer Books |
subjects | Applied sciences Computer science control theory systems Exact sciences and technology Inference Engine Memory Consumption Point Query Query Answer Range Query |
title | Adapting the Pyramid Technique for Indexing Ontological Data |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T18%3A30%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Adapting%20the%20Pyramid%20Technique%20for%20Indexing%20Ontological%20Data&rft.btitle=Computer%20and%20Information%20Sciences%20%E2%80%93%20ISCIS%202006&rft.au=%C3%96zt%C3%BCrk,%20%C3%96v%C3%BCn%C3%A7&rft.date=2006&rft.spage=202&rft.epage=211&rft.pages=202-211&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540472421&rft.isbn_list=3540472428&rft_id=info:doi/10.1007/11902140_23&rft_dat=%3Cpascalfrancis_sprin%3E19993319%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540472436&rft.eisbn_list=9783540472438&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |