 InsertHasso Plattner ()
Chapter Chapter 11 in A Course in In-Memory Data Management, 2013, pp 75-81 from Springer Abstract: Abstract This chapter outlines what happens when inserting a new tuple into a table (execution of an insert statement).Compared to a row-based database, the insert in a column store is a bit more complicated. For a row-oriented database, the new tuple is simply appended to the end of the table, i.e., the tuple is stored as one piece.SanssouciDB uses column-orientation to store the data physically.A detailed description of the differences between row store and column store is given in Chap. 8. So, adding a new tuple to the database means to add a new entry to every column that the table comprises of.Internally, every column consists of a dictionary and an attribute vector (see Chap. 6).Adding a new entry to a column means to check the dictionary and adding a new value if necessary.Afterwards, the respective value of the dictionary entry is added to the attribute vector of the column.Since the dictionary is sorted, adding a new entry to a column results in three different scenarios: Keywords: Knowledge Discovery; Real World Application; Attribute Vector; Dictionary Entry; Performance Penalty (search for similar items in EconPapers) There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-36524-9_11 Ordering information: This item can be ordered from DOI: 10.1007/978-3-642-36524-9_11 Access Statistics for this chapter More chapters in Springer Books from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.