Detecting redundant tuples during query evaluation:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Stanford, Calif.
Department of Computer Science, Stanford Univ.
1992
|
| Schlagwörter: | |
| Abstract: | Abstract: "While the relational query languages are declarative, they have been found to have inadequate expressive power. The query language Datalog extends the querying abilities of the relational languages. The bottom-up evaluation techniques have been developed to compute datalog queries. During bottom-up evaluation of a datalog query, many tuples become redundant, i.e., they are no longer needed for the remainder of the evaluation. The detection of redundant tuples can be useful for enhancing concurrency and memory utilization. In this thesis, we provide a framework for detecting redundant tuples during bottom-up evaluation of datalog queries. |
| Beschreibung: | Zugl.: Stanford, Calif., Univ., Diss., 1992 |
| Umfang: | XI, 219 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV006149311 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 930107s1992 xx m||| 00||| eng d | ||
| 035 | |a (OCoLC)38162670 | ||
| 035 | |a (DE-599)BVBBV006149311 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 050 | 0 | |a QA76.7 | |
| 084 | |a DAT 652d |2 stub | ||
| 088 | |a STAN CS 92 1433 | ||
| 100 | 1 | |a Chaudhuri, Surajit |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Detecting redundant tuples during query evaluation |c by Surajit Chaudhuri |
| 246 | 1 | 3 | |a STAN CS 92 1433 |
| 264 | 1 | |a Stanford, Calif. |b Department of Computer Science, Stanford Univ. |c 1992 | |
| 300 | |a XI, 219 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Zugl.: Stanford, Calif., Univ., Diss., 1992 | ||
| 520 | 3 | |a Abstract: "While the relational query languages are declarative, they have been found to have inadequate expressive power. The query language Datalog extends the querying abilities of the relational languages. The bottom-up evaluation techniques have been developed to compute datalog queries. During bottom-up evaluation of a datalog query, many tuples become redundant, i.e., they are no longer needed for the remainder of the evaluation. The detection of redundant tuples can be useful for enhancing concurrency and memory utilization. In this thesis, we provide a framework for detecting redundant tuples during bottom-up evaluation of datalog queries. | |
| 650 | 4 | |a Query languages (Computer science) | |
| 650 | 4 | |a Relational databases | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-003888429 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6115-1433 |
|---|---|
| DE-BY-TUM_katkey | 577438 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010650389 |
| _version_ | 1821938427067629568 |
| any_adam_object | |
| author | Chaudhuri, Surajit |
| author_facet | Chaudhuri, Surajit |
| author_role | aut |
| author_sort | Chaudhuri, Surajit |
| author_variant | s c sc |
| building | Verbundindex |
| bvnumber | BV006149311 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.7 |
| callnumber-search | QA76.7 |
| callnumber-sort | QA 276.7 |
| callnumber-subject | QA - Mathematics |
| classification_tum | DAT 652d |
| ctrlnum | (OCoLC)38162670 (DE-599)BVBBV006149311 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01718nam a2200349 c 4500</leader><controlfield tag="001">BV006149311</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">930107s1992 xx m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38162670</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006149311</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="050" ind1=" " ind2="0"><subfield code="a">QA76.7</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 652d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">STAN CS 92 1433</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chaudhuri, Surajit</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Detecting redundant tuples during query evaluation</subfield><subfield code="c">by Surajit Chaudhuri</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">STAN CS 92 1433</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="b">Department of Computer Science, Stanford Univ.</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 219 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="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Stanford, Calif., Univ., Diss., 1992</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "While the relational query languages are declarative, they have been found to have inadequate expressive power. The query language Datalog extends the querying abilities of the relational languages. The bottom-up evaluation techniques have been developed to compute datalog queries. During bottom-up evaluation of a datalog query, many tuples become redundant, i.e., they are no longer needed for the remainder of the evaluation. The detection of redundant tuples can be useful for enhancing concurrency and memory utilization. In this thesis, we provide a framework for detecting redundant tuples during bottom-up evaluation of datalog queries.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Query languages (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Relational databases</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003888429</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV006149311 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T08:44:12Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003888429 |
| oclc_num | 38162670 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | XI, 219 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Department of Computer Science, Stanford Univ. |
| record_format | marc |
| spellingShingle | Chaudhuri, Surajit Detecting redundant tuples during query evaluation Query languages (Computer science) Relational databases |
| subject_GND | (DE-588)4113937-9 |
| title | Detecting redundant tuples during query evaluation |
| title_alt | STAN CS 92 1433 |
| title_auth | Detecting redundant tuples during query evaluation |
| title_exact_search | Detecting redundant tuples during query evaluation |
| title_full | Detecting redundant tuples during query evaluation by Surajit Chaudhuri |
| title_fullStr | Detecting redundant tuples during query evaluation by Surajit Chaudhuri |
| title_full_unstemmed | Detecting redundant tuples during query evaluation by Surajit Chaudhuri |
| title_short | Detecting redundant tuples during query evaluation |
| title_sort | detecting redundant tuples during query evaluation |
| topic | Query languages (Computer science) Relational databases |
| topic_facet | Query languages (Computer science) Relational databases Hochschulschrift |
| work_keys_str_mv | AT chaudhurisurajit detectingredundanttuplesduringqueryevaluation AT chaudhurisurajit stancs921433 |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6115-1433 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |