Parallel Select

Hasso Plattner ()
Additional contact information
Hasso Plattner: Hasso Plattner Institute

Chapter Chapter 21 in A Course in In-Memory Data Management, 2013, pp 145-148 from Springer

Abstract: Abstract Chapter 18 introduced the concept of an inverted index to prevent the database system from performing a full column scan every time a query searches for a predicate in the column. However, maintaining an index is expensive and consumes additional memory. So the decision to use an index should be made carefully, balancing all the pros and cons an index would bring in the particular situation. This chapter discusses how to speed up a full column scan despite adding an index to it. Chapter 17 introduced parallelism as a means to parallelize the execution of database operations. In this chapter, we present a detailed description of how parallelism can be used to speed up the execution of a SELECT operation.

Keywords: Select Operation; Database Operations; Individual Chunks; Resulting Query Plan; Predator Search (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-36524-9_21

Ordering information: This item can be ordered from
http://www.springer.com/9783642365249

DOI: 10.1007/978-3-642-36524-9_21

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().