Advanced Database Indexing (Advances in Database Systems) de Yannis Manolopoulos

Advanced Database Indexing: Advances in Database Systems, cartea 17

Yannis Manolopoulos

Yannis Theodoridis

Vassilis Tsotras

Advanced Database Indexing begins by introducing basic material on storage media, including magnetic disks, RAID systems and tertiary storage such as optical disk and tapes. Typical access methods (e.g. B⁺ trees, dynamic hash files and secondary key retrieval) are also introduced. The remainder of the book discusses recent advances in indexing and access methods for particular database applications. More specifically, issues such as external sorting, file structures for intervals, temporal access methods, spatial and spatio-temporal indexing, image and multimedia indexing, perfect external hashing methods, parallel access methods, concurrency issues in indexing and parallel external sorting are presented for the first time in a single book.
Advanced Database Indexing is an excellent reference for database professionals and may be used as a text for advanced courses on the topic.

Citește tot Restrânge

Toate formatele și edițiile

	Preț	Express
Paperback (1)	1222^.89 lei 6-8 săpt.
Springer Us – 5 sep 2012	1222^.89 lei 6-8 săpt.
Hardback (1)	1229^.88 lei 6-8 săpt.
Springer Us – 30 noi 1999	1229^.88 lei 6-8 săpt.

Din seria Advances in Database Systems

20%

Preț: 955^.45 lei
20%

Preț: 948^.32 lei
20%

Preț: 1220^.35 lei
20%

Preț: 942^.77 lei
20%

Preț: 945^.81 lei
20%

Preț: 956^.44 lei
18%

Preț: 911^.19 lei
20%

Preț: 952^.14 lei
20%

Preț: 947^.39 lei
20%

Preț: 1229^.88 lei
20%

Preț: 958^.50 lei
20%

Preț: 943^.43 lei
20%

Preț: 620^.07 lei
20%

Preț: 946^.45 lei
20%

Preț: 942^.95 lei
20%

Preț: 942^.00 lei
20%

Preț: 1320^.98 lei
20%

Preț: 955^.45 lei
20%

Preț: 952^.62 lei
20%

Preț: 1232^.88 lei
20%

Preț: 624^.02 lei
20%

Preț: 615^.00 lei
20%

Preț: 624^.51 lei
18%

Preț: 906^.64 lei
20%

Preț: 621^.32 lei
20%

Preț: 1009^.35 lei
20%

Preț: 624^.02 lei

Cuprins

1: STORAGE SYSTEMS.- 1. Introduction.- 2. Primary Storage Devices.- 3. Secondary Storage Devices.- 4. Tertiary Storage Devices.- 5. Connecting Storage Together.- 6. Important Issues of Storage Systems.- 7. Alternative Storage Systems.- 8. Future.- 9. Further Reading.- References.- 2: EXTERNAL SORTING.- 1. Introduction.- 2. Run Formation Algorithms.- 3. Merging Algorithms.- 4. Memory Adaptive External Sorting.- 5. Further Reading.- References.- 3: FUNDAMENTAL ACCESS METHODS.- 1. Introduction.- 2. Basic Indices.- 3. External Dynamic Hashing.- 4. Multiattribute Access Methods.- 5. Document Searching.- 6. Further Reading.- References.- 4: ACCESS METHODS FOR INTERVALS.- 1. Introduction.- 2. External Memory Structures for Intervals.- 3. Further Reading.- References.- 5: TEMPORAL ACCESS METHODS.- 1. Introduction.- 2. Transaction-time Indexing.- 3. Bitemporal Indexing.- 4. Further Reading.- References.- 6: SPATIAL ACCESS METHODS.- 1. Introduction.- 2. Spatial Indexing Methods.- 3. Extensions.- 4. Further Reading.- References.- 7: SPATIOTEMPORAL ACCESS METHODS.- 1. Introduction.- 2. The Discrete Spatiotemporal Environment.- 3. The Continuous Spatiotemporal Environment.- 4. Further Reading.- References.- 8: IMAGE AND MULTIMEDIA INDEXING.- 1. Introduction.- 2. Spatial Similarity Retrieval.- 3. Visual Similarity Retrieval.- 4. Extensions.- 5. Further Reading.- References.- 9: EXTERNAL PERFECT HASHING.- 1. Introduction.- 2. Framework and Definitions.- 3. Perfect Hashing and Performance Characteristics.- 4. Dynamic External Perfect Hashing.- 5. Static External Perfect Hashing.- 6. Performance Comparison.- 7. Further Reading.- References.- 10: PARALLEL EXTERNAL SORTING.- 1. Introduction.- 2. Merge-based Parallel Sorting.- 3. Partition-based Parallel Sorting.- 4. Further Reading.- References.- 11: PARALLEL INDEX STRUCTURES.- 1. Introduction.- 2. Declustering Techniques.- 3. Multi-Disk B-trees.- 4. Parallel Linear Quadtrees.- 5. Parallel R-trees.- 6. Parallel S-trees.- 7. Further Reading.- References.- 12: CONCURRENCY ISSUES IN ACCESS METHODS.- 1. Introduction.- 2. Concurrency Control for B+-trees.- 3. Concurrency Control for R-trees.- 4. Concurrency Control for Hash Files.- 5. Further Reading.- References.- 13: LATEST DEVELOPMENTS.- 1. Data Warehouses.- 2. Semistructured Data over the Web.- 3. Main-memory Databases.- 4. Further Reading.- References.- Author Index.- Term Index.- List of Abbreviations.