Resolving the query inference problem using Steiner trees
The query inference problem is to translate a sentence of a query language into an unambiguous representation of a query. A query is represented as an expression over a set of query trees. A metric is introduced for measuring the complexity of a query and also a proposal that a sentence be translate...
Gespeichert in:
| Veröffentlicht in: | ACM transactions on database systems 1984-09, Vol.9 (3), p.348-368 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 368 |
|---|---|
| container_issue | 3 |
| container_start_page | 348 |
| container_title | ACM transactions on database systems |
| container_volume | 9 |
| creator | Wald, Joseph A. Sorenson, Paul G. |
| description | The query inference problem is to translate a sentence of a query language into an unambiguous representation of a query. A query is represented as an expression over a set of query trees. A metric is introduced for measuring the complexity of a query and also a proposal that a sentence be translated into the least complex query which "satisfies" the sentence. This method of query inference can be used to resolve ambiguous sentences and leads to easier formulation of sentences. |
| doi_str_mv | 10.1145/1270.1275 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29028974</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>24382867</sourcerecordid><originalsourceid>FETCH-LOGICAL-a369t-18f3d1ef006838e8c0c31332a09fb0f254c4286f79e83f9d4657dd2414b0c7133</originalsourceid><addsrcrecordid>eNqFkLtLBDEQxoMoeJ4WVrZbiGCxOnltklIOX3Ag-KiXXHaiK_s4k13h_nuz3KGlzcwUv_nmm4-QUwpXlAp5TZlKE1Nyj8yolCoXhRD7ZAa8YLk0VB6Soxg_AUBoo2bEPGPsm--6e8-GD8y-RgybrO48BuwcZuvQrxpsszFOxMuAdYchGwJiPCYH3jYRT3Z9Tt7ubl8XD_ny6f5xcbPMLS_MkFPteUXRAxSaa9QOHKecMwvGr8AzKZxguvDKoObeVKKQqqqYoGIFTiVyTi62uslLsheHsq2jw6axHfZjLJkBll4R_4OC63RJJfByC7rQxxjQl-tQtzZsSgrllGI5pTgVmdjznaiNzjY-2M7V8XfBUArcTCbPtph17Z_aJPADIc921g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>24382867</pqid></control><display><type>article</type><title>Resolving the query inference problem using Steiner trees</title><source>ACM Digital Library Complete</source><creator>Wald, Joseph A. ; Sorenson, Paul G.</creator><creatorcontrib>Wald, Joseph A. ; Sorenson, Paul G.</creatorcontrib><description>The query inference problem is to translate a sentence of a query language into an unambiguous representation of a query. A query is represented as an expression over a set of query trees. A metric is introduced for measuring the complexity of a query and also a proposal that a sentence be translated into the least complex query which "satisfies" the sentence. This method of query inference can be used to resolve ambiguous sentences and leads to easier formulation of sentences.</description><identifier>ISSN: 0362-5915</identifier><identifier>EISSN: 1557-4644</identifier><identifier>DOI: 10.1145/1270.1275</identifier><identifier>CODEN: ATDSD3</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Data management systems ; Database management system engines ; Database query processing ; Database query processing and optimization (theory) ; Database theory ; Database transaction processing ; Discrete mathematics ; Exact sciences and technology ; Graph algorithms ; Graph theory ; Hardware ; Information retrieval ; Information retrieval query processing ; Information systems ; Information systems. Data bases ; Integrated circuits ; Mathematics of computing ; Memory organisation. Data processing ; Query languages ; Semiconductor memory ; Software ; Theory and algorithms for application domains ; Theory of computation ; Trees</subject><ispartof>ACM transactions on database systems, 1984-09, Vol.9 (3), p.348-368</ispartof><rights>ACM</rights><rights>1985 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-a369t-18f3d1ef006838e8c0c31332a09fb0f254c4286f79e83f9d4657dd2414b0c7133</citedby><cites>FETCH-LOGICAL-a369t-18f3d1ef006838e8c0c31332a09fb0f254c4286f79e83f9d4657dd2414b0c7133</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://dl.acm.org/doi/pdf/10.1145/1270.1275$$EPDF$$P50$$Gacm$$H</linktopdf><link.rule.ids>314,777,781,2276,27905,27906,40177,75977</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=9110393$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Wald, Joseph A.</creatorcontrib><creatorcontrib>Sorenson, Paul G.</creatorcontrib><title>Resolving the query inference problem using Steiner trees</title><title>ACM transactions on database systems</title><addtitle>ACM TODS</addtitle><description>The query inference problem is to translate a sentence of a query language into an unambiguous representation of a query. A query is represented as an expression over a set of query trees. A metric is introduced for measuring the complexity of a query and also a proposal that a sentence be translated into the least complex query which "satisfies" the sentence. This method of query inference can be used to resolve ambiguous sentences and leads to easier formulation of sentences.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Data management systems</subject><subject>Database management system engines</subject><subject>Database query processing</subject><subject>Database query processing and optimization (theory)</subject><subject>Database theory</subject><subject>Database transaction processing</subject><subject>Discrete mathematics</subject><subject>Exact sciences and technology</subject><subject>Graph algorithms</subject><subject>Graph theory</subject><subject>Hardware</subject><subject>Information retrieval</subject><subject>Information retrieval query processing</subject><subject>Information systems</subject><subject>Information systems. Data bases</subject><subject>Integrated circuits</subject><subject>Mathematics of computing</subject><subject>Memory organisation. Data processing</subject><subject>Query languages</subject><subject>Semiconductor memory</subject><subject>Software</subject><subject>Theory and algorithms for application domains</subject><subject>Theory of computation</subject><subject>Trees</subject><issn>0362-5915</issn><issn>1557-4644</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1984</creationdate><recordtype>article</recordtype><recordid>eNqFkLtLBDEQxoMoeJ4WVrZbiGCxOnltklIOX3Ag-KiXXHaiK_s4k13h_nuz3KGlzcwUv_nmm4-QUwpXlAp5TZlKE1Nyj8yolCoXhRD7ZAa8YLk0VB6Soxg_AUBoo2bEPGPsm--6e8-GD8y-RgybrO48BuwcZuvQrxpsszFOxMuAdYchGwJiPCYH3jYRT3Z9Tt7ubl8XD_ny6f5xcbPMLS_MkFPteUXRAxSaa9QOHKecMwvGr8AzKZxguvDKoObeVKKQqqqYoGIFTiVyTi62uslLsheHsq2jw6axHfZjLJkBll4R_4OC63RJJfByC7rQxxjQl-tQtzZsSgrllGI5pTgVmdjznaiNzjY-2M7V8XfBUArcTCbPtph17Z_aJPADIc921g</recordid><startdate>19840901</startdate><enddate>19840901</enddate><creator>Wald, Joseph A.</creator><creator>Sorenson, Paul G.</creator><general>ACM</general><general>Association for Computing Machinery</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19840901</creationdate><title>Resolving the query inference problem using Steiner trees</title><author>Wald, Joseph A. ; Sorenson, Paul G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a369t-18f3d1ef006838e8c0c31332a09fb0f254c4286f79e83f9d4657dd2414b0c7133</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1984</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Data management systems</topic><topic>Database management system engines</topic><topic>Database query processing</topic><topic>Database query processing and optimization (theory)</topic><topic>Database theory</topic><topic>Database transaction processing</topic><topic>Discrete mathematics</topic><topic>Exact sciences and technology</topic><topic>Graph algorithms</topic><topic>Graph theory</topic><topic>Hardware</topic><topic>Information retrieval</topic><topic>Information retrieval query processing</topic><topic>Information systems</topic><topic>Information systems. Data bases</topic><topic>Integrated circuits</topic><topic>Mathematics of computing</topic><topic>Memory organisation. Data processing</topic><topic>Query languages</topic><topic>Semiconductor memory</topic><topic>Software</topic><topic>Theory and algorithms for application domains</topic><topic>Theory of computation</topic><topic>Trees</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wald, Joseph A.</creatorcontrib><creatorcontrib>Sorenson, Paul G.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>ACM transactions on database systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wald, Joseph A.</au><au>Sorenson, Paul G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Resolving the query inference problem using Steiner trees</atitle><jtitle>ACM transactions on database systems</jtitle><stitle>ACM TODS</stitle><date>1984-09-01</date><risdate>1984</risdate><volume>9</volume><issue>3</issue><spage>348</spage><epage>368</epage><pages>348-368</pages><issn>0362-5915</issn><eissn>1557-4644</eissn><coden>ATDSD3</coden><abstract>The query inference problem is to translate a sentence of a query language into an unambiguous representation of a query. A query is represented as an expression over a set of query trees. A metric is introduced for measuring the complexity of a query and also a proposal that a sentence be translated into the least complex query which "satisfies" the sentence. This method of query inference can be used to resolve ambiguous sentences and leads to easier formulation of sentences.</abstract><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/1270.1275</doi><tpages>21</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0362-5915 |
| ispartof | ACM transactions on database systems, 1984-09, Vol.9 (3), p.348-368 |
| issn | 0362-5915 1557-4644 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_29028974 |
| source | ACM Digital Library Complete |
| subjects | Applied sciences Computer science control theory systems Data management systems Database management system engines Database query processing Database query processing and optimization (theory) Database theory Database transaction processing Discrete mathematics Exact sciences and technology Graph algorithms Graph theory Hardware Information retrieval Information retrieval query processing Information systems Information systems. Data bases Integrated circuits Mathematics of computing Memory organisation. Data processing Query languages Semiconductor memory Software Theory and algorithms for application domains Theory of computation Trees |
| title | Resolving the query inference problem using Steiner trees |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T07%3A37%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=Resolving%20the%20query%20inference%20problem%20using%20Steiner%20trees&rft.jtitle=ACM%20transactions%20on%20database%20systems&rft.au=Wald,%20Joseph%20A.&rft.date=1984-09-01&rft.volume=9&rft.issue=3&rft.spage=348&rft.epage=368&rft.pages=348-368&rft.issn=0362-5915&rft.eissn=1557-4644&rft.coden=ATDSD3&rft_id=info:doi/10.1145/1270.1275&rft_dat=%3Cproquest_cross%3E24382867%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=24382867&rft_id=info:pmid/&rfr_iscdi=true |