dc.contributor.author |
HATZOPOULOS, M |
en |
dc.contributor.author |
KOLLIAS, JG |
en |
dc.date.accessioned |
2014-03-01T01:06:18Z |
|
dc.date.available |
2014-03-01T01:06:18Z |
|
dc.date.issued |
1984 |
en |
dc.identifier.issn |
0098-5589 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/9299 |
|
dc.subject |
Dynamic Programming Algorithm |
en |
dc.subject |
Indexation |
en |
dc.subject |
Optimal Algorithm |
en |
dc.subject |
Optimization Model |
en |
dc.subject |
Performance Optimization |
en |
dc.subject |
Physical Database Design |
en |
dc.subject |
Quantitative Evaluation |
en |
dc.subject |
Satisfiability |
en |
dc.subject |
Index Selection Problem |
en |
dc.subject.classification |
Computer Science, Software Engineering |
en |
dc.subject.classification |
Engineering, Electrical & Electronic |
en |
dc.title |
ON THE OPTIMAL SELECTION OF MULTILIST DATABASE STRUCTURES |
en |
heal.type |
journalArticle |
en |
heal.identifier.primary |
10.1109/TSE.1984.5010296 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1109/TSE.1984.5010296 |
en |
heal.language |
English |
en |
heal.publicationDate |
1984 |
en |
heal.abstract |
The optimal selection of secondary indexes asks for the quantitative evaluation of the performance of a number of candidate secondary indexes in order to determine the particular combination of indexes which satisfies the anticipated user transactions at a minimal cost. Previous studies determine the optimal selection by assuming that the cost of satisfying a query using a secondary index is |
en |
heal.publisher |
IEEE COMPUTER SOC |
en |
heal.journalName |
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING |
en |
dc.identifier.doi |
10.1109/TSE.1984.5010296 |
en |
dc.identifier.isi |
ISI:A1984TV46900007 |
en |
dc.identifier.volume |
10 |
en |
dc.identifier.issue |
6 |
en |
dc.identifier.spage |
681 |
en |
dc.identifier.epage |
687 |
en |