-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathreferences.bib
2450 lines (2166 loc) · 78.2 KB
/
references.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
% Tricks
%--------------------------------------------
@preamble{"\newcommand{\SortNoop}[1]{}"}
% Use example:
% author = {{\SortNoop{Bercken}}van den Bercken, Jochen}
%% Leave a space between first names and last name,
%% i.e., "J. P. Doe", not "J.P.Doe".
% Names
%--------------------------------------------
@string{proc={Proceedings of the }}
@string{journal:vldb={The VLDB Journal}}
@string{journal:vldb-endow={Proceedings of the VLDB Endowment}}
@string{journal:ieee-kde={IEEE Transactions on Knowledge and Data Engineering}}
@string{journal:ieee-computer={IEEE Computer}}
@string{journal:ibm-rnd={IBM Journal of Research and Development}}
@string{journal:sigmod={ACM SIGMOD Record}}
@string{journal:acm-tods={ACM Transactions on Database Systems}}
@string{journal:acm-talg={ACM Transactions on Algorithms}}
@string{journal:acta={Acta Informatica}}
@string{journal:algo={Algorithmica}}
@string{journal:acm-survey={ACM Computing Surveys}}
@string{journal:acm-comm={Communications of the ACM}}
@string{journal:jacm={Journal of the ACM}}
@string{journal:info-science={Information Sciences}}
@string{journal:info-system={Information Systems}}
@string{journal:css={Journal of Computer and System Sciences}}
@string{journal:ijasc={International Journal of Applied Science and Computations}}
@string{journal:siam={SIAM Journal on Computing}}
@string{journal:dke={Data and Knowledge Engineering}}
@string{conf:vldb={International Conference on Very Large Data Bases}}
@string{conf:ideas={International Database Engineering and Applications Symposium}}
@string{conf:edbt={International Conference on Extending Database Technology}}
@string{conf:sigmod={ACM SIGMOD International Conference on Management of Data}}
@string{conf:sigcomm={ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication}}
@string{conf:cikm={ACM Conference on Information and Knowledge Management}}
@string{conf:pikm={PhD Workshop on Information and Knowledge Management}}
@string{conf:icde={International Conference on Data Engineering}}
@string{conf:icdt={International Conference on Database Theory}}
@string{conf:sea={International Symposium on Experimental Algorithms}}
@string{conf:cidr={International Conference on Innovative Data Systems Research}}
@string{conf:ssd={International Symposium on Advances in Spatial Databases}}
@string{conf:spire={String Processing and Information Retrieval Symposium}}
@string{conf:pods={ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems}}
@string{conf:pdc={ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing}}
@string{conf:alenex={Workshop on Algorithm Engineering and Experiments}}
@string{conf:chilean={International Conference of the Chilean Computer Science Society}}
@string{conf:icalp={International Colloquium on Automata, Languages and Programming}}
@string{conf:ride={International Workshop on Research Issues in Data Engineering}}
@string{conf:sede={International Conference on Software Engineering and Data Engineering}}
@string{conf:dexa={International Conference on Database and Expert Systems Applications}}
@string{conf:sirocco={International Colloquium on Structural Information and Communication Complexity}}
@string{conf:ancs={ACM/IEEE Symposium on Architecture for Networking and Communications Systems}}
@string{conf:raid={International Symposium on Recent Advances in Intrusion Detection}}
@string{conf:dbpl={International Workshop on Database Programming Languages}}
@string{conf:damon={International Workshop on Data Management On New Hardware}}
@string{conf:icws={IEEE International Conference on Web Services}}
@string{conf:ipps={International Parallel Processing Symposium}}
@string{conf:pdis={International Conference on Parallel and Distributed Information Systems}}
@string{conf:iwg={International Workshop on Groupware}}
@string{conf:mascots={IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems}}
@string{conf:time={International Workshop on Temporal Representation and Reasoning}}
% Articles
%--------------------------------------------
@inproceedings{becker:1993:optimal,
author = {Becker, B. and Gschwind, S. and Ohler, T. and Seeger, Bernhard and Widmayer, Peter},
title = {On Optimal Multiversion Access Structures},
crossref = {proc:ssd:1993},
pages = {123--141}
}
% Multiversion B-tree (MVBT)
@article{becker:1996:mvbt,
author = {B. Becker and S. Gschwind and T. Ohler and Bernhard Seeger and Peter Widmayer},
title = {{An asymptotically optimal multiversion B-tree}},
journal = journal:vldb,
volume = 5,
number = 4,
year = 1996,
pages = {264--275}
}
@inproceedings{bercken:1996:multiversion,
author = {{\SortNoop{Bercken}}van den Bercken, Jochen and Seeger, Bernhard},
title = {Query processing techniques for multiversion access methods},
crossref = {proc:vldb:1996},
pages = {168--179}
}
% Enhancement of the MVBT
@article{varman:1997:multiversion,
author = {Varman, P. J. and Verma, R. M.},
title = {An efficient multiversion access structure},
journal = journal:ieee-kde,
volume = {9},
number = {3},
pages = {391--409},
year = {1997}
}
% Write-once B-tree (WOBT)
@article{easton:1986:wobt,
author = {Easton, M. C.},
title = {Key-sequence data sets on indelible storage},
journal = journal:ibm-rnd,
volume = {30},
number = {3},
year = {1986},
pages = {230--241}
}
% Time-split B-tree (TSB)
@inproceedings{lomet:1989:tsb,
author = {D. Lomet and B. Salzberg},
title = {Access methods for multiversion data},
crossref = {proc:sigmod:1989},
pages = {315--324}
}
% Performance study of the TSB
@inproceedings{lomet:1990:tsb-performance,
author = {Lomet, D. and Salzberg, B.},
title = {The performance of a multiversion access method},
crossref = {proc:sigmod:1990},
pages = {353--363}
}
@article{lomet:1992:conc-rec,
author = {Lomet, D. and Salzberg, B.},
title = {Access method concurrency with recovery},
journal = journal:sigmod,
volume = {21},
number = {2},
pages = {351--360},
year = {1992},
publisher = {ACM New York, NY, USA}
}
@article{lomet:1997:concurrency,
author = {Lomet, D. and Salzberg, B.},
title = {Concurrency and recovery for index trees},
journal = journal:vldb,
volume = {6},
number = {3},
pages = {224--240},
year = {1997},
publisher = {Springer}
}
% Published short 3-page article on Immortal DB
@inproceedings{lomet:2005:immortaldb,
author = {D. Lomet and R. Barga and M. F. Mokbel and G. Shegalov and
R. Wang and Y. Zhu},
title = {Immortal {DB}: transaction time support for {SQL} server},
crossref = {proc:sigmod:2005},
pages = {939--941}
}
% Longer paper on Immortal DB
@inproceedings{lomet:2006:transactiontime,
author = {D. Lomet and R. Barga and M. F. Mokbel and G. Shegalov and
R. Wang and Y. Zhu},
title = {Transaction time support inside a database engine},
crossref = {proc:icde:2006},
pages = {35},
year = {2006}
}
% Transaction time in Immortal DB
@article{lomet:2008:version-compression,
author = {Lomet, D. and Hong, M. and Nehme, R. and Zhang, R.},
title = {Transaction time indexing with version compression},
journal = journal:vldb-endow,
volume = {1},
number = {1},
pages = {870--881},
year = {2008},
publisher = {VLDB Endowment}
}
% Improving Immortal DB
@inproceedings{lomet:2009:improving,
author = {Lomet, D. and Li, F.},
title = {Improving transaction-time {DBMS} performance and functionality},
crossref = {proc:icde:2009},
pages = {581--591}
}
% Differential indexes
@inproceedings{pollari-malmi:2000:differential-index,
author = {Pollari-Malmi, Kerttu and Ruuth, Jarmo and Soisalon-Soininen, Eljas},
title = {Concurrency control for {B-trees} with differential indices},
crossref = {proc:ideas:2000},
pages = {287--296}
}
% B-trees with concurrency
@article{bayer:1977:btree-concurrency,
author = {Rudolf Bayer and Schkolnick, M.},
title = {Concurrency of operations on {B-trees}},
journal = journal:acta,
volume = {9},
number = {1},
pages = {1--21},
year = {1977},
publisher = {Springer}
}
% B-tree article
@article{bayer:1972:btree,
author = {Rudolf Bayer and McCreight, E. M.},
title = {Organization and maintenance of large ordered indexes},
journal = journal:acta,
volume = {1},
number = {3},
pages = {173--189},
year = {1972},
publisher = {Springer}
}
% Cache coherency
@inproceedings{graefe:2001:cache,
author = {Graefe, G. and Larson, P-{\AA}.},
title = {B-tree indexes and {CPU} caches},
crossref = {proc:icde:2001},
pages = {349--358}
}
% Perhaps first temporal article?
@inproceedings{bubenko:1977:temporal,
author = {Bubenko, J. A.},
title = {The temporal dimension in information modelling},
booktitle = proc # {IFIP Working Conference on Modelling in Data Base Management Systems},
year = {1977},
pages = {93--118}
}
% B-link-tree article
@Article{lehman:1981:b-link-tree,
author = {Lehman, P. L. and Yao, B.},
title = {Efficient locking for concurrent operations on {B-trees}},
journal = journal:acm-tods,
year = {1981},
volume = {6},
number = {4},
pages = {650--670}
}
@article{graefe:2003:partitioned,
author = {Graefe, G.},
title = {Partitioned {B}-trees---a user's guide},
journal = {Datenbanksysteme f{\"u}r Business, Technologie und Web, Tagungsband der 10. BTW-Konferenz},
pages = {668--671},
year = {2003},
organization={Citeseer}
}
% No pages for this entry (only on-line proceedings)
@inproceedings{graefe:2003:sorting,
title = {Sorting and indexing with partitioned {B}-Trees},
author = {Graefe, G.},
booktitle = proc # {1st } # conf:cidr,
year = {2003},
organization={Citeseer}
}
@article{pollari-malmi:1996:batch-updates,
author = {Pollari-Malmi, Kerttu and Soisalon-Soininen, Eljas and Yl{\"o}nen, Tatu},
title = {Concurrency control in {B-trees} with batch updates},
journal = journal:ieee-kde,
volume = {8},
number = {6},
pages = {975--984},
year = {1996}
}
@inproceedings{pollari-malmi:2004:bulk-insert,
author = {Pollari-Malmi, Kerttu and Soisalon-Soininen, Eljas},
title = {Concurrency Control and {I/O}-Optimality in Bulk Insertion},
booktitle = proc # {11th } # conf:spire,
pages = {161--170},
year = {2004},
publisher = {Springer}
}
@phdthesis{pollari-malmi:2002:batch-updates,
author = {Kerttu Pollari-Malmi},
title = {Batch Updates and Concurrency Control in {B}-Trees},
school = {Department of Computer Science and Engineering, Helsinki University of Technology, Espoo, Finland},
year = {2002},
note = {\url{http://lib.tkk.fi/Diss/2002/isbn9512258951/}. Referenced \printdate{18.1.2010}}
}
@inproceedings{lilja:2007:bulk-delete,
author = {Timo Lilja and Riku Saikkonen and Seppo Sippu and
Eljas Soisalon-Soininen},
title = {Online Bulk Deletion},
crossref = {proc:icde:2007},
pages = {956--965}
}
@inproceedings{saikkonen:2009:bulk-insert-sort,
title = {Bulk-Insertion Sort: Towards Composite Measures of Presortedness},
author = {Riku Saikkonen and Eljas Soisalon-Soininen},
booktitle = proc # {8th } # conf:sea,
pages = {269--280},
year = {2009},
organization = {Springer-Verlag}
}
@inproceedings{lilja:2005:balancing,
author = {Timo Lilja},
title = {The cost of balancing in top-down (a,b) trees},
booktitle = proc # {Conference on Algorithmic Information Theory},
year = 2005,
pages = {77--84},
organization = {University of Vaasa, Vaasa, Finland}
}
@inproceedings{soisalon-soininen:1999:full-text,
author = {Soisalon-Soininen, Eljas and Widmayer, Peter},
title = {Concurrency and recovery in full-text indexing},
booktitle = proc # {1999 } # conf:spire # { and } # conf:iwg,
pages = {192--198},
year = {1999}
}
@inproceedings{gartner:2001:bulk-delete,
title = {Efficient bulk deletes in relational databases},
author = {Gärtner, A. and Kemper, A. and Kossmann, D. and Zeller, B.},
crossref = {proc:icde:2001},
pages = {183--192}
}
@phdthesis{saikkonen:2009:bulk-updates,
author = {Riku Saikkonen},
title = {Bulk Updates and Cache Sensivity in Search Trees},
school = {Department of Computer Science and Engineering, Helsinki University of Technology, Espoo, Finland},
year = {2009},
note = {\url{http://lib.tkk.fi/Diss/2009/isbn9789522480385/}. Referenced \printdate{13.1.2010}}
}
@phdthesis{stantic:2005:temporal,
author = {Stantic, B.},
title = {Access Methods for Temporal Databases},
year = {2005},
school = {Griffith University, Australia}
}
@inproceedings{shoshani:1986:temporal,
author = {Shoshani, A. and Kawagoe, K.},
title = {Temporal data management},
crossref = {proc:vldb:1986},
pages = {79--88}
}
@inproceedings{zhang:2001:temporal,
title = {Efficient computation of temporal aggregates with range predicates},
author = {Zhang, D. and Markowetz, A. and Tsotras, V. and Gunopulos, D. and Seeger, Bernhard},
crossref = {proc:pods:2001},
pages = {237--245},
year = {2001}
}
@inproceedings{litwin:1980:linear,
author = {Litwin, W.},
title = {Linear hashing: A new tool for file and table addressing},
crossref = {proc:vldb:1980},
pages = {212--223}
}
@article{lum:1984:designing,
author = {Lum, V. and Dadam, P. and Erbe, R. and Guenauer, J. and Pistor, P. and Walch, G. and Werner, H. and Woodfill, J.},
title = {Designing {DBMS} support for the temporal dimension},
journal = journal:sigmod,
volume = {14},
number = {2},
pages = {115--130},
year = {1984},
publisher = {ACM}
}
% Differential indexes (similar to)
@inproceedings{mohan:1992:side-file,
author = {Mohan, C. and Narang, I.},
title = {Algorithms for creating indexes for very large tables without quiescing updates},
crossref = {proc:sigmod:1992},
pages = {361--370}
}
@unpublished{haapasalo:2010:performance,
author = {Haapasalo, Tuukka},
title = {Experimental Analysis of Transactional Multiversion Database Structures},
note = {To be submitted for publication}
}
@inproceedings{haapasalo:2009:cmvbt,
author = {Tuukka Haapasalo and Ibrahim Jaluta and Seppo Sippu and Eljas Soisalon-Soininen},
title = {Concurrent Updating Transactions on Versioned Data},
crossref = {proc:ideas:2009},
pages = {77--87}
}
@inproceedings{haapasalo:2009:tmvbt,
author = {Tuukka Haapasalo and Ibrahim Jaluta and Bernhard Seeger and Seppo Sippu and Eljas Soisalon-Soininen},
title = {Transactions on the multiversion {B$^+$}-tree},
crossref = {proc:edbt:2009},
pages = {1064--1075}
}
@inproceedings{haapasalo:2008:concurrency,
author = {Tuukka Haapasalo and Ibrahim Jaluta and Seppo Sippu and Eljas Soisalon-Soininen},
title = {Concurrency control and recovery for multiversion database structures},
booktitle = proc # {2nd } # conf:pikm,
year = 2008,
pages = {73--80}
}
@article{jaluta:2005:blink,
author = {Ibrahim Jaluta and Seppo Sippu and Eljas Soisalon-Soininen},
title = {Concurrency control and recovery for balanced {B}-link trees},
journal = journal:vldb,
volume = {14},
number = {2},
year = {2005},
pages = {257--277},
}
@article{jaluta:2003:recoverable,
author = {Ibrahim Jaluta and Seppo Sippu and Eljas Soisalon-Soininen},
title = {Recoverable {B$^+$}-trees in Centralized Database Management Systems},
journal = journal:ijasc,
year = {2003},
volume = {10},
pages = {160--181}
}
@phdthesis{jaluta:2002:client-server,
author = {Ibrahim Jaluta},
title = {B-tree concurrency control and recovery in a client-server database management system},
year = {2002},
school = {Department of Computer Science and Engineering, Helsinki University of Technology, Espoo, Finland},
note = {\url{http://lib.hut.fi/Diss/2002/isbn9512257068}. Referenced \printdate{13.1.2010}}
}
@article{jaluta:2006:page-server,
author = {Ibrahim Jaluta and Seppo Sippu and Eljas Soisalon-Soininen},
title = {B-tree concurrency control and recovery in page-server database systems},
journal = journal:acm-tods,
year = {2006},
volume = 31,
number = 1,
pages = {82--132}
}
@inproceedings{sippu:2001:theory,
author = {Seppo Sippu and Eljas Soisalon-Soininen},
title = {A theory of transactions on recoverable search trees},
crossref = {proc:icdt:2001},
pages = {83--98}
}
@inproceedings{soisalon-soininen:2004:strings,
title = {On classification of strings},
author = {Eljas Soisalon-Soininen and Tatu Ylönen},
booktitle = proc # {11th } # conf:spire,
pages = {321--330},
year = {2004},
publisher = {Springer}
}
@article{brown:1980:sorted-lists,
title = {Design and analysis of a data structure for representing sorted lists},
author = {Brown, M. R. and Tarjan, R. E.},
journal = journal:siam,
volume = {9},
number = {3},
pages = {594--614},
year = {1980}
}
@techreport{brown:1978:sorted-lists,
title = {Design and analysis of a data structure for representing sorted lists},
author = {Brown, M. R. and Tarjan, R. E.},
year = {1978},
number = {STAN-CS-78-709},
institution = {Stanford University, School of Humanities and Sciences, Computer Science Department}
}
@inproceedings{jensen:2001:timestamping,
author = {Jensen, C. and Lomet, D.},
title = {Transaction timestamping in (temporal) databases},
crossref = {proc:vldb:2001},
pages = {441--450}
}
@phdthesis{sullivan:2003:tuning,
author = {Sullivan, D. G.},
title = {Using Probabilistic Reasoning to Automate Software Tuning},
year = {2003},
school = {The Division of Engineering and Applied Sciences, Harvard University, Cambridge, Massachusetts}
}
@phdthesis{reed:1987:naming,
author = {D. P. Reed},
title = {Naming and synchronization in a decentralized computer system},
year = {1987},
school = {Massachusetts Institute of Technology, Cambridge, USA},
note = {MIT-LCS-TR-205}
}
@article{kollios:2002:hashing,
author = {G. Kollios and V. J. Tsotras},
title = {Hashing methods for temporal data},
journal = journal:ieee-kde,
volume = {14},
number = {4},
year = {2002},
pages = {902--919}
}
@article{kumar:1998:bitemporal,
title = {Designing access methods for bitemporal databases},
author = {Kumar, A. and Tsotras, V.J. and Faloutsos, C.},
journal = journal:ieee-kde,
volume = {10},
number = {1},
pages = {1},
year = {1998}
}
@article{oneil:1999:lru-k,
author = {O'Neil, E. J. and O'Neil, P. E. and Weikum, G.},
title = {An optimality proof of the {LRU-K} page replacement algorithm},
journal = journal:jacm,
volume = {46},
number = {1},
pages = {92--112},
year = {1999},
publisher = {ACM New York, NY, USA}
}
@inproceedings{lomet:1993:key-range,
author = {Lomet, D. B.},
title = {Key range locking strategies for improved concurrency},
crossref = {proc:vldb:1993},
pages = {655--664}
}
@article{lomet:1998:cs-recovery,
author = {Lomet, D. and Weikum, G.},
title = {Efficient transparent application recovery in client-server information systems},
journal = journal:sigmod,
volume = {27},
number = {2},
pages = {460--471},
year = {1998},
publisher = {ACM}
}
@inproceedings{chang:2006:bigtable,
author = {Chang, F. and Dean, J. and Ghemawat, S. and Hsieh, W. C. and Wallach, D. A. and Burrows, M. and Chandra, T. and Fikes, A. and Gruber, R. E.},
title = {Bigtable: a distributed storage system for structured data},
booktitle = proc # {7th USENIX Symposium on Operating Systems Design and Implementation},
pages = {205--218},
year = {2006}
}
@inproceedings{silva:2000:bitemporal,
title = {An incremental batch-oriented index for bitemporal databases},
author = {Silva, J.R.O. and Nascimento, M.A.},
booktitle = proc # {7th } # conf:time,
pages = {133--141},
year = {2000}
}
@inproceedings{sun:2005:online-btree,
author = {Sun, X. and Wang, R. and Salzberg, B. and Zou, C.},
title = {Online {B}-tree merging},
crossref = {proc:sigmod:2005},
pages = {335--346},
}
% First red-black tree article
@article{bayer:1972:red-black,
author = {Rudolf Bayer},
title = {Symmetric binary {B}-trees: Data structure and maintenance algorithms},
journal = journal:acta,
volume = {1},
number = {4},
pages = {290--306},
year = {1972}
}
% Red-black tree article (new name from this article)
@inproceedings{guibas:1978:red-black,
author = {Guibas, L. J. and Sedgewick, R.},
title = {A dichromatic framework for balanced trees},
booktitle = proc # {19th Annual Symposium on Foundations of Computer Science},
pages = {8--21},
year = {1978}
}
% ARIES
@article{mohan:1992:aries,
author = {C. Mohan and D. J. Haderle and B. G. Lindsay and H. Pirahesh
and P. M. Schwarz},
title = {{ARIES}: a transaction recovery method supporting
fine-granularity locking and partial rollbacks using
write-ahead logging},
journal = journal:acm-tods,
volume = {17},
number = {1},
year = {1992},
pages = {94--162}
}
% ARIES/IM
@inproceedings{mohan:1992:aries-im,
author = {Mohan, C.},
title = {{ARIES/IM}: an efficient and high concurrency index
management method using write-ahead logging},
crossref = {proc:sigmod:1992},
pages = {371--380}
}
% ARIES/IM
@inproceedings{mohan:1990:aries-kvl,
author = {Mohan, C.},
title = {{ARIES/KVL}: a key-value locking method for concurrency control
of multiaction transactions operating on {B}-tree indexes},
crossref = {proc:vldb:1990},
pages = {392--405}
}
@incollection{mohan:1996:ariescc,
author = {C. Mohan},
title = {Concurrency Control and Recovery Methods for {B$^+$}-Tree Indexes: {ARIES/KVL} and {ARIES/IM}},
booktitle = {Performance of Concurrency Control Mechanisms in Centralized Database Systems},
year = {1996},
pages = {248--306},
publisher = {Prentice-Hall, Inc. Upper Saddle River, NJ, USA},
editor = {Vijay Kumar}
}
@inproceedings{mohan:1999:aries-history,
title = {Repeating history beyond {ARIES}},
author = {Mohan, C.},
crossref = {proc:vldb:1999},
pages = {1--17}
}
@inproceedings{mohan:2002:delete-update,
author = {Mohan, C.},
title = {An efficient method for performing record deletions and updates using index scans},
crossref = {proc:vldb:2002},
pages = {940--949}
}
@inproceedings{salzberg:2004:framework,
author = {B. Salzberg and L. Jiang and D. Lomet and M. Barrena and
J. Shan and E. Kanoulas},
title = {A framework for access methods for versioned data},
crossref = {proc:edbt:2004},
pages = {730--747}
}
% Language for querying multiversion databases, navigating through database versions, etc.
@inproceedings{abdessalem:1997:vql,
author = {Abdessalem, T. and Jomier, G.},
title = {{VQL}: a query language for multiversion databases},
booktitle = proc # {6th } # conf:dbpl,
pages = {160--179},
year = {1997},
publisher = {Springer}
}
@inproceedings{sanzo:2008:performance,
title = {A performance model of multi-version concurrency control},
author = {{\SortNoop{Sanzo}}di Sanzo, P. and Ciciani, B. and Quaglia, F. and Romano, P.},
booktitle = proc # {16th } # conf:mascots,
pages = {1--10},
year = {2008}
}
% Storing intervals into a B-tree-like structure.
@article{ang:1995:ibt,
author = {Ang, C. H. and Tan, K. P.},
title = {The interval {B}-tree},
journal = {Information Processing Letters},
volume = {53},
number = {2},
pages = {85--89},
year = {1995},
publisher = {Elsevier}
}
%
@article{aggarwal1988input,
author = {Aggarwal, A. and Jeffrey, S. V.},
title = {The input/output complexity of sorting and related problems},
journal = journal:acm-comm,
year = {1988},
volume = {31},
number = {9},
pages = {1116--1127},
publisher = {ACM New York, NY, USA}
}
@article{jermaine:2007:pe-file,
author = {Jermaine, C. and Omiecinski, E. and Yee, W. G.},
title = {The partitioned exponential file for database storage management},
journal = journal:vldb,
volume = {16},
number = {4},
pages = {417--437},
year = {2007},
publisher = {Springer}
}
% An indexing method that combines hash tables and B-trees.
@article{arumugam:2006:multiversion,
author = {Arumugam, G. and Thangaraj, M.},
title = {An efficient multiversion access control in a temporal object oriented database},
journal = {Journal of Object Technology},
year = 2006,
volume = 5,
number = 1,
pages = {105--116}
}
% Representing now-time (current, end-point somewhere in future) in databases.
% Nothing really multiversion related.
@article{clifford:1997:now-semantics,
author = {Clifford, J. and Dyreson, C. and Isakowitz, T. and Jensen, C. S. and Snodgrass, R. T.},
title = {On the semantics of {``now''} in databases},
journal = journal:acm-tods,
volume = {22},
number = {2},
pages = {171--214},
year = {1997}
}
% Method for ordering transaction timings so that there are fewer conflicts and less waiting
% Dynamic Versioning, DV
@inproceedings{gukal:1995:transient-versioning,
author = {Gukal, S. and Omiecinski, E. and Ramachandran, U.},
title = {An efficient transient versioning method},
booktitle = proc # {13th British National Conference on Databases},
pages = {155--171},
year = {1995},
publisher = {Springer}
}
% Original R-tree article
@inproceedings{guttman:1984:rtree,
author = {Guttman, A.},
title = {R-trees: a dynamic index structure for spatial searching},
crossref = {proc:sigmod:1984},
pages = {47--57}
}
% Better splits for R-trees in the R*-tree
@inproceedings{beckmann:1990:rtree,
author = {Beckmann, N. and Kriegel, H. P. and Schneider, R. and Seeger, Bernhard},
title = {The \mbox{{R*}-tree}: an efficient and robust access method for points and rectangles},
crossref = {proc:sigmod:1990},
pages = {322--331}
}
% Revised R*-tree
@inproceedings{beckmann:2009:rstar,
title = {A revised {R*}-tree in comparison with related index structures},
author = {Beckmann, N. and Seeger, Bernhard},
crossref = {proc:sigmod:2009},
pages = {799--812}
}
% Indexing moving objects
@inproceedings{hadjieleftheriou:2002:spatiotemporal,
author = {Hadjieleftheriou, M. and Kollios, G. and Tsotras, V. J. and Gunopulos, D.},
title = {Efficient indexing of spatiotemporal objects},
crossref = {proc:edbt:2002},
pages = {251--268}
}
@article{hadjieleftheriou:2006:indexing,
author = {Hadjieleftheriou, M. and Kollios, G. and Tsotras, V. J. and Gunopulos, D.},
title = {Indexing spatiotemporal archives},
journal = journal:vldb,
volume = {15},
number = {2},
pages = {143--164},
year = {2006},
publisher = {Springer}
}
% Overview of temporal data management, nothing much relating to temporal
% index implementation.
@article{jensen:1999:temporal,
author = {Jensen, C. S. and Snodgrass, R. T.},
title = {Temporal data management},
journal = journal:ieee-kde,
volume = {11},
number = {1},
pages = {36--44},
year = {1999}
}
@article{snodgrass:1986:temporal,
author = {Snodgrass, R. T. and Ahn, I.},
title = {Temporal databases},
journal = journal:ieee-computer,
volume = {19},
number = {9},
pages = {35--42},
year = {1986},
publisher = {Springer}
}
@article{gao:2006:join,
author = {D. Gao and C. S. Jensen and R. T. Snodgrass and M. D. Soo},
title = {Join operations in temporal databases},
journal = journal:vldb,
volume = {14},
number = {1},
pages = {2--29},
year = {2005},
publisher = {Springer Berlin / Heidelberg}
}
% A comparison of three multiversion indexes, none of which are optimal.
@inproceedings{jouini:2007:multiversion,
author = {Jouini, K. and Jomier, G.},
title = {Indexing multiversion databases},
crossref = {proc:cikm:2007},
pages = {915--918}
}
% Describes how the page structure should be laid out in memory to avoid L2 cache misses
@inproceedings{jouini:2008:temporal-redundancy,
author = {Jouini, K. and Jomier, G.},
title = {Avoiding version redundancy for high performance reads in temporal databases},
booktitle = proc # {4th } # conf:damon,
pages = {41--46},
year = {2008},
}
% Same as above, cache sensitivity etc.
@inproceedings{jouini:2008:temporal-layouts,
author = {Jouini, K. and Jomier, G. and Kabore, P.},
title = {Read-Optimized, Cache-Conscious, Page Layouts for Temporal Relational Data},
booktitle = proc # {19th } # conf:dexa,
pages = {581--595},
year = {2008}
}
% MAP21: Time intervals mapped to points which are then indexed using B-trees
@article{nascimento:1999:valid-time,
author = {Nascimento, M. A. and Dunham, M. H.},
title = {Indexing Valid Time Databases via {B$^+$}-Trees},
journal = journal:ieee-kde,
pages = {929--947},
year = {1999}
}
% Time-index
@inproceedings{elmasri:1990:time-index,
author = {Elmasri, R. and Wuu, G. T. J. and Kim, Y. J.},
title = {The time index: an access structure for temporal data},
crossref = {proc:vldb:1990},
pages = {1--12}
}
% Implementation issues for the time index
@inproceedings{elmasri:1991:time-index,
author = {Elmasri, R. and Kim, Y. J. and Wuu, G. T. J.},
title = {Efficient implementation techniques for the time index},
crossref = {proc:icde:1991},
pages = {102--111}
}
% Improves the Time Index, which is a temporal index
@inproceedings{kouramajian:1994:time-index,
author = {Kouramajian, V. and Kamel, I. and Elmasri, R. and Waheed, S.},
title = {The time index$^{+}$: an incremental access structure for temporal databases},
crossref = {proc:cikm:1994},
pages = {296--303}
}
% Defines the multiversion isolation type, snapshot isolation
@inproceedings{berenson:1995:sql-critique,
author = {Berenson, H. and Bernstein, P. and Gray, Jim and Melton, J. and O'Neil, E. and O'Neil, P.},
title = {A critique of {ANSI SQL} isolation levels},
crossref = {proc:sigmod:1995},
pages = {1--10}
}
% Making snapshot isolation serializable
@article{fekete:2005:snapshot-isolation,
author = {Fekete, A. and Liarokapis, D. and O'Neil, E. and O'Neil, P. and Shasha, D.},
title = {Making snapshot isolation serializable},
journal = journal:acm-tods,
volume = {30},
number = {2},
pages = {492--528},
year = {2005},
publisher = {ACM Press New York, NY, USA}
}
% Performance of serializable SI
@inproceedings{alomari:2008:si-cost,
author = {Alomari, M. and Cahill, M. and Fekete, A. and Rohm, U.},
title = {The cost of serializability on platforms that use snapshot isolation},
crossref = {proc:icde:2008},
pages = {576--585}
}
% Serializable SI by detecting constraint failures
@inproceedings{cahill:2008:snapshot,
author = {Cahill, M. J. and Röhm, U. and Fekete, A. D.},
title = {Serializable isolation for snapshot databases},
crossref = {proc:2008:sigmod},
pages = {729--738}
}
% Partitions time-duration -space into triangular shapes
@inproceedings{shen:1994:tp-index,
author = {Shen, H. and Ooi, B. C. and Lu, H.},
title = {The {TP-Index}: a dynamic and efficient indexing mechanism for temporal databases},
crossref = {proc:icde:1994},
pages = {274--281}
}
% I think the lazy timestamping is introduced here
@article{torp:2000:timestamping,
author = {Torp, K. and Jensen, C. S. and Snodgrass, R. T.},
title = {Effective timestamping in databases},
journal = journal:vldb,
volume = {8},
number = {3--4},
pages = {267--288},
year = {2000},
publisher = {Springer-Verlag New York, Inc. Secaucus, NJ, USA}
}
% An index using hashing and accessor blocks etc.
@article{tsotras:1995:snapshot-index,
author = {Tsotras, V. J. and Kangelaris, N.},
title = {The snapshot index: an {I/O}-optimal access method for timeslice queries},
journal = journal:info-system,
volume = {20},
number = {3},
pages = {237--260},
year = {1995},
publisher = {Elsevier}
}
@article{tsotras:1998:notation,
author = {Tsotras, V. J. and Jensen, C. S. and Snodgrass, R. T.},
title = {An extensible notation for spatiotemporal index queries},
journal = journal:sigmod,
volume = {27},
number = {1},
pages = {47--53},
year = {1998},
publisher = {ACM}
}
% B-tree
@article{comer:1979:btree,
author = {Comer, D.},
title = {Ubiquitous {B}-tree},
journal = journal:acm-survey,
volume = {11},
number = {2},
pages = {121--137},
year = {1979},
publisher = {ACM Press New York, NY, USA}
}
@article{bayer:1997:ub-btree,
author = {Rudolf Bayer},
title = {The universal {B}-tree for multidimensional indexing: general concepts},
journal = {World-Wide Computing and Its Applications},
volume = {97},
pages = {198--209},