METHOD FOR IMPROVING LOOKUP PERFORMANCE OF TREE-TYPE KNOWLEDGE BASE SEARCH

METHOD FOR IMPROVING LOOKUP PERFORMANCE OF TREE-TYPE KNOWLEDGE BASE SEARCH

PROBLEM TO BE SOLVED: To provide the lookup performance of a tree-type knowledge base search. SOLUTION: A decision tree representing a knowledge base is segmented into at least two decision tree portions. The lower portion includes the tree entry point, and is stored in a memory element with a faste...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: BAKER WILLIAM EDWARD, VANGATI NARENDER R, MCDANIEL BETTY A, KIRK JAMES T, CALLE MAURICIO
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator BAKER WILLIAM EDWARD
VANGATI NARENDER R
MCDANIEL BETTY A
KIRK JAMES T
CALLE MAURICIO
description PROBLEM TO BE SOLVED: To provide the lookup performance of a tree-type knowledge base search. SOLUTION: A decision tree representing a knowledge base is segmented into at least two decision tree portions. The lower portion includes the tree entry point, and is stored in a memory element with a faster access time than the upper portion including the terminating element of the decision tree. Therefore, during the process of reading the tree entries for comparing them with the search object, the search entries in the lower portion of the tree can be read faster than the search entries in the upper portion, and as a result, a faster traversal through the entire decision tree can be realized. COPYRIGHT: (C)2003,JPO
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_JP2003196295A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>JP2003196295A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_JP2003196295A3</originalsourceid><addsrcrecordid>eNrjZPDydQ3x8HdRcPMPUvD0DQjyD_P0c1fw8ff3Dg1QCHANAor7Ovo5uyr4uymEBLm66oZEBrgqePv5h_u4uri7Kjg5BrsqBLs6Bjl78DCwpiXmFKfyQmluBiU31xBnD93Ugvz41OKCxOTUvNSSeK8AIwMDY0NLMyNLU0djohQBAMNOLeM</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>METHOD FOR IMPROVING LOOKUP PERFORMANCE OF TREE-TYPE KNOWLEDGE BASE SEARCH</title><source>esp@cenet</source><creator>BAKER WILLIAM EDWARD ; VANGATI NARENDER R ; MCDANIEL BETTY A ; KIRK JAMES T ; CALLE MAURICIO</creator><creatorcontrib>BAKER WILLIAM EDWARD ; VANGATI NARENDER R ; MCDANIEL BETTY A ; KIRK JAMES T ; CALLE MAURICIO</creatorcontrib><description>PROBLEM TO BE SOLVED: To provide the lookup performance of a tree-type knowledge base search. SOLUTION: A decision tree representing a knowledge base is segmented into at least two decision tree portions. The lower portion includes the tree entry point, and is stored in a memory element with a faster access time than the upper portion including the terminating element of the decision tree. Therefore, during the process of reading the tree entries for comparing them with the search object, the search entries in the lower portion of the tree can be read faster than the search entries in the upper portion, and as a result, a faster traversal through the entire decision tree can be realized. COPYRIGHT: (C)2003,JPO</description><edition>7</edition><language>eng</language><subject>CALCULATING ; COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2003</creationdate><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://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20030711&amp;DB=EPODOC&amp;CC=JP&amp;NR=2003196295A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20030711&amp;DB=EPODOC&amp;CC=JP&amp;NR=2003196295A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>BAKER WILLIAM EDWARD</creatorcontrib><creatorcontrib>VANGATI NARENDER R</creatorcontrib><creatorcontrib>MCDANIEL BETTY A</creatorcontrib><creatorcontrib>KIRK JAMES T</creatorcontrib><creatorcontrib>CALLE MAURICIO</creatorcontrib><title>METHOD FOR IMPROVING LOOKUP PERFORMANCE OF TREE-TYPE KNOWLEDGE BASE SEARCH</title><description>PROBLEM TO BE SOLVED: To provide the lookup performance of a tree-type knowledge base search. SOLUTION: A decision tree representing a knowledge base is segmented into at least two decision tree portions. The lower portion includes the tree entry point, and is stored in a memory element with a faster access time than the upper portion including the terminating element of the decision tree. Therefore, during the process of reading the tree entries for comparing them with the search object, the search entries in the lower portion of the tree can be read faster than the search entries in the upper portion, and as a result, a faster traversal through the entire decision tree can be realized. COPYRIGHT: (C)2003,JPO</description><subject>CALCULATING</subject><subject>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2003</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZPDydQ3x8HdRcPMPUvD0DQjyD_P0c1fw8ff3Dg1QCHANAor7Ovo5uyr4uymEBLm66oZEBrgqePv5h_u4uri7Kjg5BrsqBLs6Bjl78DCwpiXmFKfyQmluBiU31xBnD93Ugvz41OKCxOTUvNSSeK8AIwMDY0NLMyNLU0djohQBAMNOLeM</recordid><startdate>20030711</startdate><enddate>20030711</enddate><creator>BAKER WILLIAM EDWARD</creator><creator>VANGATI NARENDER R</creator><creator>MCDANIEL BETTY A</creator><creator>KIRK JAMES T</creator><creator>CALLE MAURICIO</creator><scope>EVB</scope></search><sort><creationdate>20030711</creationdate><title>METHOD FOR IMPROVING LOOKUP PERFORMANCE OF TREE-TYPE KNOWLEDGE BASE SEARCH</title><author>BAKER WILLIAM EDWARD ; VANGATI NARENDER R ; MCDANIEL BETTY A ; KIRK JAMES T ; CALLE MAURICIO</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_JP2003196295A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2003</creationdate><topic>CALCULATING</topic><topic>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>BAKER WILLIAM EDWARD</creatorcontrib><creatorcontrib>VANGATI NARENDER R</creatorcontrib><creatorcontrib>MCDANIEL BETTY A</creatorcontrib><creatorcontrib>KIRK JAMES T</creatorcontrib><creatorcontrib>CALLE MAURICIO</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>BAKER WILLIAM EDWARD</au><au>VANGATI NARENDER R</au><au>MCDANIEL BETTY A</au><au>KIRK JAMES T</au><au>CALLE MAURICIO</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>METHOD FOR IMPROVING LOOKUP PERFORMANCE OF TREE-TYPE KNOWLEDGE BASE SEARCH</title><date>2003-07-11</date><risdate>2003</risdate><abstract>PROBLEM TO BE SOLVED: To provide the lookup performance of a tree-type knowledge base search. SOLUTION: A decision tree representing a knowledge base is segmented into at least two decision tree portions. The lower portion includes the tree entry point, and is stored in a memory element with a faster access time than the upper portion including the terminating element of the decision tree. Therefore, during the process of reading the tree entries for comparing them with the search object, the search entries in the lower portion of the tree can be read faster than the search entries in the upper portion, and as a result, a faster traversal through the entire decision tree can be realized. COPYRIGHT: (C)2003,JPO</abstract><edition>7</edition><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_JP2003196295A
source esp@cenet
subjects CALCULATING
COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title METHOD FOR IMPROVING LOOKUP PERFORMANCE OF TREE-TYPE KNOWLEDGE BASE SEARCH
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T19%3A46%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=BAKER%20WILLIAM%20EDWARD&rft.date=2003-07-11&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EJP2003196295A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true