Attribute partitioning in a self-adaptive relational database system:
One technique that is sometimes employed to enhance the performance of a database management system is known as attribute partitioning. This is the process of dividing the attributes of a file into subfiles that are stored separately. By storing together those attributes that are frequently requeste...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1978
|
| Schlagworte: | |
| Zusammenfassung: | One technique that is sometimes employed to enhance the performance of a database management system is known as attribute partitioning. This is the process of dividing the attributes of a file into subfiles that are stored separately. By storing together those attributes that are frequently requested together by transactions, and by separating those that are not, attribute partitioning can reduce the number of pages that must be transferred from secondary storage to primary memory in order to process a transaction. The goal of this work is to design mechanisms that can automatically select a near-optimal attribute partition of a file's attributes, based on the usage pattern of the file and on the characteristics of the data in the file. The approach taken to this problem is based on the use of a file design cost estimator and of heuristics to guide a search through the large space of possible partitions. The heuristics propose a small set of promising partitions to submit for detailed analysis. The estimator assigns a figure of merit to any proposed partition that reflects the cost that would be incurred in processing the transactions in the usage pattern if the file were partitioned in the proposed way. We have also conducted an extensive series of experiments with a variety of design heuristics; as a result, we have identified a heuristic that nearly always finds the optimal partition of a file. |
| Beschreibung: | Zugl.: Cambridge, Mass., Massachusetts Institute of Technology, Diss., 1978 |
| Beschreibung: | 157 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021879866 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t | ||
| 008 | 880811s1978 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227492235 | ||
| 035 | |a (DE-599)BVBBV021879866 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TR-192 | ||
| 100 | 1 | |a Niamir, Bahram |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Attribute partitioning in a self-adaptive relational database system |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1978 | |
| 300 | |a 157 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Zugl.: Cambridge, Mass., Massachusetts Institute of Technology, Diss., 1978 | ||
| 520 | 3 | |a One technique that is sometimes employed to enhance the performance of a database management system is known as attribute partitioning. This is the process of dividing the attributes of a file into subfiles that are stored separately. By storing together those attributes that are frequently requested together by transactions, and by separating those that are not, attribute partitioning can reduce the number of pages that must be transferred from secondary storage to primary memory in order to process a transaction. The goal of this work is to design mechanisms that can automatically select a near-optimal attribute partition of a file's attributes, based on the usage pattern of the file and on the characteristics of the data in the file. The approach taken to this problem is based on the use of a file design cost estimator and of heuristics to guide a search through the large space of possible partitions. The heuristics propose a small set of promising partitions to submit for detailed analysis. The estimator assigns a figure of merit to any proposed partition that reflects the cost that would be incurred in processing the transactions in the usage pattern if the file were partitioned in the proposed way. We have also conducted an extensive series of experiments with a variety of design heuristics; as a result, we have identified a heuristic that nearly always finds the optimal partition of a file. | |
| 650 | 7 | |a Data bases |2 dtict | |
| 650 | 7 | |a Data management |2 dtict | |
| 650 | 7 | |a Files(records) |2 dtict | |
| 650 | 7 | |a Heuristic methods |2 dtict | |
| 650 | 7 | |a Information Science |2 scgdst | |
| 650 | 7 | |a Numerical Mathematics |2 scgdst | |
| 650 | 7 | |a Self organizing systems |2 dtict | |
| 650 | 0 | 7 | |a Relationales Datenbanksystem |0 (DE-588)4130535-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Relationales Datenbanksystem |0 (DE-588)4130535-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015095324 | ||
Datensatz im Suchindex
| _version_ | 1804135820078088192 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Niamir, Bahram |
| author_facet | Niamir, Bahram |
| author_role | aut |
| author_sort | Niamir, Bahram |
| author_variant | b n bn |
| building | Verbundindex |
| bvnumber | BV021879866 |
| ctrlnum | (OCoLC)227492235 (DE-599)BVBBV021879866 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02724nam a2200397zc 4500</leader><controlfield tag="001">BV021879866</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880811s1978 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227492235</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021879866</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TR-192</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Niamir, Bahram</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Attribute partitioning in a self-adaptive relational database system</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1978</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">157 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.: Cambridge, Mass., Massachusetts Institute of Technology, Diss., 1978</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">One technique that is sometimes employed to enhance the performance of a database management system is known as attribute partitioning. This is the process of dividing the attributes of a file into subfiles that are stored separately. By storing together those attributes that are frequently requested together by transactions, and by separating those that are not, attribute partitioning can reduce the number of pages that must be transferred from secondary storage to primary memory in order to process a transaction. The goal of this work is to design mechanisms that can automatically select a near-optimal attribute partition of a file's attributes, based on the usage pattern of the file and on the characteristics of the data in the file. The approach taken to this problem is based on the use of a file design cost estimator and of heuristics to guide a search through the large space of possible partitions. The heuristics propose a small set of promising partitions to submit for detailed analysis. The estimator assigns a figure of merit to any proposed partition that reflects the cost that would be incurred in processing the transactions in the usage pattern if the file were partitioned in the proposed way. We have also conducted an extensive series of experiments with a variety of design heuristics; as a result, we have identified a heuristic that nearly always finds the optimal partition of a file.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data bases</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data management</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Files(records)</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Heuristic methods</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information Science</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Numerical Mathematics</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Self organizing systems</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Relationales Datenbanksystem</subfield><subfield code="0">(DE-588)4130535-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Relationales Datenbanksystem</subfield><subfield code="0">(DE-588)4130535-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015095324</subfield></datafield></record></collection> |
| id | DE-604.BV021879866 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:43Z |
| indexdate | 2024-07-09T20:46:34Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015095324 |
| oclc_num | 227492235 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 157 S. |
| publishDate | 1978 |
| publishDateSearch | 1978 |
| publishDateSort | 1978 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Niamir, Bahram Verfasser aut Attribute partitioning in a self-adaptive relational database system Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1978 157 S. txt rdacontent n rdamedia nc rdacarrier Zugl.: Cambridge, Mass., Massachusetts Institute of Technology, Diss., 1978 One technique that is sometimes employed to enhance the performance of a database management system is known as attribute partitioning. This is the process of dividing the attributes of a file into subfiles that are stored separately. By storing together those attributes that are frequently requested together by transactions, and by separating those that are not, attribute partitioning can reduce the number of pages that must be transferred from secondary storage to primary memory in order to process a transaction. The goal of this work is to design mechanisms that can automatically select a near-optimal attribute partition of a file's attributes, based on the usage pattern of the file and on the characteristics of the data in the file. The approach taken to this problem is based on the use of a file design cost estimator and of heuristics to guide a search through the large space of possible partitions. The heuristics propose a small set of promising partitions to submit for detailed analysis. The estimator assigns a figure of merit to any proposed partition that reflects the cost that would be incurred in processing the transactions in the usage pattern if the file were partitioned in the proposed way. We have also conducted an extensive series of experiments with a variety of design heuristics; as a result, we have identified a heuristic that nearly always finds the optimal partition of a file. Data bases dtict Data management dtict Files(records) dtict Heuristic methods dtict Information Science scgdst Numerical Mathematics scgdst Self organizing systems dtict Relationales Datenbanksystem (DE-588)4130535-8 gnd rswk-swf Relationales Datenbanksystem (DE-588)4130535-8 s DE-604 |
| spellingShingle | Niamir, Bahram Attribute partitioning in a self-adaptive relational database system Data bases dtict Data management dtict Files(records) dtict Heuristic methods dtict Information Science scgdst Numerical Mathematics scgdst Self organizing systems dtict Relationales Datenbanksystem (DE-588)4130535-8 gnd |
| subject_GND | (DE-588)4130535-8 |
| title | Attribute partitioning in a self-adaptive relational database system |
| title_auth | Attribute partitioning in a self-adaptive relational database system |
| title_exact_search | Attribute partitioning in a self-adaptive relational database system |
| title_exact_search_txtP | Attribute partitioning in a self-adaptive relational database system |
| title_full | Attribute partitioning in a self-adaptive relational database system |
| title_fullStr | Attribute partitioning in a self-adaptive relational database system |
| title_full_unstemmed | Attribute partitioning in a self-adaptive relational database system |
| title_short | Attribute partitioning in a self-adaptive relational database system |
| title_sort | attribute partitioning in a self adaptive relational database system |
| topic | Data bases dtict Data management dtict Files(records) dtict Heuristic methods dtict Information Science scgdst Numerical Mathematics scgdst Self organizing systems dtict Relationales Datenbanksystem (DE-588)4130535-8 gnd |
| topic_facet | Data bases Data management Files(records) Heuristic methods Information Science Numerical Mathematics Self organizing systems Relationales Datenbanksystem |
| work_keys_str_mv | AT niamirbahram attributepartitioninginaselfadaptiverelationaldatabasesystem |