Horn clause transformation by restrictor in deductive databases:
Abstract: "Several methods have been proposed to improve the performance of bottom-up evaluation by query transformation (or rule rewriting) in the deductive database field. One way to realize this improvement is to introduce new predicates such as magic predicates to be used as filters. This i...
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1988
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
407 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Several methods have been proposed to improve the performance of bottom-up evaluation by query transformation (or rule rewriting) in the deductive database field. One way to realize this improvement is to introduce new predicates such as magic predicates to be used as filters. This is considered as one of the most promising ways to realize efficient query processing. Most algorithms in this category are formulated based on the procedural semantics of the top-down evaluation, and their logical meaning is difficult to recognize. This paper proposes a method called Horn clause transformation by restrictor (HCT/R) based on the declarative semantics. HCT/R is formulated as an equivalent transformation that maps the least Herbrand model to a smaller model It is most general in this category and can be considered as a logical foundation of methods in this category. Optimization of this transformation is also discussed and an optimal algorithm is proposed. |
| Beschreibung: | 26 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010946435 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960912s1988 |||| 00||| engod | ||
| 035 | |a (OCoLC)21185126 | ||
| 035 | |a (DE-599)BVBBV010946435 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 245 | 1 | 0 | |a Horn clause transformation by restrictor in deductive databases |c by N. Miyazaki ... |
| 264 | 1 | |a Tokyo, Japan |c 1988 | |
| 300 | |a 26 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 407 | |
| 520 | 3 | |a Abstract: "Several methods have been proposed to improve the performance of bottom-up evaluation by query transformation (or rule rewriting) in the deductive database field. One way to realize this improvement is to introduce new predicates such as magic predicates to be used as filters. This is considered as one of the most promising ways to realize efficient query processing. Most algorithms in this category are formulated based on the procedural semantics of the top-down evaluation, and their logical meaning is difficult to recognize. This paper proposes a method called Horn clause transformation by restrictor (HCT/R) based on the declarative semantics. HCT/R is formulated as an equivalent transformation that maps the least Herbrand model to a smaller model | |
| 520 | 3 | |a It is most general in this category and can be considered as a logical foundation of methods in this category. Optimization of this transformation is also discussed and an optimal algorithm is proposed. | |
| 650 | 4 | |a Deductive databases | |
| 650 | 4 | |a Horn clauses | |
| 700 | 1 | |a Miyazaki, Nobuyoshi |e Sonstige |4 oth | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 407 |w (DE-604)BV010923438 |9 407 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007320747 | ||
Datensatz im Suchindex
| _version_ | 1804125432938758144 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV010946435 |
| ctrlnum | (OCoLC)21185126 (DE-599)BVBBV010946435 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01960nam a2200313 cb4500</leader><controlfield tag="001">BV010946435</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960912s1988 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)21185126</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010946435</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Horn clause transformation by restrictor in deductive databases</subfield><subfield code="c">by N. Miyazaki ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">26 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">407</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Several methods have been proposed to improve the performance of bottom-up evaluation by query transformation (or rule rewriting) in the deductive database field. One way to realize this improvement is to introduce new predicates such as magic predicates to be used as filters. This is considered as one of the most promising ways to realize efficient query processing. Most algorithms in this category are formulated based on the procedural semantics of the top-down evaluation, and their logical meaning is difficult to recognize. This paper proposes a method called Horn clause transformation by restrictor (HCT/R) based on the declarative semantics. HCT/R is formulated as an equivalent transformation that maps the least Herbrand model to a smaller model</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">It is most general in this category and can be considered as a logical foundation of methods in this category. Optimization of this transformation is also discussed and an optimal algorithm is proposed.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Deductive databases</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Horn clauses</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Miyazaki, Nobuyoshi</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">407</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">407</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007320747</subfield></datafield></record></collection> |
| id | DE-604.BV010946435 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:28Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007320747 |
| oclc_num | 21185126 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 26 S. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| spelling | Horn clause transformation by restrictor in deductive databases by N. Miyazaki ... Tokyo, Japan 1988 26 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 407 Abstract: "Several methods have been proposed to improve the performance of bottom-up evaluation by query transformation (or rule rewriting) in the deductive database field. One way to realize this improvement is to introduce new predicates such as magic predicates to be used as filters. This is considered as one of the most promising ways to realize efficient query processing. Most algorithms in this category are formulated based on the procedural semantics of the top-down evaluation, and their logical meaning is difficult to recognize. This paper proposes a method called Horn clause transformation by restrictor (HCT/R) based on the declarative semantics. HCT/R is formulated as an equivalent transformation that maps the least Herbrand model to a smaller model It is most general in this category and can be considered as a logical foundation of methods in this category. Optimization of this transformation is also discussed and an optimal algorithm is proposed. Deductive databases Horn clauses Miyazaki, Nobuyoshi Sonstige oth Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 407 (DE-604)BV010923438 407 |
| spellingShingle | Horn clause transformation by restrictor in deductive databases Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Deductive databases Horn clauses |
| title | Horn clause transformation by restrictor in deductive databases |
| title_auth | Horn clause transformation by restrictor in deductive databases |
| title_exact_search | Horn clause transformation by restrictor in deductive databases |
| title_full | Horn clause transformation by restrictor in deductive databases by N. Miyazaki ... |
| title_fullStr | Horn clause transformation by restrictor in deductive databases by N. Miyazaki ... |
| title_full_unstemmed | Horn clause transformation by restrictor in deductive databases by N. Miyazaki ... |
| title_short | Horn clause transformation by restrictor in deductive databases |
| title_sort | horn clause transformation by restrictor in deductive databases |
| topic | Deductive databases Horn clauses |
| topic_facet | Deductive databases Horn clauses |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT miyazakinobuyoshi hornclausetransformationbyrestrictorindeductivedatabases |