Selection propagation in deductive databaes: from pushing selections to magic sets
Abstract: "This paper discusses the relationship between two optimization methods in deductive databases: the distribution of selections and the magic sets method. The former is a direct generalization of pushing selections in relational databases and the latter realizes a more general view of...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1990
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
538 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper discusses the relationship between two optimization methods in deductive databases: the distribution of selections and the magic sets method. The former is a direct generalization of pushing selections in relational databases and the latter realizes a more general view of selection propagation. Characteristics of the generalized form of the distribution of selections are discussed and compared to other methods. It is shown that the distribution of selections corresponds to one of the least effective variations of the magic sets method. It is also shown that both methods have essentially the same power for non-recursive queries Hence, the magic sets method can be regarded as a natural generalization of pushing selections in relational databases. |
| Beschreibung: | 26 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010949042 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960913s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)24838939 | ||
| 035 | |a (DE-599)BVBBV010949042 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Miyazaki, Nobuyuki |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Selection propagation in deductive databaes |b from pushing selections to magic sets |c N. Miyazaki |
| 264 | 1 | |a Tokyo, Japan |c 1990 | |
| 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 538 | |
| 520 | 3 | |a Abstract: "This paper discusses the relationship between two optimization methods in deductive databases: the distribution of selections and the magic sets method. The former is a direct generalization of pushing selections in relational databases and the latter realizes a more general view of selection propagation. Characteristics of the generalized form of the distribution of selections are discussed and compared to other methods. It is shown that the distribution of selections corresponds to one of the least effective variations of the magic sets method. It is also shown that both methods have essentially the same power for non-recursive queries | |
| 520 | 3 | |a Hence, the magic sets method can be regarded as a natural generalization of pushing selections in relational databases. | |
| 650 | 4 | |a Deductive databases | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Relational databases | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 538 |w (DE-604)BV010923438 |9 538 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007322996 | ||
Datensatz im Suchindex
| _version_ | 1804125435973337088 |
|---|---|
| any_adam_object | |
| author | Miyazaki, Nobuyuki |
| author_facet | Miyazaki, Nobuyuki |
| author_role | aut |
| author_sort | Miyazaki, Nobuyuki |
| author_variant | n m nm |
| building | Verbundindex |
| bvnumber | BV010949042 |
| ctrlnum | (OCoLC)24838939 (DE-599)BVBBV010949042 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01825nam a2200325 cb4500</leader><controlfield tag="001">BV010949042</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960913s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24838939</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010949042</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="100" ind1="1" ind2=" "><subfield code="a">Miyazaki, Nobuyuki</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Selection propagation in deductive databaes</subfield><subfield code="b">from pushing selections to magic sets</subfield><subfield code="c">N. Miyazaki</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1990</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">538</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper discusses the relationship between two optimization methods in deductive databases: the distribution of selections and the magic sets method. The former is a direct generalization of pushing selections in relational databases and the latter realizes a more general view of selection propagation. Characteristics of the generalized form of the distribution of selections are discussed and compared to other methods. It is shown that the distribution of selections corresponds to one of the least effective variations of the magic sets method. It is also shown that both methods have essentially the same power for non-recursive queries</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Hence, the magic sets method can be regarded as a natural generalization of pushing selections in relational databases.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Deductive databases</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Relational databases</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">538</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">538</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007322996</subfield></datafield></record></collection> |
| id | DE-604.BV010949042 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:31Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007322996 |
| oclc_num | 24838939 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 26 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| 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 | Miyazaki, Nobuyuki Verfasser aut Selection propagation in deductive databaes from pushing selections to magic sets N. Miyazaki Tokyo, Japan 1990 26 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 538 Abstract: "This paper discusses the relationship between two optimization methods in deductive databases: the distribution of selections and the magic sets method. The former is a direct generalization of pushing selections in relational databases and the latter realizes a more general view of selection propagation. Characteristics of the generalized form of the distribution of selections are discussed and compared to other methods. It is shown that the distribution of selections corresponds to one of the least effective variations of the magic sets method. It is also shown that both methods have essentially the same power for non-recursive queries Hence, the magic sets method can be regarded as a natural generalization of pushing selections in relational databases. Deductive databases Mathematical optimization Relational databases Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 538 (DE-604)BV010923438 538 |
| spellingShingle | Miyazaki, Nobuyuki Selection propagation in deductive databaes from pushing selections to magic sets Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Deductive databases Mathematical optimization Relational databases |
| title | Selection propagation in deductive databaes from pushing selections to magic sets |
| title_auth | Selection propagation in deductive databaes from pushing selections to magic sets |
| title_exact_search | Selection propagation in deductive databaes from pushing selections to magic sets |
| title_full | Selection propagation in deductive databaes from pushing selections to magic sets N. Miyazaki |
| title_fullStr | Selection propagation in deductive databaes from pushing selections to magic sets N. Miyazaki |
| title_full_unstemmed | Selection propagation in deductive databaes from pushing selections to magic sets N. Miyazaki |
| title_short | Selection propagation in deductive databaes |
| title_sort | selection propagation in deductive databaes from pushing selections to magic sets |
| title_sub | from pushing selections to magic sets |
| topic | Deductive databases Mathematical optimization Relational databases |
| topic_facet | Deductive databases Mathematical optimization Relational databases |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT miyazakinobuyuki selectionpropagationindeductivedatabaesfrompushingselectionstomagicsets |