Index selection in a self-adaptive relational data base management system:
The development of large integrated data bases that support a variety of applications in an enterprise promises to be one of the most important data processing activities of the next decade. The effective utilization of such a data bases depends on the ability of data base management systems to cope...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1976
|
| Schlagworte: | |
| Zusammenfassung: | The development of large integrated data bases that support a variety of applications in an enterprise promises to be one of the most important data processing activities of the next decade. The effective utilization of such a data bases depends on the ability of data base management systems to cope with the evolution of data base applications. In this thesis, we attempt to develop a methodology for monitoring the developing pattern of access to a data base and for choosing near-optimal physical data base organizations based on the evidenced mode of use. More specifically, we consider the problem of adaptively selecting the set of secondary indices to be maintained in an integrated relational data base. Stress is placed on the acquisition of an accurate usage model and on the precise estimation of data base characteristics, through the use of access monitoring and the application of forecasting and smoothing techniques. |
| Beschreibung: | Zugl.: Diss., 1976 |
| Beschreibung: | 96 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021879001 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t | ||
| 008 | 880707s1976 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227441877 | ||
| 035 | |a (DE-599)BVBBV021879001 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TR-166 | ||
| 100 | 1 | |a Chan, Arvola Y. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Index selection in a self-adaptive relational data base management system |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1976 | |
| 300 | |a 96 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Zugl.: Diss., 1976 | ||
| 520 | 3 | |a The development of large integrated data bases that support a variety of applications in an enterprise promises to be one of the most important data processing activities of the next decade. The effective utilization of such a data bases depends on the ability of data base management systems to cope with the evolution of data base applications. In this thesis, we attempt to develop a methodology for monitoring the developing pattern of access to a data base and for choosing near-optimal physical data base organizations based on the evidenced mode of use. More specifically, we consider the problem of adaptively selecting the set of secondary indices to be maintained in an integrated relational data base. Stress is placed on the acquisition of an accurate usage model and on the precise estimation of data base characteristics, through the use of access monitoring and the application of forecasting and smoothing techniques. | |
| 650 | 7 | |a Adaptive systems |2 dtict | |
| 650 | 7 | |a Administration and Management |2 scgdst | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Cost analysis |2 dtict | |
| 650 | 7 | |a Data bases |2 dtict | |
| 650 | 7 | |a Data management |2 dtict | |
| 650 | 7 | |a Forecasting |2 dtict | |
| 650 | 7 | |a Heuristic methods |2 dtict | |
| 650 | 7 | |a Optimization |2 dtict | |
| 650 | 7 | |a Self organizing systems |2 dtict | |
| 650 | 0 | 7 | |a Automatische Indexierung |0 (DE-588)4136002-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenbanksystem |0 (DE-588)4113276-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Datenbanksystem |0 (DE-588)4113276-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Automatische Indexierung |0 (DE-588)4136002-3 |D s |
| 689 | 1 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015094490 | ||
Datensatz im Suchindex
| _version_ | 1804135818971840512 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Chan, Arvola Y. |
| author_facet | Chan, Arvola Y. |
| author_role | aut |
| author_sort | Chan, Arvola Y. |
| author_variant | a y c ay ayc |
| building | Verbundindex |
| bvnumber | BV021879001 |
| ctrlnum | (OCoLC)227441877 (DE-599)BVBBV021879001 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02428nam a2200469zc 4500</leader><controlfield tag="001">BV021879001</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880707s1976 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227441877</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021879001</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-166</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chan, Arvola Y.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Index selection in a self-adaptive relational data base management 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">1976</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">96 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.: Diss., 1976</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The development of large integrated data bases that support a variety of applications in an enterprise promises to be one of the most important data processing activities of the next decade. The effective utilization of such a data bases depends on the ability of data base management systems to cope with the evolution of data base applications. In this thesis, we attempt to develop a methodology for monitoring the developing pattern of access to a data base and for choosing near-optimal physical data base organizations based on the evidenced mode of use. More specifically, we consider the problem of adaptively selecting the set of secondary indices to be maintained in an integrated relational data base. Stress is placed on the acquisition of an accurate usage model and on the precise estimation of data base characteristics, through the use of access monitoring and the application of forecasting and smoothing techniques.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Adaptive systems</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Administration and Management</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Cost analysis</subfield><subfield code="2">dtict</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">Forecasting</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">Optimization</subfield><subfield code="2">dtict</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">Automatische Indexierung</subfield><subfield code="0">(DE-588)4136002-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenbanksystem</subfield><subfield code="0">(DE-588)4113276-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Datenbanksystem</subfield><subfield code="0">(DE-588)4113276-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Automatische Indexierung</subfield><subfield code="0">(DE-588)4136002-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015094490</subfield></datafield></record></collection> |
| id | DE-604.BV021879001 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:41Z |
| indexdate | 2024-07-09T20:46:33Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015094490 |
| oclc_num | 227441877 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 96 S. |
| publishDate | 1976 |
| publishDateSearch | 1976 |
| publishDateSort | 1976 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Chan, Arvola Y. Verfasser aut Index selection in a self-adaptive relational data base management system Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1976 96 S. txt rdacontent n rdamedia nc rdacarrier Zugl.: Diss., 1976 The development of large integrated data bases that support a variety of applications in an enterprise promises to be one of the most important data processing activities of the next decade. The effective utilization of such a data bases depends on the ability of data base management systems to cope with the evolution of data base applications. In this thesis, we attempt to develop a methodology for monitoring the developing pattern of access to a data base and for choosing near-optimal physical data base organizations based on the evidenced mode of use. More specifically, we consider the problem of adaptively selecting the set of secondary indices to be maintained in an integrated relational data base. Stress is placed on the acquisition of an accurate usage model and on the precise estimation of data base characteristics, through the use of access monitoring and the application of forecasting and smoothing techniques. Adaptive systems dtict Administration and Management scgdst Algorithms dtict Cost analysis dtict Data bases dtict Data management dtict Forecasting dtict Heuristic methods dtict Optimization dtict Self organizing systems dtict Automatische Indexierung (DE-588)4136002-3 gnd rswk-swf Datenbanksystem (DE-588)4113276-2 gnd rswk-swf Datenbanksystem (DE-588)4113276-2 s DE-604 Automatische Indexierung (DE-588)4136002-3 s |
| spellingShingle | Chan, Arvola Y. Index selection in a self-adaptive relational data base management system Adaptive systems dtict Administration and Management scgdst Algorithms dtict Cost analysis dtict Data bases dtict Data management dtict Forecasting dtict Heuristic methods dtict Optimization dtict Self organizing systems dtict Automatische Indexierung (DE-588)4136002-3 gnd Datenbanksystem (DE-588)4113276-2 gnd |
| subject_GND | (DE-588)4136002-3 (DE-588)4113276-2 |
| title | Index selection in a self-adaptive relational data base management system |
| title_auth | Index selection in a self-adaptive relational data base management system |
| title_exact_search | Index selection in a self-adaptive relational data base management system |
| title_exact_search_txtP | Index selection in a self-adaptive relational data base management system |
| title_full | Index selection in a self-adaptive relational data base management system |
| title_fullStr | Index selection in a self-adaptive relational data base management system |
| title_full_unstemmed | Index selection in a self-adaptive relational data base management system |
| title_short | Index selection in a self-adaptive relational data base management system |
| title_sort | index selection in a self adaptive relational data base management system |
| topic | Adaptive systems dtict Administration and Management scgdst Algorithms dtict Cost analysis dtict Data bases dtict Data management dtict Forecasting dtict Heuristic methods dtict Optimization dtict Self organizing systems dtict Automatische Indexierung (DE-588)4136002-3 gnd Datenbanksystem (DE-588)4113276-2 gnd |
| topic_facet | Adaptive systems Administration and Management Algorithms Cost analysis Data bases Data management Forecasting Heuristic methods Optimization Self organizing systems Automatische Indexierung Datenbanksystem |
| work_keys_str_mv | AT chanarvolay indexselectioninaselfadaptiverelationaldatabasemanagementsystem |