An experimental evaluation and analysis of database cracking
Database cracking has been an area of active research in recent years. The core idea of database cracking is to create indexes adaptively and incrementally as a side product of query processing. Several works have proposed different cracking techniques for different aspects including updates, tuple...
Uloženo v:
| Vydáno v: | The VLDB journal Ročník 25; číslo 1; s. 27 - 52 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.02.2016
|
| Témata: | |
| ISSN: | 1066-8888, 0949-877X |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Database cracking has been an area of active research in recent years. The core idea of database cracking is to create indexes adaptively and incrementally as a side product of query processing. Several works have proposed different cracking techniques for different aspects including updates, tuple reconstruction, convergence, concurrency control, and robustness. Our 2014 VLDB paper “The Uncracked Pieces in Database Cracking” (PVLDB 7:97–108,
2013
/VLDB 2014) was the first comparative study of these different methods by an independent group. In this article, we extend our published experimental study on database cracking and bring it to an up-to-date state. Our goal is to critically review several aspects, identify the potential, and propose promising directions in database cracking. With this study, we hope to expand the scope of database cracking and possibly leverage cracking in database engines other than MonetDB. We repeat several prior database cracking works including the core cracking algorithms as well as three other works on convergence (hybrid cracking), tuple reconstruction (sideways cracking), and robustness (stochastic cracking), respectively. Additionally to our conference paper, we now also look at a recently published study about CPU efficiency (predication cracking). We evaluate these works and show possible directions to do even better. As a further extension, we evaluate the whole class of parallel cracking algorithms that were proposed in three recent works. Altogether, in this work we revisit 8 papers on database cracking and evaluate in total 18 cracking methods, 6 sorting algorithms, and 3 full index structures. Additionally, we test cracking under a variety of experimental settings, including high selectivity (
Low
selectivity means that
many
entries qualify. Consequently, a
high
selectivity means, that only
few
entries qualify) queries, low selectivity queries, varying selectivity, and multiple query access patterns. Finally, we compare cracking against different sorting algorithms as well as against different main memory optimized indexes, including the recently proposed adaptive radix tree (ART). Our results show that: (1) the previously proposed cracking algorithms are repeatable, (2) there is still enough room to significantly improve the previously proposed cracking algorithms, (3) parallelizing cracking algorithms efficiently is a hard task, (4) cracking depends heavily on query selectivity, (5) cracking needs to catch up with modern indexing trends, and (6) different indexing algorithms have different indexing signatures. |
|---|---|
| AbstractList | Database cracking has been an area of active research in recent years. The core idea of database cracking is to create indexes adaptively and incrementally as a side product of query processing. Several works have proposed different cracking techniques for different aspects including updates, tuple reconstruction, convergence, concurrency control, and robustness. Our 2014 VLDB paper “The Uncracked Pieces in Database Cracking” (PVLDB 7:97–108,
2013
/VLDB 2014) was the first comparative study of these different methods by an independent group. In this article, we extend our published experimental study on database cracking and bring it to an up-to-date state. Our goal is to critically review several aspects, identify the potential, and propose promising directions in database cracking. With this study, we hope to expand the scope of database cracking and possibly leverage cracking in database engines other than MonetDB. We repeat several prior database cracking works including the core cracking algorithms as well as three other works on convergence (hybrid cracking), tuple reconstruction (sideways cracking), and robustness (stochastic cracking), respectively. Additionally to our conference paper, we now also look at a recently published study about CPU efficiency (predication cracking). We evaluate these works and show possible directions to do even better. As a further extension, we evaluate the whole class of parallel cracking algorithms that were proposed in three recent works. Altogether, in this work we revisit 8 papers on database cracking and evaluate in total 18 cracking methods, 6 sorting algorithms, and 3 full index structures. Additionally, we test cracking under a variety of experimental settings, including high selectivity (
Low
selectivity means that
many
entries qualify. Consequently, a
high
selectivity means, that only
few
entries qualify) queries, low selectivity queries, varying selectivity, and multiple query access patterns. Finally, we compare cracking against different sorting algorithms as well as against different main memory optimized indexes, including the recently proposed adaptive radix tree (ART). Our results show that: (1) the previously proposed cracking algorithms are repeatable, (2) there is still enough room to significantly improve the previously proposed cracking algorithms, (3) parallelizing cracking algorithms efficiently is a hard task, (4) cracking depends heavily on query selectivity, (5) cracking needs to catch up with modern indexing trends, and (6) different indexing algorithms have different indexing signatures. |
| Author | Schuhknecht, Felix Martin Jindal, Alekh Dittrich, Jens |
| Author_xml | – sequence: 1 givenname: Felix Martin orcidid: 0000-0002-0165-4116 surname: Schuhknecht fullname: Schuhknecht, Felix Martin email: felix.schuhknecht@infosys.uni-saarland.de organization: Information Systems Group, Saarland University – sequence: 2 givenname: Alekh surname: Jindal fullname: Jindal, Alekh organization: CSAIL, MIT – sequence: 3 givenname: Jens surname: Dittrich fullname: Dittrich, Jens organization: Information Systems Group, Saarland University |
| BookMark | eNp9kM1KAzEQgINUsK0-gLd9gegku0k24KUU_6DgRcFbmKTZsnXNlmQr7tubWk8eOjAzl_mGmW9GJqEPnpBrBjcMQN2mXFRNgQkKpVZ0PCNT0JWmtVLvEzJlICWtc1yQWUpbAOCciym5W4TCf-98bD99GLAr_Bd2exzaPhQY1jmxG1Obir4p1jigxeQLF9F9tGFzSc4b7JK_-utz8vZw_7p8oquXx-flYkVdKeqBOlshd74GZ2VVg_SyUgiiZl44pr0soakqm4-1Di2XXLu1sFzwEhstSu3LOVHHvS72KUXfGNcOvzcOEdvOMDAHCeYowWQJ5iDBjJlk_8hd_hTjeJLhRybl2bDx0Wz7fcwe0gnoBxZDcjE |
| CitedBy_id | crossref_primary_10_14778_3749646_3749666 crossref_primary_10_1002_cpe_5818 crossref_primary_10_1007_s13222_019_00330_x crossref_primary_10_1016_j_is_2021_101913 crossref_primary_10_14778_3749646_3749709 crossref_primary_10_1007_s13222_022_00424_z crossref_primary_10_1145_3665323 crossref_primary_10_14778_3611540_3611541 crossref_primary_10_1109_ACCESS_2018_2882244 |
| Cites_doi | 10.1007/BF00288683 10.1007/s00778-013-0345-7 10.14778/2180912.2180918 10.1145/335191.335449 10.1145/2619228.2619232 10.1145/320964.320972 10.1145/366622.366644 10.1109/ICDE.2013.6544812 10.1145/1559845.1559878 10.1145/1247480.1247527 10.1145/2619228.2619231 10.1145/1807167.1807206 10.1145/1739041.1739087 |
| ContentType | Journal Article |
| Copyright | Springer-Verlag Berlin Heidelberg 2015 |
| Copyright_xml | – notice: Springer-Verlag Berlin Heidelberg 2015 |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s00778-015-0397-y |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 0949-877X |
| EndPage | 52 |
| ExternalDocumentID | 10_1007_s00778_015_0397_y |
| GroupedDBID | -4Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 123 1N0 1SB 2.D 203 29R 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 3-Y 30V 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AAKMM AALFJ AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAWTV AAYFX AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACM ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADL ADQRH ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEBYY AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AENSD AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWIH AFWTZ AFWXC AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG CCLIF COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EDO EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GUFHI GXS H13 HF~ HG5 HG6 HGAVV HMJXF HQYDN HRMNR HVGLF HZ~ I07 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LHSKQ LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P0- P19 P2P P9O PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VXZ W23 W48 W7O WK8 YLTOR YZZ Z45 Z7R Z7X Z83 Z88 Z8M Z8R Z8W Z92 ZMTXR ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEFXT AEJOY AEZWR AFDZB AFFHD AFHIU AFKRA AFOHR AGQPQ AHPBZ AHWEU AIXLP AKRVB ARAPS ATHPR AYFIA BENPR BGLVJ CCPQU CITATION HCIFZ K7- PHGZM PHGZT PQGLB |
| ID | FETCH-LOGICAL-c358t-cb4a2ce80cb64806e647a0581e5c19e630f44b949bcab2629cd5b2523af9539e3 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 15 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000369526100003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1066-8888 |
| IngestDate | Tue Nov 18 20:54:59 EST 2025 Sat Nov 29 03:17:16 EST 2025 Fri Feb 21 02:37:42 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Adaptive indexing Multi-threaded algorithms Database cracking Sorting |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c358t-cb4a2ce80cb64806e647a0581e5c19e630f44b949bcab2629cd5b2523af9539e3 |
| ORCID | 0000-0002-0165-4116 |
| PageCount | 26 |
| ParticipantIDs | crossref_citationtrail_10_1007_s00778_015_0397_y crossref_primary_10_1007_s00778_015_0397_y springer_journals_10_1007_s00778_015_0397_y |
| PublicationCentury | 2000 |
| PublicationDate | 2016-02-01 |
| PublicationDateYYYYMMDD | 2016-02-01 |
| PublicationDate_xml | – month: 02 year: 2016 text: 2016-02-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg |
| PublicationSubtitle | The International Journal on Very Large Data Bases |
| PublicationTitle | The VLDB journal |
| PublicationTitleAbbrev | The VLDB Journal |
| PublicationYear | 2016 |
| Publisher | Springer Berlin Heidelberg |
| Publisher_xml | – name: Springer Berlin Heidelberg |
| References | Kersten, M., et al.: Cracking the database store. In: CIDR, pp. 213–224 (2005) Leis, V., et al.: The adaptive radix tree: ARTful indexing for main-memory databases. In: ICDE, pp. 38–49 (2013) Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indices. Acta Inf. 1, 173–189 (1972) Martinez-PalauXDominguez-SalDTwo-way replacement selectionPVLDB20103871881 FinchTIncremental Calculation of Weighted Mean and Variance2009CambridgeUniversity of Cambridge Computing Service Idreos, S., et al.: Database cracking. In: CIDR, pp. 68–78 (2007) Adelson-Velsky, G., et al.: An algorithm for the organization of information. In: USSR Academy of Sciences, pp. 263–266 (1962) IdreosSManegoldSMerging what’s cracked, cracking what’s mergedPVLDB20114586597 Pirk, H., Petraki, E., Idreos, S., Manegold, S., Kersten, M.L.: Database cracking: fancy scan, not poor man’s sort! In: DaMoN, Snowbird, UT, USA, pp. 4:1–4:8 (2014) HildebrandtPIsbitzHRadix exchange: an internal sorting method for digital computersJ. ACM1959621561630084.1200810163810.1145/320964.320972 HalimFIdreosSStochastic database cracking: towards robust adaptive indexing in main-memory column-storesPVLDB20125502513 Kim, C., et al.: FAST: Fast architecture sensitive tree search on modern CPUs and GPUs. In: SIGMOD, pp. 339–350 (2010) Birkeland, O.R.: Searching large data volumes with MISD processing. Ph.D. Thesis (2008) Idreos, S., Kersten, M., Manegold, S.: Self-organizing tuple reconstruction in column-stores. In: SIGMOD, pp. 297–308 (2009) Graefe, G., Halim, F., Idreos, S., et al.: Transactional support for adaptive indexing. VLDB J. 23(2), 303–328 (2014) Idreos, S., Kersten, M., Manegold, S.: Updating a cracked database. In: SIGMOD, pp. 413–424 (2007) DeWitt, D.J., Naughton, J.F., et al.: Practical skew handling in parallel joins. In: VLDB, Proceedings, pp. 27–40 (1992) HoareCARQuicksortCommun. ACM19614732110.1145/366622.366644 Alvarez, V., Schuhknecht, F.M., Dittrich, J., Richter, S.: Main memory adaptive indexing for multi-core systems. In: DaMoN, Snowbird, UT, USA, pp. 3:1–3:10 (2014) SchuhknechtFMKhanchandaniPDittrichJOn the surprising difficulty of simple things: the case of radix partitioningPVLDB20158934937 Graefe, G., Halim, F., Idreos, S., et al.: Concurrency control for adaptive indexing. PVLDB 5, 656–667 (2012) McCalpin, J.D.: STREAM benchmark, version from January 17. https://www.cs.virginia.edu/stream/FTP/Code/stream.c (2013) SchuhknechtFMJindalADittrichJThe uncracked pieces in database crackingPVLDB2013797108 Generalized Heap Impl. https://github.com/valyala/gheap Graefe, G., Kuno, H.: Self-selecting, self-tuning, incrementally optimized indexes. In: EDBT, pp. 371–381 (2010) Rao, J., Ross, K.A.: Making B+-trees cache conscious in main memory. In: SIGMOD, pp. 475–486 (2000) FM Schuhknecht (397_CR26) 2015; 8 397_CR22 397_CR23 397_CR24 397_CR20 397_CR18 397_CR19 397_CR14 397_CR15 CAR Hoare (397_CR13) 1961; 4 397_CR17 S Idreos (397_CR16) 2011; 4 T Finch (397_CR6) 2009 397_CR2 397_CR1 397_CR4 397_CR3 397_CR10 397_CR9 X Martinez-Palau (397_CR21) 2010; 3 397_CR5 397_CR8 397_CR7 F Halim (397_CR11) 2012; 5 P Hildebrandt (397_CR12) 1959; 6 FM Schuhknecht (397_CR25) 2013; 7 |
| References_xml | – reference: Idreos, S., et al.: Database cracking. In: CIDR, pp. 68–78 (2007) – reference: Graefe, G., Kuno, H.: Self-selecting, self-tuning, incrementally optimized indexes. In: EDBT, pp. 371–381 (2010) – reference: Graefe, G., Halim, F., Idreos, S., et al.: Transactional support for adaptive indexing. VLDB J. 23(2), 303–328 (2014) – reference: SchuhknechtFMJindalADittrichJThe uncracked pieces in database crackingPVLDB2013797108 – reference: Idreos, S., Kersten, M., Manegold, S.: Self-organizing tuple reconstruction in column-stores. In: SIGMOD, pp. 297–308 (2009) – reference: Birkeland, O.R.: Searching large data volumes with MISD processing. Ph.D. Thesis (2008) – reference: DeWitt, D.J., Naughton, J.F., et al.: Practical skew handling in parallel joins. In: VLDB, Proceedings, pp. 27–40 (1992) – reference: Generalized Heap Impl. https://github.com/valyala/gheap – reference: HalimFIdreosSStochastic database cracking: towards robust adaptive indexing in main-memory column-storesPVLDB20125502513 – reference: Pirk, H., Petraki, E., Idreos, S., Manegold, S., Kersten, M.L.: Database cracking: fancy scan, not poor man’s sort! In: DaMoN, Snowbird, UT, USA, pp. 4:1–4:8 (2014) – reference: Adelson-Velsky, G., et al.: An algorithm for the organization of information. In: USSR Academy of Sciences, pp. 263–266 (1962) – reference: HildebrandtPIsbitzHRadix exchange: an internal sorting method for digital computersJ. ACM1959621561630084.1200810163810.1145/320964.320972 – reference: IdreosSManegoldSMerging what’s cracked, cracking what’s mergedPVLDB20114586597 – reference: SchuhknechtFMKhanchandaniPDittrichJOn the surprising difficulty of simple things: the case of radix partitioningPVLDB20158934937 – reference: Rao, J., Ross, K.A.: Making B+-trees cache conscious in main memory. In: SIGMOD, pp. 475–486 (2000) – reference: Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indices. Acta Inf. 1, 173–189 (1972) – reference: Kersten, M., et al.: Cracking the database store. In: CIDR, pp. 213–224 (2005) – reference: McCalpin, J.D.: STREAM benchmark, version from January 17. https://www.cs.virginia.edu/stream/FTP/Code/stream.c (2013) – reference: HoareCARQuicksortCommun. ACM19614732110.1145/366622.366644 – reference: Idreos, S., Kersten, M., Manegold, S.: Updating a cracked database. In: SIGMOD, pp. 413–424 (2007) – reference: Leis, V., et al.: The adaptive radix tree: ARTful indexing for main-memory databases. In: ICDE, pp. 38–49 (2013) – reference: FinchTIncremental Calculation of Weighted Mean and Variance2009CambridgeUniversity of Cambridge Computing Service – reference: Martinez-PalauXDominguez-SalDTwo-way replacement selectionPVLDB20103871881 – reference: Graefe, G., Halim, F., Idreos, S., et al.: Concurrency control for adaptive indexing. PVLDB 5, 656–667 (2012) – reference: Kim, C., et al.: FAST: Fast architecture sensitive tree search on modern CPUs and GPUs. In: SIGMOD, pp. 339–350 (2010) – reference: Alvarez, V., Schuhknecht, F.M., Dittrich, J., Richter, S.: Main memory adaptive indexing for multi-core systems. In: DaMoN, Snowbird, UT, USA, pp. 3:1–3:10 (2014) – ident: 397_CR1 – ident: 397_CR3 doi: 10.1007/BF00288683 – ident: 397_CR9 doi: 10.1007/s00778-013-0345-7 – ident: 397_CR22 – volume: 7 start-page: 97 year: 2013 ident: 397_CR25 publication-title: PVLDB – ident: 397_CR4 – ident: 397_CR18 – ident: 397_CR8 doi: 10.14778/2180912.2180918 – ident: 397_CR24 doi: 10.1145/335191.335449 – volume: 5 start-page: 502 year: 2012 ident: 397_CR11 publication-title: PVLDB – ident: 397_CR23 doi: 10.1145/2619228.2619232 – volume: 6 start-page: 156 issue: 2 year: 1959 ident: 397_CR12 publication-title: J. ACM doi: 10.1145/320964.320972 – volume: 3 start-page: 871 year: 2010 ident: 397_CR21 publication-title: PVLDB – volume: 4 start-page: 321 issue: 7 year: 1961 ident: 397_CR13 publication-title: Commun. ACM doi: 10.1145/366622.366644 – ident: 397_CR20 doi: 10.1109/ICDE.2013.6544812 – ident: 397_CR15 doi: 10.1145/1559845.1559878 – ident: 397_CR14 doi: 10.1145/1247480.1247527 – volume-title: Incremental Calculation of Weighted Mean and Variance year: 2009 ident: 397_CR6 – ident: 397_CR5 – ident: 397_CR17 – volume: 8 start-page: 934 year: 2015 ident: 397_CR26 publication-title: PVLDB – ident: 397_CR2 doi: 10.1145/2619228.2619231 – ident: 397_CR19 doi: 10.1145/1807167.1807206 – ident: 397_CR7 – volume: 4 start-page: 586 year: 2011 ident: 397_CR16 publication-title: PVLDB – ident: 397_CR10 doi: 10.1145/1739041.1739087 |
| SSID | ssj0002225 |
| Score | 2.2296753 |
| Snippet | Database cracking has been an area of active research in recent years. The core idea of database cracking is to create indexes adaptively and incrementally as... |
| SourceID | crossref springer |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 27 |
| SubjectTerms | Computer Science Database Management Special Issue Paper |
| Title | An experimental evaluation and analysis of database cracking |
| URI | https://link.springer.com/article/10.1007/s00778-015-0397-y |
| Volume | 25 |
| WOSCitedRecordID | wos000369526100003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 0949-877X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002225 issn: 1066-8888 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEB60evBifWJ9kYMnJZDNJtkEvBSxeCqCD3pbkmwCgmylrYX-e5Pt7mpBBT3kNgnLR5JvZmfyDcAFS2TBs9TiJPAHZsZ5LL1XWDtHC6a849ZUzSay4VCORuq-fsc9bardm5RkdVO3j92i8kwsvOKYBBLFi3XY4FFsJoboD8_t9RsDmCrFKQQO4Z1sUpnfLbFKRquZ0IpgBt1_fdoObNf-JOovN8AurLlyD7pNrwZUH919uO6X6KuaP_qU-Ua6LMJYipOgsUexajSyG7ITbeOv9AN4Gtw-3tzhunMCtimXM2wN09Q6SawRTBLhBMs04TIJ0CfKiZR4xoxiylhtqKDKFtzQEJNqr3iqXHoInXJcuiNAwhEvOJVGmIw5kUhvReGFCm6Qt9TRHpAGwtzWsuKxu8Vr3goiV-jkAZ08opMvenDZTnlbamr8ZnzVYJ7Xx2v6s_Xxn6xPYCv4P3UR9il0ZpN3dwabdj57mU7Oq231AQ2iyJM |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PS8MwFH7oFPTi_InzZw6elECbJmkCXoY4Js4hOGW30qQJCNLJNoX99yZdWx2ooIfcXkL5SPLe63v5PoAzGoqMxZHGofMfmCpjsbBW4tQYklFpDdOqEJuI-30xHMr78h33pOp2r0qSxU1dP3bzzDO-8YrhwDlRPFuGFepVdnyK_vBUX78-gSlKnJxjl96JqpT53RKLzmixElo4mE7zX5-2CRtlPIna8w2wBUsm34ZmpdWAyqO7A5ftHH1l80efNN8ozTM35uQkaGSR7xr13g3pcar9r_RdeOxcD666uFROwDpiYoq1oinRRgRacSoCbjiN04CJ0EEfSsOjwFKqJJVKp4pwInXGFHE5aWoli6SJ9qCRj3KzD4ibwHJGhOIqpoaHwmqeWS5dGGQ1MaQFQQVhoktaca9u8ZLUhMgFOolDJ_HoJLMWnNdTXuecGr8ZX1SYJ-XxmvxsffAn61NY6w7ueknvpn97COsuFiobso-gMR2_mWNY1e_T58n4pNhiH37oy3c |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFD7oFPHFecV5zYNPSlibpmkCvgx1KMoY3thbadIEBOnGVoX9e5NepgMVxIe-nYbwNcl3Ts_JdwBOqM_TMAoU9i1_YCq1wdwYgROtSUqF0aGSRbOJqNfjg4HoV31OJ3W1e52SLO80OJWmLG-PUtOeXXxzKjSuCCvEniVUPF2EJWoDGVfTdf_wPDuKXTBTpDsZwzbU43Va87sh5olpPitakE23-e9prsNa5WeiTrkwNmBBZ5vQrHs4oGpLb8F5J0NfVf7Rp_w3SrLUPqVoCRoa5KpJHeshNU6U-8W-DU_dq8eLa1x1VMAqCHmOlaQJUZp7SjLKPaYZjRIv5L79JL7QLPAMpVJQIVUiCSNCpaEkNlZNjAgDoYMdaGTDTO8CYtozLCRcMhlRzXxuFEsNE9Y9Mopo0gKvhjNWldy463rxGs-Ekgt0YotO7NCJpy04nb0yKrU2fjM-q_GPq203-dl670_Wx7DSv-zGdze9231YtS5SVad9AI18_KYPYVm95y-T8VGx2j4AoffUWw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+experimental+evaluation+and+analysis+of+database+cracking&rft.jtitle=The+VLDB+journal&rft.au=Schuhknecht%2C+Felix+Martin&rft.au=Jindal%2C+Alekh&rft.au=Dittrich%2C+Jens&rft.date=2016-02-01&rft.issn=1066-8888&rft.eissn=0949-877X&rft.volume=25&rft.issue=1&rft.spage=27&rft.epage=52&rft_id=info:doi/10.1007%2Fs00778-015-0397-y&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00778_015_0397_y |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1066-8888&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1066-8888&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1066-8888&client=summon |