Mixed Ru^II Complexes Containing Diseleno‐Ligand and α,β‐Diketones Donors with Anticancer Activity. Synthesis, Characterization, Electrochemical and DFT Studies

9 A Complete Bibliography of Publications in the VLDB Journal: Very Large Data Bases Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 E-mail: beebe@math.utah.edu, beebe@acm.org, beebe@computer.org (Internet) WWW URL: https://www.math.utah.edu/~beebe/ 21 April 2026 Version 1.113 Title word cross-reference -anonymity [377, 304, 661]. -approximate [940]. -biclique [1083]. -closeness [512]. -closest [689]. -core [908, 728]. -cores [1200]. -gram [409]. -grams [570]. -hop [638]. -most [733]. -Nearest [164, 770, 499, 1174]. -NN [1069, 391]. -overlap [771]. -Path [714]. -reach [980]. -shortest [906]. -TM [708]. -tree [91]. -truss [961]. 6 (α, β) [908]. (p, q) [1083]. 10(10 ) [455]. 3 [496]. + [1053, 1098, 854, 1238, 23, 971]. 2 [1067]. 33 [708]. Π [91]. q [1196]. c [940]. ` [771]. K [685, 1174, 980, 1200, 1058, 429, 553, 581, 909, 638, 906, 391, 612, 798, 937, 1261, 1069, 377, 714, 770, 499, 995, 446, 254, 733, 1068, 304, 961, 488, 500, 939, 1061, 545, 789, 747, 1163, 1034, 1187, 489, 728, 694, 1188, 661, 342, 763, 901, 873, 757, 441, 717, 483, 774]. kk [651, 689]. l [744]. lp [779]. n [164, 409]. pq [570]. QR [1136]. s [964]. t [512, 964]. tt ~ [799]. [651]. Orpheus [885]. DAG 1999 [192]. 2-hop-labeling [1089]. 2005 [309]. 2007 [427]. 2008 [470]. 2010 [557]. 2011 [590]. 2012 [635]. 2013 [697]. 2014 [709]. 2015 [750, 749]. 2016 [812]. 2017 [883]. 2018 [887, 894]. 2019 [915, 930]. 2020 [1028, 1024]. 2021 [1084]. 2022 [1226]. * [92, 96, 94, 78]. 2 3 3D [1178]. 3X [475]. ‘98 [144]. ABC [1010]. absolute [854]. ABSTAT [1011]. ABSTAT-HD [1011]. Abstract [122]. Abstraction [132]. Accelerated [1045, 741]. Accelerating [725, 998, 1102, 1175, 830, 799, 1177]. acceleration [869]. Access [109, 52, 85, 130, 115, 147, 56, 1219, 208, 305, 809, 587, 370, 617, 955, 389, 368, 233, 169, 989, 335]. accessing [200]. account [1035]. Accounting [188]. Accuracy [473, 1206, 910, 1105]. accurate [231, 1158, 928, 856, 1033, 394]. achieving [304]. ACM [220]. ACME [666]. acquaintance [780]. across [1035, 805, 183]. Active [180, 108, 921, 74, 698, 1044, 1133, 1135, 1164, 387]. ad [105, 393]. Adapative [1032]. Adaptable [62, 439]. adapting [591, 1012]. Adaptive [824, 255, 1236, 562, 641, 725, 923, 351, 341, 1022, 1043, 648, 328, 716, 1173, 408, 746]. adaptivity [1059, 415]. Adding [813]. address [1079]. Addressable [334]. Aditi [36]. adjacency [1176]. adjustment [927]. ADS [1258, 1247, 746]. Advanced [118]. Adversarial [430, 1031, 1044, 1106, 1238]. Adversarial-knowledge [430]. advisor [699]. aesthetic [952]. against [1014]. agent [835]. agent-based [835]. aggregate [723, 265, 171, 1194]. aggregates [1085, 236]. aggregating [679]. aggregation [564, 712, 970, 541, 1077, 1104]. aggregations [276, 494]. aggregators [250]. agile [1019]. aging [1245]. agriculture [242]. ahead [561, 536]. AI [1070]. aided [1032]. alert [1101]. Alfa [1135]. Algebra [83, 55, 161, 818, 339]. Algebraic [80]. Algorithm [77, 139, 279, 745, 530, 423, 1107, 1205, 484, 189, 574]. Algorithms [1220, 310, 318, 245, 149, 975, 230, 1008, 429, 891, 637, 1036, 410, 674, 923, 732, 1032, 789, 870, 303, 379, 1093, 832, 728, 454, 23, 362, 972, 1152, 793, 1153, 1237, 1117, 774, 977]. alignment [1135, 1017, 1023]. all-purpose [335]. Allen [1097, 947]. Allocation [137, 439, 1005]. almost [1169, 773, 825]. almost-latch-free [1169]. Along [70, 69]. AlphaSort [66]. always [1198]. AMIE [702]. Amit [252]. among [449]. analyses [973, 1004, 310, 318, 729, 1013]. Analysis [160, 62, 139, 484, 93, 1236, 230, 558, 510, 530, 392, 637, 696, 283, 578, 411, 1256, 1071, 1072, 836, 1137, 1093, 191, 711, 958, 676, 844, 793, 1124, 1076, 1179]. Analytic [52, 1258, 1247]. analytical [722, 890, 643, 1204, 917, 1155, 1214]. analytics [669, 962, 520, 943, 850, 1132, 575, 1043, 836, 929, 1255, 715, 991, 938]. analyzing [1117]. Anatomy [215]. Anchored [986]. anchors [1232]. ANDES [589]. Anna [932]. annotated [616]. annotation [727]. anomalies [956, 634]. anomalous [389]. anomaly [969, 1054, 1206, 1130, 1072, 1246, 1125]. Anonymity [374, 534, 377, 304, 661]. anonymized [505]. Anonymizing [476, 513]. Answer [786, 690, 735]. Answering [297, 193, 747, 980, 657, 554, 245, 446, 660, 189]. answers [233, 343, 1194]. any [773, 825]. Anytime [429, 626, 1099, 1222]. AP [707]. AP-Tree [707]. Apache [960, 813, 1124]. applicability [929]. Application [1041, 405, 680, 158, 693]. Application-driven [1041]. Applications [400, 149, 2, 392, 612, 179, 714, 316, 324, 245, 789, 870, 547, 1134, 78, 620, 741, 435, 1145, 1237]. Applying [97, 1148]. Approach [45, 108, 148, 136, 90, 1257, 86, 152, 1225, 496, 421, 992, 558, 1096, 242, 795, 371, 768, 521, 1235, 735, 886, 845, 1144, 630, 927, 407, 788, 842, 384, 790, 1075, 408]. Approaches [132, 962, 877, 580, 1074, 1102, 369, 196, 1019]. Approximate [190, 188, 412, 646, 584, 133, 570, 859, 678, 4 751, 1081, 410, 396, 1146, 723, 1209, 940, 886, 1230, 352, 1188, 863, 1063, 1033]. Approximation [1042, 626, 923, 199, 352, 203, 668, 700]. approximations [1182]. arbitrarily [437]. arbitrary [1255]. ArchIS [407]. architectural [958]. Architecture [907, 228, 184, 169, 1165, 330]. Architectures [75, 745, 1216, 369, 546, 634]. archives [295]. archiving [518]. Area [76]. Argument [772]. array [344]. arrays [202]. art [946]. Articles [70]. ary [1173]. Assertions [3]. Assessment [449]. Assignment [74, 691, 477, 1100]. Assisted [1141]. Association [1228, 206, 290]. Asymptotically [89]. Attribute [512, 366, 1185, 234, 91, 844]. attributed [784, 1174, 1088]. attributes [274, 235, 789]. Auditing [599]. augmentation [1174]. Augmented [1076, 797]. Aurora [228, 264]. Authenticated [1258, 1247, 438]. authentication [478]. authority [1057]. authorization [201, 999]. Auto [1221]. Auto-tables [1221]. autocompletion [902, 765]. AutoCTS [1165]. AutoG [765]. automata [1095, 527]. automated [1126, 942]. Automatic [925, 257, 1213, 269, 712, 196, 634, 971]. automatically [617]. Automating [594, 271]. automation [593]. AutoML [1051, 1134]. Autonomic [415]. autonomous [461]. Autoscaling [932]. availability [592, 655]. averaging [960]. avoidance [934]. Avoiding [718, 731]. aware [535, 496, 1057, 334, 568, 1035, 840, 611, 911, 795, 779, 1130, 1192, 665, 928, 677, 1040, 1043, 353, 1156, 1196, 1202, 963, 707, 684, 952, 1100, 834]. axioms [811]. B [417, 89, 282, 23, 1250]. B-link [282]. B-Tree [89, 1250]. B-tries [417]. backchase [649]. backed [361]. BAD [921]. Balanced [1244, 282, 597]. Balancing [116, 265, 988]. Bandwidth [359, 897]. Bandwidth-constrained [359]. Base [49, 88, 84, 215, 754]. Based [148, 55, 11, 130, 29, 90, 149, 123, 152, 8, 92, 586, 417, 1057, 800, 166, 291, 161, 370, 819, 1096, 957, 1254, 234, 286, 678, 696, 247, 501, 935, 82, 569, 973, 764, 1081, 542, 911, 240, 725, 580, 487, 204, 400, 243, 1130, 418, 75, 246, 651, 693, 919, 411, 485, 1235, 361, 880, 662, 660, 1135, 1184, 1183, 383, 303, 835, 1137, 947, 902, 422, 945, 203, 272, 1181, 630, 661, 182, 811, 273, 397, 1142, 407, 358, 525, 713, 1091, 1170, 1094, 842, 793, 1157, 759, 573, 698, 920, 280, 802, 1207, 330, 843, 600, 483, 971, 1063, 1065]. based [790, 1100, 289, 408, 629, 799, 652, 700]. Bases [62, 54, 748, 702, 808, 1060]. basket [205]. batch [1098, 758]. batched [948]. BatchHL [1098]. Bayes [339, 381]. Bayesian [222, 435]. Bdual [356]. Bdual-Tree [356]. BEA [259]. Behavior [93, 1018]. Behavioral [60]. behaviour [160]. benchmark [468, 1162, 1023, 815]. benchmarking [852, 972, 1128]. BerlinMOD [468]. BERT [1137, 1139]. BERT-based [1137]. Best [64, 253, 144, 516, 915, 72, 557, 697, 883, 470, 812, 427, 309, 317, 709, 590, 750, 749, 635, 1024, 894, 873]. Better [948]. Between [90, 256, 524, 873]. Beyond [1231, 455, 1120]. bias [962]. bibsonomy [507]. bichromatic [548]. biclique [1034, 1234, 1083]. bicliques [1123]. bidirectional [978, 811]. big [669, 984, 914, 879, 943, 824, 792, 823, 730, 988, 1065, 878, 921, 710, 662]. billion [951, 732, 963]. billion-edge [963]. billion-scale [951, 732]. binary [1120, 364, 792]. Binding [113]. BioGITOM [1239]. bioinformatics [286, 287]. Biomedical [1239]. bipartite [476, 1172, 908, 1175, 1234, 985, 1045, 1152, 1083, 1123, 1078]. biplex [1175, 1234]. Bit [137, 724]. bit-vectors [724]. bitemporal [197]. bitmap [563]. bitruss [985, 1078]. Bitwise [722]. blending [645]. Block [137]. 5 blockchain [1166, 1127]. blockchains [931]. blocking [954]. blocks [916]. Bloom [1059]. bolt [885]. bolt-on [885]. bone [921]. bookmark [507, 503]. Boolean [849]. bottleneck [169]. bottom [1099, 1222]. bottom-up [1099, 1222]. bound [219]. bounded [347, 623, 1081, 300, 399, 657, 668]. bounded-size [347, 623]. bounds [298, 653]. Boyce [1197]. bricolage [752]. bridging [873]. broadcast [452]. bucket [388]. Bucketization [512]. buddies [533]. budget [939]. Buffer [52, 8, 293]. Buffering [146]. Buffers [68]. BugDoc [1038, 1056]. Building [833, 88, 916]. built [1227, 509]. built-in [1227, 509]. Business [224]. Business-to-business [224]. Butterfly [1078, 1045, 1154, 1157]. ByShard [1092]. Byzantine [1092]. C5 [1198]. Cache [313, 321, 66, 947, 497, 329, 739, 1201, 546]. Cache-conscious [313, 321]. Cache-efficient [947]. Cache-Sensitive [66]. Caching [64, 75, 123, 65, 157, 361, 1168, 546]. Calculus [29]. Calibrating [676]. capabilities [509, 1082]. cardinalities [263]. Cardinality [820, 1109, 809, 235, 630]. Cascade [840]. Cascade-aware [840]. case [960, 226, 970, 653, 771]. Categorical [148, 464]. categorization [1032]. categorized [953]. causal [1022]. CDBTune [971]. cell [731, 412, 432]. CellJoin [432]. centric [570, 696, 547, 715, 1144, 1070, 896, 794]. century [810]. certain [560, 734]. CG [1067]. Chain [123, 1031]. Chairmen [144, 143]. challenges [877, 888, 1070]. change [1094]. changes [464, 258]. Characterization [52, 737]. Checking [162, 552]. checkpoint [1129]. checks [934]. Chronological [27]. citizens [275]. CLARO [579]. class [275, 232, 1079, 718]. classes [718]. Classification [124, 132, 231, 1069, 487, 1079, 1160, 796, 381, 1164]. clause [1119]. Cleaning [900, 949, 1238, 1094]. Client [118, 114, 75, 103]. Client-Server [75, 103]. Client/Server [118, 114]. Clip [131]. clique [905, 717, 1259]. cliques [841, 1002]. cloned [1198]. closed [987]. closeness [512, 188]. closest [689, 1033]. closure [586]. cloud [664, 778, 1216, 665, 727, 715, 827, 932, 1161, 971, 999]. ClouDiA [699]. clouds [1128, 675, 699]. clues [679]. cluster [941, 781]. clustered [674]. Clustering [148, 679, 152, 833, 722, 800, 464, 327, 1004, 371, 336, 621, 1174, 1122, 1047, 842]. clusters [443]. co [722, 1260]. co-clustering [722]. co-movement [1260]. Coalition [1100]. Coalition-based [1100]. coarse [541]. Coconut [860]. Codd [1197]. code [821, 1195]. cognizant [191]. coherent [851]. Cohort [1245, 929]. cold [856]. collaboration [404]. Collaborative [277, 637, 1067, 826]. Collection [125, 422, 1070]. collections [240, 212, 831]. collective [1235, 899]. Color [120]. Color-Spatial [120]. Column [15, 16, 378]. combination [357, 606]. combinations [789]. combines [907]. Combining [172]. commerce [179, 1031, 1020, 182]. Commercial [101, 100, 192]. Commercialize [35]. communication [628]. communities [782, 924]. community [1053, 784, 914, 879, 961, 1020, 866]. Compact [846, 1110, 1037]. CompactLTJ [1241]. Comparable [601]. Comparative [139, 858, 1230, 1124]. Comparing [881]. Comparison [946]. comparisons [729]. competition [831]. competitiveness [1103]. compilation [1025, 967]. compiled [895]. complements [194]. Complete [83, 378, 233, 811]. completion [1099, 1222]. Complex [71, 982, 878, 221, 450, 24, 1076]. Complexity [56, 540]. compliance [349]. components [178]. Composing [241, 287, 242]. composite [411]. 6 composition [354]. comprehensive [1023]. compress [724]. Compressed [818, 1176, 893, 333, 419, 672]. compressing [903]. Compression [1250, 331, 92, 680, 1158, 918, 981, 938]. Compressive [672]. computation [586, 881, 817, 905, 951, 979, 310, 318, 1068, 633, 908, 473, 412, 236, 1161, 907]. computational [848]. compute [896]. computers [415]. Computing [233, 602, 530, 613, 733, 1042, 383, 277, 827, 941, 682, 997]. Concept [272]. Concept-based [272]. Concepts [118]. conceptual [783, 803, 607, 1214]. Concurrency [9, 282, 104, 99, 21, 520, 91, 1198, 23, 773, 825, 1117]. Conditional [688, 632]. conductance [529]. confidence [939, 290]. Configurable [110, 111]. Configuration [41, 30]. conflict [1210]. conflicts [406]. Conformity [677]. Conformity-aware [677]. conjunctive [726, 596, 889, 827]. Connection [113]. Connectivity [1248, 1096]. connectivity-based [1096]. conscious [313, 321, 329]. Considering [20]. Consistency [81, 587, 13, 54, 634, 640, 492, 655, 258]. Consistent [14, 312, 320, 13, 1232, 1129, 546]. consistently [492]. Consolidation [7, 91]. Constant [137, 970]. Constrained [472, 327, 359, 1208, 1134, 835, 964, 1188, 1118]. constraint [401, 327, 1062, 602, 761]. Constraints [40, 61, 117, 13, 820, 39, 817, 531, 980, 1090, 776, 949, 922, 622, 780]. constructing [284]. construction [410, 204, 854, 754]. Consumption [8]. containing [814]. Containment [420, 807, 968, 950]. contended [1029]. Content [45, 130, 504, 1066, 334]. Content-Addressable [334]. content-and-structure [1066]. Content-Based [130]. Context [166, 911, 90, 422, 684, 834]. Context-aware [911, 684, 834]. Context-Based [90, 166, 422]. Continuous [553, 937, 526, 129, 995, 137, 478, 673, 477, 496, 294, 992, 581, 463, 263, 721, 385, 718, 543, 670, 574]. Continuous-Media [129]. continuous-time [992]. contraction [1037]. Control [9, 99, 21, 587, 370, 327, 935, 1198, 282, 895, 368, 939, 23, 773, 825, 1117]. convergence [859]. Conversational [1249]. conversations [413]. Convex [1253]. Cooperative [2, 1244]. coordination [934]. copy [1057]. copy-based [1057]. CORAL [34]. core [921, 908, 1208, 870, 728, 851]. coreness [986]. cores [1026, 1200]. coroutines [845]. corpus [400]. corpus-based [400]. Correction [1054, 914, 1055, 1166, 1056, 1222, 1258, 1104, 968, 1105]. correctness [78]. Correlated [656, 1165]. correlating [559]. correlation [743, 824, 528, 1065, 1115]. correlations [688, 457, 1115]. corrupted [1014]. Cost [803, 232, 1202, 766, 819, 1147, 532, 948, 1216, 955, 1192, 919, 768, 251, 222, 1091, 642, 408]. Cost-aware [1202, 1192]. cost-based [919, 1091, 408]. Cost-driven [232]. Cost-effective [803, 819, 642]. cost-efficient [1147]. cost-oriented [768]. cost/performance [948]. costly [397]. Costs [77, 105, 795]. counter [895]. Counting [125, 1218, 1081, 928, 704, 399, 1045, 1154, 1157, 1083, 1075, 1078]. counts [1189]. covering [922]. covers [1203, 714]. CoVis [1249]. CPU [646, 781]. CQL [294]. cracking [711]. crawling [593]. Creating [460, 726]. creation [563, 892]. criteria [78]. critical [1172]. Cross [1031, 919, 922]. Cross-chain [1031]. cross-platform [919]. cross-range [922]. crowd [615, 1032]. crowd-aided [1032]. crowd-sourced [615]. crowds [621]. crowdsensing [1192]. Crowdsourced [939, 819, 920]. Crowdsourcing [1244, 619, 786, 772, 691, 875, 1151, 1100, 1005]. cryptanalysis 7 [1150]. cube [375, 482, 371]. cuckoo [893]. curious [533]. current [783, 877]. curves [356]. custom [821]. customer [733]. customizable [1195]. customizing [179]. cut [1156]. Cyclic [125]. D [496]. DaMoN [915, 1024, 894]. dampening [1086]. dashboard [506]. Data [209, 44, 703, 1147, 50, 118, 431, 107, 148, 1021, 55, 4, 20, 137, 1030, 150, 976, 1055, 47, 1204, 1257, 94, 147, 13, 1258, 1247, 53, 116, 30, 122, 152, 79, 28, 1070, 228, 428, 695, 664, 933, 230, 925, 1185, 669, 838, 208, 429, 778, 570, 1057, 262, 962, 268, 1260, 984, 969, 1054, 1052, 618, 615, 291, 558, 161, 315, 323, 912, 520, 298, 229, 430, 463, 464, 656, 775, 909, 957, 654, 285, 173, 476, 471, 223, 327, 619, 518, 696, 306, 451, 1069, 560, 302, 753, 377, 593, 563, 283, 650, 900, 260, 540]. data [1229, 537, 270, 460, 580, 810, 565, 373, 515, 1009, 813, 219, 351, 243, 1210, 712, 462, 1158, 860, 443, 919, 665, 256, 194, 621, 1060, 364, 500, 936, 1169, 1212, 445, 1256, 926, 824, 1014, 1106, 1163, 729, 874, 200, 688, 534, 385, 1183, 375, 205, 475, 1050, 466, 292, 836, 393, 686, 974, 1238, 511, 871, 1006, 872, 892, 1141, 865, 931, 620, 792, 990, 203, 197, 454, 1144, 187, 265, 412, 1150, 630, 491, 601, 661, 676, 796, 513, 342, 855, 823, 1193, 603, 579, 1195, 655, 844, 326, 672, 1091, 1173, 1094, 631, 461, 435, 827, 901, 1124]. data [573, 1145, 681, 1076, 698, 920, 910, 1105, 1207, 486, 248, 384, 941, 896, 1065, 452, 408, 746, 822, 878, 921, 710]. data-adaptive [1173]. data-centric [570, 696, 1144, 1070]. Data-induced [1030]. data-intensive [664]. data-oriented [306]. Database [40, 61, 52, 33, 6, 146, 43, 114, 11, 212, 90, 75, 35, 139, 95, 80, 32, 93, 132, 76, 56, 17, 36, 380, 22, 37, 48, 39, 370, 562, 234, 338, 594, 948, 869, 753, 751, 1015, 1186, 42, 316, 324, 1227, 1133, 400, 214, 332, 138, 256, 174, 758, 752, 599, 361, 1129, 169, 94, 592, 172, 1136, 1159, 106, 186, 31, 78, 458, 701, 711, 1150, 741, 1139, 192, 407, 1145, 971, 1073]. database-backed [361]. database-driven [256]. Databases [51, 59, 1241, 141, 155, 350, 41, 1228, 124, 108, 129, 4, 7, 130, 38, 154, 126, 86, 128, 153, 53, 125, 122, 152, 74, 151, 858, 209, 275, 496, 833, 268, 1131, 481, 846, 163, 96, 301, 285, 344, 337, 965, 840, 247, 627, 468, 609, 82, 853, 626, 232, 267, 526, 453, 460, 446, 885, 254, 495, 396, 712, 389, 1132, 368, 805, 521, 583, 743, 514, 545, 667, 660, 307, 426, 393, 1039, 372, 738, 457, 343, 589, 1108, 584, 904, 461, 604, 308, 438, 658, 765, 330, 600, 683, 797, 571, 577, 554]. datalog [798, 610, 966, 760]. Dataset [876, 1103]. datasets [847, 250, 347, 493, 383, 624]. dataspace [973]. dataspace-based [973]. DAWN [373]. DB [885, 1139]. DB&IR [340]. DB-BERT [1139]. DBMS [428, 480]. DBMSs [1204, 372, 1161, 642]. DBOS [1211]. DBSP [1213]. DBToaster [639]. DCT [373]. Deadlock [139]. Dealing [56]. deals [1031]. debugging [1021, 1038, 1056]. decentralized [1196]. decidability [706]. decision [962, 1254, 167, 222]. Declarative [109, 159, 966]. DECLARE [35]. Decomposition [1233, 1096, 1051, 870, 1136, 728, 985, 762, 1237, 1078]. decompression [918]. Decorating [727]. decoupling [1121]. dedicated [415]. Deductive [33, 35, 34, 32, 36, 37, 31]. Deep [1044, 1022, 209, 617, 593, 1074, 1122, 1246, 713, 1070, 1080, 1145, 971]. DeepDive [754]. definitions [555]. Delay [353]. Delivering [134]. delta [639]. Demarcation [40, 39]. denial [1090]. denormalized [268]. Dense [636]. Densest [1253, 1102, 1153]. Density [1253, 1237]. Dependencies [27, 596, 555, 1146, 976, 1055, 1010, 1230, 978, 601, 811, 975, 461, 1203]. Dependency [300, 632, 719, 524, 802]. dependent [1243, 1061]. Deploying [363]. deployment [699]. Depth [433, 852, 327, 1169, 1179]. derived [551]. descent [1145]. description 8 [358]. Design [33, 555, 62, 2, 53, 84, 783, 472, 529, 803, 405, 1106, 1141, 990]. Designing [178]. designs [609]. desired [1006]. desktop [405, 501]. destination [588, 681]. Detecting [389, 1050, 464, 688]. Detection [139, 279, 1008, 969, 1054, 1206, 721, 764, 953, 1130, 336, 719, 1020, 1183, 490, 956, 1246, 1125, 348, 634, 644, 1115]. detectors [1072]. deterministic [298, 527]. devices [877]. DHL [1243]. DHT [544]. diagram [604, 604]. Dictionary [92, 678, 918]. Dictionary-based [92, 678]. DIFF [933]. different [173, 1115]. Differential [10, 656, 1086, 1015, 704, 661]. Differentially [1194, 625, 796]. differentiated [718]. digest [426]. digital [201, 422]. dimension [420]. Dimensional [154, 47, 46, 279, 722, 463, 168, 614, 854, 1191, 1255, 203, 328, 1188, 176, 548, 441, 248, 1033]. dimensionality [328]. dimensions [430, 551]. DIRECT [1129]. Directed [1233, 1102]. Direction [542]. Direction-based [542]. directions [1204, 363]. directly [938]. disaggregated [1170]. disclosure [307]. discord [1112]. discoveries [732]. Discovering [1172, 1146, 1006]. discovery [925, 374, 1260, 271, 913, 1210, 1003, 743, 528, 772, 1047, 1090, 620, 978, 221, 811, 290, 603, 975, 1153, 866]. Discrete [44]. discriminant [510, 231]. Disjoint [769]. Disk [116, 417, 489]. disk-based [417]. disk-resident [489]. Disseminating [408]. Dissemination [333, 544]. Dissociation [751]. Distance [1251, 149, 981, 881, 588, 530, 1243, 391, 996, 1098, 613, 1107, 437, 862, 303, 1089, 1149, 902, 868, 603, 397, 657, 761, 622, 573]. Distance-Based [149, 303, 902]. Distances [164]. Distilling [808]. Distributed [40, 671, 551, 139, 991, 956, 76, 1233, 767, 1225, 39, 1052, 859, 451, 935, 764, 1015, 960, 566, 304, 903, 238, 1201, 686, 849, 720, 439, 978, 630, 325, 646, 988, 802, 687, 781, 861, 452, 907]. Distribution [28, 1147, 392, 1021]. distributional [1125]. Dittrich [345]. dive [1246]. divergence [895]. Diverse [744, 1068]. Diversified [912, 717, 1034, 851]. Diversifying [1046]. diversity [654, 685, 662, 1151]. DNA [212]. doctor [1242]. Document [109, 123, 17, 291, 301, 240, 955, 490, 18, 831]. Documents [50, 162, 447, 218, 217, 616, 187]. domain [1057, 1079, 1146, 672]. domain-aware [1057]. dominating [549, 441, 483]. down [186]. DP [1205]. Dragoon [943]. Driven [1249, 627, 1041, 232, 712, 256, 1166, 1127, 940, 1143, 1151]. drives [740]. DTDs [448]. dual [530, 281, 398, 356]. dual-tree [530]. DumpyOS [1173]. duplicated [460]. during [406, 1014]. Dynamic [531, 164, 293, 1251, 28, 658, 423, 841, 937, 996, 1098, 753, 889, 1049, 639, 368, 364, 1064, 1138, 292, 379, 251, 170, 620, 1082, 1101, 328, 922, 830, 837, 767, 1237, 408]. Dynamical [148, 791]. dynamically [597]. Dynamics [95, 106]. DynQ [1082]. e-commerce [179, 1020, 182]. e-services [178, 183, 180]. Early [35, 167, 940]. early-termination [940]. Earth [573]. ECC [762]. Eccentricities [857]. Edge [1253, 636, 1096, 963]. edit [881, 1107, 902, 761, 622]. edit-distance [761]. editing [560]. Editorial [207, 155, 1028, 1226, 213, 1084, 930, 266, 887, 165, 237, 156, 225, 177, 402, 867, 185, 302, 260, 121]. Editors [346]. Effective [784, 1087, 811, 151, 713, 279, 1206, 819, 803, 954, 1209, 871, 335, 573, 1153, 1088, 843, 642, 1164]. effectively [690]. effectiveness [246]. effects [462, 1245]. efficiency [1000, 731, 929, 832, 508, 706, 265, 605]. Efficient [1241, 1260, 218, 905, 951, 638, 217, 423, 337, 798, 306, 814, 1004, 954, 689, 1220, 567, 499, 137, 923, 1133, 854, 539, 719, 142, 364, 536, 9 743, 1061, 445, 908, 1208, 1201, 490, 205, 86, 379, 489, 416, 964, 902, 198, 945, 978, 434, 1150, 1188, 1234, 399, 362, 1152, 842, 498, 573, 899, 1153, 807, 687, 896, 866, 861, 622, 790, 1225, 571, 629, 1115, 279, 496, 455, 497, 745, 606, 992, 1206, 821, 817, 1199, 227, 1147, 344, 1243, 637, 1171, 784, 943, 569, 316, 324, 1227, 373, 446, 1068, 961, 578, 485, 633, 174, 1166, 1127, 986, 940, 1178, 785, 816, 426, 172, 1168]. efficient [484, 1089, 947, 871, 544, 931, 589, 342, 855, 1193, 335, 844, 904, 985, 585, 384, 762, 682, 971, 1217, 774, 1259]. Efficiently [581, 10, 38, 187, 591, 773, 1218, 1112, 250, 770, 707, 825]. Efforts [35, 786]. EGO [614]. EI-LSH [940]. Elastic [546, 730]. elasticity [655]. elicitation [517]. eliminate [492]. Eliminating [628]. Elite [730]. embedded [1082, 975]. Embedding [693, 1201, 944, 1101, 1088, 1207, 942, 997, 554]. Embedding-based [693]. embeddings [1179]. emerging [850, 313, 321]. empty [735]. empty-answer [735]. enabled [183, 1117]. Enabling [1171, 355, 486, 492, 727, 224]. encoding [1124]. Encrypted [1251, 1150, 827]. encryption [1101]. end [1051]. end-to-end [1051]. endurable [411]. Energy [208, 1229, 265]. Energy-performance [208]. engagement [866]. engine [219, 1040, 475, 917, 1082, 652]. Engineering [497, 962, 659]. engines [993, 608]. Enhanced [122, 1192]. Enhancing [1057, 388, 661, 777]. ensembling [620]. Ensuring [654]. enterprise [1060]. entities [953]. entity [421, 819, 678, 1044, 621, 1087, 1162, 1137, 1093, 465, 624, 631, 1179, 1017, 797, 1023]. entropy [312, 320]. EntropyDB [886]. Enumeration [964, 905, 768, 1083]. Environment [1, 8, 1092, 277, 251, 408]. Environments [64, 65, 566, 544]. epiC [710]. epoch [1169]. Equivalence [444, 726]. equivalences [1049]. Equivalent [26]. era [878]. Eris [1112]. eRiskCom [1020]. Erratum [750, 106, 825]. error [298, 373, 854, 902, 399, 668, 452]. error-bounded [668]. error-prone [452]. Establishment [449]. estimate [473]. estimates [1036]. Estimating [1189, 68, 396]. Estimation [28, 809, 551, 373, 168, 312, 320, 433, 630, 591, 1142, 830, 1109]. estimators [274, 418]. ETL [783]. eTuner [314, 322]. Euclidean [553, 437, 862, 303]. Evaluating [1176, 853, 250, 872, 269]. Evaluation [33, 1250, 496, 367, 1111, 337, 73, 1113, 459, 946, 484, 415, 792, 728, 711, 1144, 607, 589, 868, 171, 829, 498, 598, 1259]. Event [882, 114, 528, 644, 982, 523, 878, 1183, 450]. events [882]. eventual [640]. everything [597]. evidence [357]. Evolution [141, 70, 594, 1116, 1015, 69]. Evolutionary [251]. evolving [721, 347]. Exact [723, 1008, 429, 588, 437, 489, 837, 657, 108]. ExactSim [972]. example [555, 1212]. examples [1221]. executing [287]. Execution [97, 20, 294, 821, 1199, 552, 608, 1085, 967, 411, 816, 385, 999]. executions [1056]. Exemplar [742]. experimental [82, 1191, 729, 711, 873, 977]. experiments [1013]. expert [406]. explainable [882, 1108]. Explaining [884]. explanation [933, 1038, 1056]. explanations [1016, 1194]. Explicit [53]. exploitation [824, 1065]. Exploiting [167, 1079, 1209, 738, 725, 457]. exploration [406, 1004, 1133, 174, 1043, 1006]. Exploratory [618, 1004, 836, 904]. Exploring [256, 831, 627]. exponential [1036, 332]. expression [263]. expressions [218, 227, 706]. expressive [637]. expressiveness [456]. Extended [112, 65, 885, 947, 888, 1214]. Extending [610, 372, 479]. Extensible [108, 53, 293, 710, 138]. extension [739, 326]. extensions [1120]. External [731, 66, 968, 950, 331]. extracting [666]. extraction [678, 593]. extreme [663, 435]. 10 F [1132]. F-IVM [1132]. facet [1137]. faceted [1039]. facilities [801]. Factor [20]. factorization [849]. Failure [1, 411]. Failure-Prone [1]. Fairness [994, 1100]. family [1059, 335]. Fast [1008, 231, 532, 996, 702, 756, 1049, 135, 120, 849, 898, 974, 1012, 856, 851, 893, 614, 1107, 967, 918, 801, 963, 672, 910, 1105, 331, 1033]. Fast-adapting [1012]. Faster [918, 398]. fault [859]. favorite [651]. Feature [112, 124, 1079, 1121]. feature-oriented [1121]. features [480, 172, 952]. Federated [141, 4, 7, 56, 1160, 1166, 1127, 1012]. federation [1193]. FedST [1160]. feedback [406, 158, 1130, 462]. FENECIA [411]. FERRARI [904]. Fetches [68]. Fibonacci [59]. FICOM [1164]. file [332, 386, 907, 371]. Files [119]. filling [356]. filter [1059]. filtering [218, 1162, 544, 856]. filterings [606]. Filters [97, 893]. Finding [766, 906, 806, 651, 782, 924, 694, 261, 1253, 471, 770, 1163, 988, 794]. Fine [1047, 931]. Fine-grained [1047, 931]. Finite [68, 527]. Firm [146]. first [275, 913, 810]. first-class [275]. first-sight [913]. fixes [560]. Flash [739, 877, 731, 474]. flexibility [1140]. Flexible [81, 344, 114, 1158, 305, 723]. FlexpushdownDB [1161]. Fliggy [1080]. flow [895, 1109]. flows [538]. Flying [967]. focus [355]. forecasting [982, 674, 1165]. forest [1062]. Foreword [502, 143, 144]. Form [361, 787, 595, 1197]. Form-based [361]. Formal [966, 210, 195]. formation [826]. formats [805, 1204]. forms [617]. formulations [793]. forward [827]. forwarding [334]. FOSS [1242]. found [815]. foundation [1256]. foundations [294]. Four [1218, 235]. Four-Node [1218]. Fourier [303]. Fourier-related [303]. FPGAs [869, 550]. fractional [992]. fractured [226]. fragmentation [1015]. fragmented [140]. Framework [1252, 230, 692, 618, 512, 819, 464, 1035, 1254, 405, 637, 518, 678, 973, 269, 316, 324, 373, 1180, 1177, 1068, 304, 485, 828, 1174, 480, 1067, 835, 439, 963, 1214, 844, 1142, 425, 904, 1091, 585, 988, 987, 920, 765, 761, 479, 1164, 1117, 1033]. frameworks [764]. Free [334, 1036, 1169, 355]. frequent [423, 401, 471, 596, 313, 321, 583, 666, 442, 987, 384]. frequently [639]. fresh [639]. Freshness [153, 256]. friendly [1008]. Fu [1193]. full [1026, 409, 536, 1196, 544, 1145]. full-graph [1196]. full-text [409, 536, 544]. fully [996]. function [726]. Functional [145, 632, 596, 555, 1230, 975, 1203]. Functional-Join [145]. functions [705, 650, 361]. further [729]. fusion [1057, 1183]. future [877, 1204]. fuzzy [429, 536, 582]. G [988]. G-thinker [988]. gain [290]. game [534, 920]. game-based [920]. gap [1036]. gaps [693]. Garbage [125]. GARF [1238]. gbase [578]. GCN [1018]. General [889, 13, 1013, 692, 223, 689, 1103, 1091, 988, 987, 479]. general-purpose [987]. generalized [606, 498]. Generating [821, 13, 1195, 822, 667]. Generation [124, 1249, 535, 703, 814, 836, 1143]. generative [1106, 1238]. Generator [115]. generators [1013]. Generic [465, 1252, 421, 786, 1068, 1163]. Genericity [380]. genomic [584]. Geo [780, 909, 957, 935, 533, 1188, 705]. geo-distributed [935]. Geo-social [780, 533, 705]. geo-tagged [1188]. geo-textual [909, 957]. geometric [386]. geometry [848]. GeoSparkViz [941]. geospatial [941]. gigabytes [864]. GIST [758]. Given [164]. Givens [1136]. glass [815]. Global [195, 21, 671, 513]. globally [671]. Glue [33]. Glue-Nail [33]. GMAP [79]. GNN [1053]. GNNs [1164]. Go [801]. good [1128, 1191]. Gossip [935, 630]. Gossip-based [935, 630]. GPS [1073]. GPU [745, 1180, 998, 741, 646, 1157, 781]. GPU-accelerated [741]. GPU-based 11 [1157]. GQL [1228]. gradient [903, 1145]. grading [703]. GRADOOP [991]. GRAIL [572]. grained [1047, 931]. gram [409]. grammars [366]. grams [570]. granularities [173, 541]. Graph [1241, 1228, 1239, 776, 683, 1095, 1008, 1110, 881, 984, 529, 1096, 1053, 532, 476, 841, 965, 840, 1041, 721, 764, 913, 1126, 1227, 1180, 175, 928, 583, 1209, 1121, 1135, 1099, 1222, 1067, 989, 1190, 835, 1156, 1196, 715, 991, 888, 1101, 927, 1108, 904, 842, 793, 1013, 988, 765, 843, 600, 762, 942, 1023, 622, 554, 652]. graph-based [652]. graph-theoretic [175]. graph-theoretical [927]. graphic [670]. Graphical [96, 758, 591]. Graphs [1251, 1233, 1248, 1218, 993, 838, 839, 905, 951, 1037, 879, 770, 1180, 1177, 961, 578, 908, 1071, 1175, 720, 980, 1011, 888, 963, 1197, 716, 1234, 420, 830, 985, 1045, 1152, 1001, 657, 1083, 1123, 572, 1200, 682, 861, 1237, 1078, 605, 774, 851, 914]. GRELA [1209]. Grid [289, 680]. Grid-partition [289]. ground [972]. group [814, 836, 826, 508, 780]. group-by [814]. grouping [1158]. groupings [476]. groupjoin [814, 1085]. groups [694, 362, 829]. Growing [616]. gStore [652]. guaranteed [1000]. guarantees [1069, 1050, 657]. guarding [1014]. Guessing [435]. Guest [346, 165, 237, 155, 156, 225, 177, 402, 185, 302, 213, 121, 930, 260]. Guided [394]. Haar [854]. Hadoop [648]. HaLoop [558]. Handling [61]. hard [724]. hard-to-compress [724]. Hardware [736, 737, 561, 1102, 816, 1167]. Harvesting [519]. Hash [97, 280, 1111, 725, 1059, 945]. Hash-based [280, 725, 945]. hashing [779]. HAVING [458]. hB [91]. HD [1011]. HE-Tree [464]. heavily [1134]. heavy [688]. HERMES [1060]. Heterogeneity [141, 136]. Heterogeneous [6, 3, 1225, 481, 821, 96, 285, 179, 1079, 1192, 178, 1047, 183, 601, 781]. HeteroStamp [1192]. Heuristic [102]. heuristics [881]. HFUL [1035]. hide [845]. Hierarchical [124, 371, 307, 99, 1096, 1097, 1243, 753, 390, 336, 1154, 1217]. Hierarchically [419]. Hierarchies [123, 2, 209, 482]. Hierarchy [110, 111, 1089, 897]. High [47, 84, 655, 67, 605, 279, 817, 520, 935, 973, 1229, 592, 897, 203, 328, 1188, 176, 972, 966, 248, 1033]. high-bandwidth [897]. High-Dimensional [47, 279, 203, 328, 1188, 176, 248, 1033]. high-energy [1229]. High-Level [84]. high-order [817]. high-performance [935]. high-precision [972]. high-variety [973]. higher [639]. higher-order [639]. Highly [1052, 753, 566, 1158, 1195, 574]. Hilogx [1130]. HINT [1097]. Hippocratic [307]. histogram [625]. Histograms [358, 388, 530]. Historical [69, 70, 1248, 333, 801, 910, 1105, 1200]. History [147]. Hit [52, 983]. hitters [688]. HMAP} [173]. HMI [1217]. hoc [393, 105]. Holism [469]. holistic [250, 764, 735, 1075]. Hop [964, 638, 1062, 1089]. Hop-constrained [964]. hot [261]. HPCache [1168]. Hu [1193]. Hu-Fu [1193]. Hub [1251, 700]. huge [1201]. human [249, 540, 1130]. Humming [693]. Hybrid [724, 621, 1257, 1035, 943, 616, 1155, 289]. Hyper [1149]. Hyper-distance [1149]. hypercores [1064]. HyperFile [50]. Hypergraph [1120]. Hypergraphs [113, 1064, 1208, 1149]. hyperparameter [1165]. HyperStorM [109]. Hypervideo [130]. hypothesis [836]. I/O [948, 961, 940, 762, 682, 774]. I/O-efficient [774]. ICS [1053]. ICS-GNN [1053]. identification [636, 234, 505, 1234]. identify [962]. Identifying [1123]. IDList [629]. II [7]. Image [45, 120, 172, 424]. Images [132]. imbalance [1079]. Impact [101, 737, 100]. Implantation [141]. Implementation 12 [33, 118, 6, 84, 24, 195, 138, 828]. Implementing [354, 166]. Implication [117]. implications [380]. implicit [1146]. imprecise [315, 323]. Improve [153, 1080]. improvements [729, 1013]. Improving [97]. Imputation [1257]. In-database [1186, 758, 1145]. in-depth [852, 1179]. In-Memory [959, 869, 974, 945, 958, 781, 1033]. in-network [538]. In-order [970]. inapproximability [1042]. incentive [1166, 1127]. incentive-driven [1166, 1127]. including [1076]. inclusion [596]. incomplete [455, 1202, 865, 491, 461]. incorporated [411]. increasing [731]. Incremental [841, 6, 1090, 754, 728, 927, 631, 236, 1213, 1126, 940, 379, 1091]. Independence [79, 810, 351, 771]. Independent [3, 559, 403, 194, 829, 788]. indeterminacy [173]. Index [41, 529, 1240, 47, 104, 110, 86, 68, 227, 532, 1097, 1243, 91, 235, 409, 1138, 111, 845, 1181, 325, 1173, 842, 572, 1207, 600, 289, 452, 629, 746]. index-based [842]. indexes [1111, 563, 204, 860, 1191, 1170, 753]. Indexing [775, 877, 164, 295, 281, 86, 538, 197, 288, 176, 1219, 1232, 447, 451, 501, 641, 212, 740, 437, 1208, 1043, 172, 974, 648, 395, 203, 328, 922, 397, 1066, 438, 356]. Indices [135, 17, 388, 18]. individual [1144]. induced [1030]. inequality [756]. inference [847, 748, 552, 751, 487, 758, 1022, 1014, 1217]. influence [992, 923, 677, 1231]. influential [782, 1007]. InfoQuilt [221]. Information [49, 120, 1019, 17, 455, 160, 338, 405, 333, 580, 1030, 246, 416, 1202, 439, 18, 273]. information-theoretic [580]. infrastructure [664, 1113, 730]. Ingress [1126]. insecure [527]. Instance [234, 440, 653]. Instance-based [234]. Instance-level [653]. instant [1129]. Instantiating [38]. integrability [1210]. integrable [1210]. Integrated [123]. Integrating [291, 179, 126, 132, 160, 617, 368, 178]. Integration [3, 406, 1147, 234, 338, 405, 619, 431, 257, 1210, 462, 534, 792, 698]. Integrator [257]. Integrity [61, 85, 117, 162, 192]. intelligence [506]. intensive [664, 443, 691, 1181]. inter [206]. inter-transactional [206]. Interaction [535, 96, 528, 716]. Interaction-aware [535]. Interactions [1249, 1192, 224, 777]. Interactive [142, 162, 934, 1053, 1133, 645, 872, 424]. Interactively [1006]. interest [944]. interesting [556, 688]. interface [933, 1108]. interfaces [858, 257, 1214]. Interleaving [845]. intermediate [731]. Internal [950, 968]. Internet [181, 466, 630, 182]. Internet-based [182]. Internet-scale [466, 630]. interoperability [1150]. interpretable [1238]. intersection [1182, 670, 574]. intersections [1177]. Interval [959, 769, 1097, 1182, 947]. intervals [173]. InterViso [56]. Intrinsic [136]. Introduction [338, 43, 127, 128, 32, 42, 31]. intrusion [336]. inverse [514]. inverses [586]. Inverted [17, 18]. investments [895]. involving [175]. IoTDB [1124]. IR [344]. Islands [737]. isolation [671, 721]. Isomorphism [1239]. Issue [57, 736, 1226, 43, 1084, 128, 32, 17, 516, 915, 838, 22, 37, 48, 63, 557, 1131, 697, 883, 984, 615, 470, 402, 812, 338, 302, 283, 427, 260, 537, 309, 317, 453, 1009, 709, 590, 750, 749, 1167, 930, 635, 1024, 894]. Issues [1, 118, 9, 623, 224, 369, 706, 363]. items [471, 1163]. itemset [392, 384]. Iterative [1038, 1056, 558]. itinerary [1080]. IVM [1132]. Java [380]. Join [145, 97, 267, 77, 20, 135, 1205, 102, 814, 569, 432, 105, 254, 614, 311, 319, 816, 1142, 837, 807, 968, 950, 574, 815]. join&sort [1205]. Joins [959, 135, 897, 891, 570, 800, 775, 979, 569, 13 1182, 360, 436, 889, 1107, 756, 998, 816, 1187, 1136, 277, 947, 845, 804, 670]. Joint [624, 1165]. Journal [70, 1091, 220]. journey [882]. JSON [847, 864]. judgment [1210]. judgments [939]. jungle [919]. Juxtaposed [352]. layer [851, 907]. layered [405]. layouts [209]. Lazy [153]. leakage [308]. Leapfrog [1241]. Learned [1236, 1075, 1191, 1138, 461, 1242]. Learning [239, 158, 1215, 1252, 1063, 962, 1131, 748, 1148, 818, 1021, 960, 1044, 1133, 903, 1128, 1113, 1074, 1209, 1122, 1166, 1127, keeps [1198]. kernel [510]. key 524, 1014, 1048, 1135, 1099, 1222, 989, 832, [617, 1184, 781]. key-value [1184, 781]. keys 1142, 713, 966, 1070, 308, 1145, 698, 1207, [734, 1203]. Keyword [595, 1058, 690, 692, 971, 1023, 1164]. Learning-based 912, 957, 937, 1261, 492, 509, 349, 511, 434, [1063, 1142, 713, 971]. 1108, 763, 899, 698, 1207, 797, 629, 774]. learning-dependency [524]. keyword-based [957]. keywords learning-to-rank [1148]. length [358]. [806, 1235, 361, 343]. Klaus [345]. kNN Lero [1148]. Level [84, 24, 1072, 897, 653]. [484, 365, 414]. Know [733]. Knowledge Leveraging [979, 837, 1080, 891, 1192]. [88, 46, 84, 54, 993, 430, 748, 249, 702, 808, LHAM [147]. libraries [201]. life [283]. 1079, 462, 1060, 524, 1099, 1222, 989, 1011, lifecycle [375, 482]. lifted [751]. lifting 691, 754, 221, 942, 1023, 1217]. [910, 1105]. lightweight [1053]. like [388]. Knowledge-Base [84]. limited [906, 233]. Lindex [600]. line knowledge-intensive [691]. KOG [1254]. [523, 385]. Lineage [223, 350, 1076]. KRISYS [118]. LineageChain [931]. Linear [668, 231, 818, 1158, 704, 300]. Lines [70, 69]. Label [1118, 980]. Label-constrained link [240, 282]. linkage [1035]. linked [619]. [1118]. Labeling LIST [1207]. lists [519, 489]. literature [1251, 981, 1062, 1089, 788, 920, 280]. [422]. LLM [1249]. LLM-Driven [1249]. labelling [996, 1098]. Lakes [1257, 1210]. Llunatic [900]. Load [116, 547, 988]. Local Language [1086, 513, 671, 945, 896]. locality [59, 61, 884, 84, 858, 294, 586, 161, 173, 965, [725, 779, 928]. locality-aware [928]. 593, 1212, 1143, 1195, 1108, 1217, 340]. locality-sensitive [779]. Localized [414]. language-based [586]. Languages Locally [1253, 1232, 671]. Locating [200]. [71, 1224, 12, 80, 32, 1213, 31]. Large Location [124, 619, 451, 152, 1233, 1248, 1218, 933, 211, [852, 957, 1035, 806, 654, 243, 673, 707, 289]. 852, 890, 969, 1054, 558, 905, 748, 404, 840, Location- [957]. location-aware 643, 818, 1098, 1004, 250, 721, 270, 1172, 1180, [1035, 707]. location-based [243, 289]. 446, 685, 645, 212, 396, 578, 1002, 575, 1212, locations [658]. lock [701]. Locking 1064, 1099, 1222, 383, 474, 172, 1175, 980, 386, [93, 945]. Locks [51]. Log 1011, 602, 511, 715, 888, 1195, 985, 670, 1001, [147, 525, 1130, 379]. Log-based [525, 1130]. 759, 1083, 572, 1200, 683, 1237, 571, 605, 554]. Log-Structured [147]. logging [561, 802]. Large-Scale [1218, 619, 451, 1248, 933, 211, Logical [119, 832]. logs [890, 528]. long 852, 558, 404, 643, 818, 1098, 1004, 270, [1232, 882, 666]. longest [743]. 1172, 575, 1064, 1099, 1222, 715, 985]. longest-lasting [743]. looking [815]. lasting [743]. latch [1169]. latency lossless [1037]. lossy [1158]. lots [1018]. [1025, 1050, 845]. latent [416]. later [1211]. Low [1025, 532, 235]. low-cost [532]. lattice [600]. lattice-based [600]. law [392]. Low-latency [1025]. lowest [766]. 14 lowest-cost [766]. Lp [548]. Lp-norm [548]. LRU [68]. LSH [833, 940, 1033]. LSM [1140, 880, 946, 1181, 1170]. LSM-based [880, 1181, 1170]. [992, 923, 677, 1231]. Maximizing [548]. Maximum [1034, 668, 905, 854, 312, 320, 1175, 1234]. MDDE [1015]. meaning [479]. meaningful [355]. measure [854, 290]. measures M [133]. M-Trees [133]. machine [429, 1206, 437, 792, 868, 397, 793, 1115]. [962, 249, 818, 1021, 960, 903, 1128, 1113, Measuring [580, 1230, 1112]. mechanism 989, 966, 759, 1145, 1131]. machines [1036, 704, 773, 825]. Mechanisms [336, 760]. Main [109, 896]. Media [129, 137, 644, 834]. [1129, 753, 1029, 805, 1040, 1138, 701, 663]. mediation [270]. mediator [272]. main-memory [753, 1029, 805, 1138]. Mediators [273]. medoids [383]. meet Maintaining [40, 347, 386, 54, 39]. [577]. meets [534, 1089]. memoriam [345]. Maintenance [117, 28, 636, 1213, 841, 1064, Memory [959, 1240, 126, 963, 209, 208, 992, 474, 1153, 236, 244]. Make [895, 335]. 1111, 401, 869, 753, 1081, 1029, 805, 1040, Making [1037, 871, 1139, 773, 825]. 1138, 1129, 169, 1168, 300, 974, 897, 845, malicious [534]. Management 701, 945, 663, 958, 863, 1170, 1154, 968, 950, [44, 5, 1, 6, 88, 60, 30, 24, 8, 228, 428, 838, 781, 1033, 907, 916]. Memory-aware [963]. 417, 962, 507, 984, 1052, 163, 402, 286, 943, memory-efficient [992, 1168]. 302, 215, 283, 751, 293, 567, 195, 537, 810, memory-resident [208]. memos [442]. 1009, 332, 443, 665, 727, 874, 1201, 547, 475, MEMS [330]. merge [946]. message [346]. 466, 1159, 183, 855, 823, 192, 1217]. meta [1072]. meta-level [1072]. Metadata manager [252, 701]. Managing [141, 406, 402, 404]. metaphysical [351]. [962, 238, 217, 173, 718, 457, 363]. Method Manipulation [71]. manual [1139]. Many [115, 147, 569, 426, 849, 352, 328, 435, 289]. [816]. Many-query [816]. MapMerge methodology [383, 249]. Methods [471, [559]. Mapped [67]. Mapping 1219, 208, 232, 446, 1133, 175, 513, 284, 335]. [726, 354, 481, 188, 258]. metric [1008, 775, 689, 785, 199, 397, 977]. Mapping-equivalence [726]. mappings Micro [958]. Micro-architectural [958]. [559, 586, 522, 1108]. MapReduce microaggregation [306, 661]. [643, 768, 848, 727, 576, 577]. Mariposa microaggregation-based [661]. [76]. market [205, 831]. marketing [733]. Microblogs [874]. microdata [487]. markets [1151]. Markov [123]. middleware [351, 525]. MIL [140]. Min Markov-Chain [123]. massive [276]. Min/Max [276]. Mine [1228]. [847, 540, 961, 782, 1050, 941, 682, 861, 774]. MiniCon [189]. Minimal massive-scale [941]. massively [945, 655]. [26, 786, 801, 307, 1203]. minimization Master [153, 560]. match [239, 554]. [216, 873]. Minimum [1156, 297, 358, 780]. Matching Mining [1239, 1244, 925, 708, 800, 523, 1261, 531, [1228, 401, 596, 732, 150, 583, 524, 882, 423, 853, 567, 1000, 1044, 400, 1049, 693, 311, 319, 377, 283, 702, 313, 321, 540, 1180, 679, 1002, 314, 322, 1087, 926, 469, 1137, 1093, 196, 1212, 303, 379, 255, 672, 362, 987, 384, 394]. 620, 647, 741, 584, 222, 1080, 687, 571, 605]. MinJoin [1107]. mirrors [226]. Mis [953]. materialized [297, 426]. matrices [1176]. Mis-categorized [953]. misleading [1245]. matrix [704]. max [1036, 276]. maximal MisMatch [692]. Missing [1257]. mitigate [841, 310, 318, 1002, 362]. maximization [962]. mitigating [404]. Mixed [1203, 805]. 15 ML [1186]. MM [1129]. MM-DIRECT [1129]. Mobile [64, 65, 542, 537, 281, 393]. mobility [540, 1192]. modal [1048, 713]. Model [403, 50, 960, 1215, 95, 53, 30, 3, 228, 173, 965, 391, 206, 616, 955, 246, 341, 175, 1201, 106, 1246, 222, 999]. Model-independent [403]. Modeling [81, 45, 118, 608, 296, 882, 269, 674, 243, 395, 579]. Modelling [339]. models [456, 758, 1212, 1256, 1137, 251, 339, 454, 1195, 591, 1151, 1217]. Modern [736, 313, 321, 816, 1167]. monitoring [995, 414, 658]. Monotonic [194]. Morphtree [1138]. Morton [893]. most [733, 651, 895]. motif [1156]. motif-cut [1156]. Motifs [1218, 1120]. motion [496]. motion-aware [496]. movement [1260, 844]. Mover [573]. moving [299, 562, 468, 296, 499, 995, 1061, 484, 663, 477, 670, 899, 356, 574]. moving-object [663]. MSAD [1246]. MSQL [785]. Multi [97, 810, 20, 142, 1062, 131, 1255, 1249, 755, 24, 441, 8, 1057, 391, 91, 360, 1079, 168, 1210, 614, 998, 341, 924, 1221, 1048, 1191, 172, 1137, 546, 844, 713, 1173, 308, 634, 1063, 1217, 851]. multi-ary [1173]. multi-attribute [91, 844]. multi-class [1079]. Multi-Clip [131]. Multi-constraint [1062]. Multi-dimensional [1255, 441, 168, 614, 1191]. multi-facet [1137]. Multi-Join [97]. multi-layer [851]. Multi-Level [24]. multi-modal [1048, 713]. Multi-objective [755]. multi-probe [1063]. Multi-Query [8]. multi-ranker [341]. multi-relational [308]. Multi-Resolution [142, 391]. Multi-schema-version [810]. multi-step [1221]. multi-tenant [1217]. multi-tier [546, 634]. multi-truth [1057]. multi-tuple [1210]. Multi-Turn [1249]. multi-valued [924]. multi-visual [172]. Multi-Way [20, 360, 998]. multicore [745, 1029, 561, 760]. Multidatabase [5, 1, 14, 99, 21, 251]. Multidatabases [12]. Multidimensional [44, 243, 154, 365, 1112, 206, 274, 565, 443, 633, 191, 288]. Multimedia [134, 162, 128, 132, 163, 174, 646]. Multimodal [506, 1183]. Multiple [70, 154, 357, 160, 231, 764, 69, 238, 624, 494]. multiplicities [444]. multisocket [561]. multisource [244]. multistore [973]. multitasking [1015]. multithreaded [945]. multivariate [306, 1115]. Multiversion [89, 217, 738]. MyBenchmark [667]. Nail [33]. Naı̈ve [381]. native [215, 214]. Natural [884, 858, 173, 963, 1143, 1108]. navigation [160]. Navigational [109, 1190]. near [1096]. near-optimal [1096]. Nearest [299, 164, 553, 581, 463, 526, 770, 499, 1174, 445, 940, 493, 673, 1188, 543, 548, 757, 1063, 289, 774]. nearest-neighbor [463, 493, 673, 289]. negative [465, 942]. negotiation [182]. Neighbor [164, 299, 463, 526, 499, 1174, 445, 940, 493, 673, 1188, 548, 1063, 289]. neighborhood [715, 776]. neighborhood-centric [715]. neighbors [553, 581, 770, 543, 757]. Nested [113, 9, 1085, 1229, 411, 171]. nested-transaction [411]. Nesting [86]. Netherite [1199]. network [447, 656, 1053, 563, 611, 219, 495, 1022, 1174, 1121, 1135, 1067, 393, 352, 538, 504, 1088, 658, 997]. network-based [1135]. network-bound [219]. networked [82]. Networks [1225, 852, 553, 1035, 1243, 333, 359, 440, 1098, 296, 505, 1172, 685, 645, 677, 782, 857, 924, 1061, 986, 1106, 870, 533, 550, 1089, 1196, 1238, 602, 647, 804, 265, 325, 759, 414, 791, 767, 1118, 1007, 334]. Neural [1249, 1053, 1121, 1135, 1067, 1196, 1165]. nexus [1019]. NN [391, 1069, 1061, 1033]. Node [1218, 951, 91, 896, 1164]. node-local [896]. nodes [1007]. noise [1130]. noise-aware [1130]. noisy [1036]. Non [623, 792, 1086, 1040, 527, 415]. Non-binary [792]. non-dedicated [415]. non-deterministic [527]. non-numeric 16 [1086]. Non-uniformity [623]. non-volatile [1040]. nonuniform [903]. norm [779, 548]. normal [1197]. Normalization [522, 409, 348]. normalizing [1109]. NOT-twig [589]. Nothing [17, 94, 18]. Notification [114, 533]. novel [1205]. now-relative [197]. NScale [715]. NUMA [1040]. NUMA-aware [1040]. numeric [1086]. NVRAM [896]. NVRAM-centric [896]. O [948, 961, 940, 762, 682]. O-efficient [774]. Object [59, 57, 41, 108, 107, 29, 62, 86, 95, 125, 30, 122, 67, 275, 496, 63, 58, 726, 562, 100, 468, 744, 82, 232, 1182, 499, 138, 1178, 106, 663, 192, 585, 249]. object- [192]. object-based [82]. object-creating [726]. Object-Oriented [41, 108, 86, 125, 30, 275, 138]. Object-Process [249]. Object-Relational [122]. Objectbase [60]. ObjectGlobe [181]. objective [755]. Objects [112, 90, 38, 24, 299, 166, 937, 296, 281, 1061, 694, 670, 356, 574, 582]. Observations [1236]. obstructed [806]. offline [943]. offs [208, 1204]. oid [726]. oid-equivalence [726]. OLAP [315, 323, 973, 371, 805, 1168, 1161]. OLTP [1216, 805, 1040, 737, 958, 597]. OLTP/OLAP [805]. Omni [335]. Omni-family [335]. OmniSketch [1255]. On-line [523, 385]. on-road [801]. One [168, 862, 463, 1093]. One-dimensional [168, 463]. One-pass [862]. one-to-one [1093]. ones [527]. Online [474, 292, 170, 413, 1244, 992, 184, 943, 739, 677, 1072, 646, 668, 777, 1007]. Ontological [1039, 242, 617, 702]. Ontologies [1239, 239, 238]. ontology [246]. ontology-based [246]. OODB [115, 110, 111]. OODBMS [81, 73]. Open [1162, 783]. operational [738]. operations [267]. Operator [262, 1228, 432, 339]. operators [945]. opinion [1231, 1151]. Opportunities [1029]. OPT [138]. Optimal [606, 89, 789, 131, 1007, 1096, 806, 440, 410, 1059, 1042, 376, 222, 672, 658]. optimality [771]. Optimisation [80]. optimism [1029]. Optimization [87, 367, 20, 98, 102, 783, 166, 301, 611, 522, 158, 1186, 724, 138, 409, 976, 1055, 1060, 815, 1205, 1235, 1121, 824, 473, 691, 433, 755, 1142, 576, 1063, 1242]. optimizations [1106]. Optimized [826, 740, 1040, 574]. optimizer [1148, 919, 1091]. Optimizers [1236, 1030, 983]. Optimizing [1110, 467, 113, 154, 169, 1190, 1170, 276, 1219, 175, 704, 287, 1203]. options [415]. Oracle [87]. oracles [1149]. Order [815, 92, 817, 819, 1146, 639, 719, 485, 1010, 1205, 978, 963, 811, 970, 793, 753]. order-preserving [92]. Ordered [51]. Ordering [131, 102, 981]. orders [556, 1146]. organizations [307]. Organizing [124, 240]. Oriented [41, 108, 86, 125, 30, 275, 72, 64, 306, 232, 138, 768, 1121, 369]. Orthogonally [58, 57]. OSAM*.KBMS [84]. outer [436, 311, 319]. outer-join [311, 319]. outlier [279, 1008, 1016]. Outliers [149]. outsourced [565, 426, 438, 486]. Outsourcing [613]. overhead [648]. overlap [906, 979, 771]. Overview [5, 387, 994]. OXPath [593]. P [1067]. P2P [481, 404]. PACE [794]. Package [817]. Page [68, 209]. PageRank [352, 863, 700]. Pair [164, 689, 1033]. Pair-Wise [164]. pairing [413]. pairwise [744, 1210, 939, 830, 843]. PANDA [759]. PANE [1088]. panorama [1214]. Papers [1084, 144, 516, 915, 557, 697, 883, 470, 812, 253, 427, 309, 317, 709, 590, 750, 749, 635, 1024, 894]. paradigm [180, 794]. Parallel [20, 1002, 805, 66, 116, 804, 244, 19, 1008, 432, 752, 94, 666, 655, 829, 987, 577]. parallel-friendly [1008]. Parallelism [17, 24, 22, 650, 981]. Parallelization 17 [1154, 415]. Parallelizing [73, 863]. Parametric [847, 98, 755]. Pareto [1059]. parking [801, 1018]. PARROT [1065]. Parsimonious [564]. Parsing [864]. Part [4, 7]. Partial [112, 26, 819, 759]. partial-order-based [819]. Partially [426, 420]. participants [534]. partition [383, 790, 289]. partition-based [790]. partitioned [428, 332, 1065]. Partitioning [650, 116, 769, 167, 840, 1041, 232, 725, 835, 1156, 597]. partnership [220]. pass [862]. passing [1030]. Path [714, 764, 85, 329, 495, 115, 964, 1176, 809, 367, 795, 1062, 1089, 1152, 794, 767, 1118, 794]. Path-based [764]. PAth-CEntric [794]. Path-Method [115]. paths [766, 906, 997]. Pattern [52, 29, 603, 216, 374, 606, 853, 721, 313, 321, 1180, 469, 420, 498, 1065, 554]. Pattern-Based [29, 1065]. patterns [1095, 690, 1232, 1260, 401, 764, 679, 389, 233, 666, 987, 261]. pay [671]. Payment [1018]. PBS [640]. PC [144, 143]. PCA [1136]. PCCP [329]. peer [352, 325, 425]. peer-to-peer [352, 325, 425]. perception [1214]. Performance [530, 139, 23, 24, 67, 783, 208, 520, 859, 73, 948, 935, 235, 256, 1204, 868, 966, 657, 760]. Performant [1169]. Periodic [129, 437]. Permutation [137, 788]. Persistent [57, 380, 63, 58, 1111, 916]. personal [1052, 405]. personalization [184]. Personalized [647, 863, 1080, 684, 700]. perspective [210, 1070, 308]. perturbation [394]. pervasive [277]. phantoms [494]. Physical [79, 472, 609]. physics [1229]. physiological [597]. Picket [1014]. PicoDBMS [186]. PicShark [404]. Picture [662]. Piecewise [668]. PIM [1240]. PIM-tree [1240]. pipeline [1038, 1056]. pipelines [1021, 895, 1141]. Pivot [977]. place [901]. placement [665, 1060, 94]. plan [764]. planning [1085]. plans [814, 287]. platform [669, 578, 919, 1020]. platforms [183, 646]. PM [1033]. PM-LSH [1033]. PMG [115]. PMR [204]. POESIA [242]. Pointer [62]. policies [587, 293, 599, 946, 504]. polyglot [1082]. polymorphic [1138]. portable [745]. Possible [734]. postorder [606]. Power [71, 392, 610, 375]. Power-law [392]. powered [1166, 1127]. powerful [1177, 760]. Practical [1085, 284, 195, 828, 845]. PrDB [457]. Pre [1256, 1048, 1179]. Pre-trained [1256, 1179]. pre-training [1048]. Précis [343]. precision [972]. Precomputed [115]. Predicate [501, 75, 378, 368]. Predicate-based [501, 75]. predicates [1186, 396, 1030, 947, 1255]. Predictable [520]. Predicting [357]. Prediction [52, 852, 982, 523, 495, 1192, 1202, 620, 1018, 681]. prediction-enhanced [1192]. Predictions [123, 1144]. predictive [495]. Preference [517, 911, 939, 927]. preference-based [911]. preferences [1103]. preferred [766]. prefetch [166]. Prefetching [123, 329]. PrefixFPM [987]. preorder [606]. Prescriptive [850]. presence [401, 448, 233, 482, 420, 576]. Presentations [134]. preservation [493]. Preserving [258, 92, 374, 447, 305, 1052, 1254, 654, 1261, 302, 1015, 1067, 303, 490, 381, 1012, 1005]. pretrained [1217]. prevent [487]. prevention [634]. price [1007]. pricing [1202]. Primal [398]. primitives [140]. principle [358]. principled [735]. Principles [469]. prioritized [517]. Priority [74, 1261, 1045, 1100]. priority-aware [1100]. Privacy [447, 1000, 533, 504, 381, 308, 1244, 1005, 305, 1052, 370, 430, 656, 1254, 654, 1261, 1086, 302, 613, 1015, 704, 1067, 303, 490, 661, 1012]. Privacy-preserving [447, 381, 1005, 305, 1052, 1254, 654, 1261, 1015, 303, 490, 1012]. Privacy-Utility [1244]. private [796, 1194, 625, 486, 394]. PrivPfC [796]. Probabilistic [514, 820, 456, 337, 619, 1069, 626, 453, 460, 462, 459, 521, 583, 758, 445, 18 886, 416, 458, 339, 457, 573, 483]. Probability [52]. probe [1063]. Problem [102, 692, 210, 735, 681]. Problems [136, 783, 410]. process [594, 528, 249]. processes [696, 1004]. Processing [87, 145, 101, 118, 107, 1220, 1240, 720, 663, 17, 1236, 1225, 19, 455, 705, 606, 984, 1224, 181, 568, 190, 529, 581, 463, 532, 638, 859, 167, 100, 391, 440, 608, 247, 643, 1116, 526, 650, 260, 1126, 1229, 360, 566, 710, 628, 1049, 366, 639, 368, 485, 1209, 445, 1245, 202, 886, 489, 395, 888, 607, 1155, 342, 549, 823, 18, 579, 1195, 1077, 1104, 1142, 450, 425, 1091, 670, 461, 899, 1076, 856, 802, 767, 1118, 1114, 622, 582, 629, 799]. Processing-in-Memory [1240]. processor [259, 432]. processors [821, 313, 321]. products [733, 651]. profile [1007]. Profiling [695, 1011]. programmable [948]. Programming [59, 61, 80, 84, 1253]. Progressive [171, 549, 327, 1069, 954]. project [387]. projections [231]. promises [398]. promising [733]. prompt4vis [1212]. prompting [1212]. Prone [1, 452]. Propagation [153, 285, 751]. Propagations [113]. properties [586, 454]. Property [1228, 1197]. proportional [744, 1168]. ProS [1069]. protection [370, 613, 1169, 493]. protein [285, 212]. Protocol [40, 39, 562]. Prototypes [32, 37]. Provenance [696, 798, 787, 813, 828, 931]. Provenance-based [696]. providers [533]. Providing [377, 509]. provisioning [642]. proximity [1008, 533, 793]. proxy [361, 384]. PSoup [229]. PTSSP [1261]. public [699]. publication [507, 656, 796, 625]. publish [909, 763, 707]. publish/subscribe [909, 763, 707]. publishing [654, 187]. PUG [828]. Purpose [370, 335, 987]. pushdown [1161]. Python [1195]. QFilter [527]. QoS [611]. QoS-aware [611]. QQL [340]. quadtree [204, 325]. quadtree-based [204]. qualified [988]. Qualitative [462, 46]. quality [518, 1069, 265, 1070, 605]. Quantifiable [150]. Quantifying [640, 1103]. Quantiles [729]. Quantitative [62, 1111]. quantization [1196]. quantization-aware [1196]. quasi [1002, 176]. quasi-cliques [1002]. quasi-sparse [176]. quaternary [364]. QUBLE [645]. Queries [97, 113, 1251, 70, 154, 131, 1258, 1247, 1058, 690, 496, 1176, 299, 726, 1223, 1052, 817, 367, 703, 229, 553, 581, 463, 775, 638, 157, 297, 444, 359, 552, 612, 798, 596, 1171, 853, 996, 1098, 1086, 611, 689, 390, 274, 542, 193, 725, 955, 995, 565, 245, 446, 515, 645, 889, 254, 488, 418, 967, 651, 69, 175, 233, 500, 704, 939, 445, 514, 747, 527, 1102, 517, 385, 742, 1190, 484, 1089, 489, 1039, 720, 980, 718, 189, 458, 865, 607, 343, 673, 630, 589, 491, 171, 420, 549, 1193, 863, 1152, 498, 827, 657, 899, 757, 414, 572, 1207, 441]. queries [483, 574, 1203, 622, 289, 629, 780, 1259, 554]. Query [87, 586, 301, 50, 107, 448, 1220, 12, 360, 20, 779, 98, 459, 815, 202, 80, 340, 18, 17, 659, 461, 8, 1236, 19, 216, 294, 705, 481, 890, 181, 821, 1213, 161, 520, 568, 190, 529, 188, 1148, 532, 167, 337, 965, 391, 440, 884, 247, 643, 1261, 814, 1025, 526, 158, 1186, 724, 446, 219, 138, 1030, 1049, 366, 976, 1055, 895, 368, 485, 355, 758, 1061, 1209, 824, 667, 1245, 816, 660, 886, 415, 917, 902, 439, 251, 395, 1082, 433, 376, 663, 983, 1143, 653, 1194, 342, 541, 755, 425, 873, 261, 765, 479, 767, 1063, 1073, 1118]. query [582, 1242, 629, 799, 652, 822, 999, 693]. Query-aware [779]. Query-By-Humming [693]. query-reuse [1082]. query-time [758]. Querying [278, 936, 706, 1248, 248, 1200, 993, 268, 140, 957, 1243, 382, 540, 296, 495, 383, 353, 272, 788, 1001, 861]. question [1143]. questions [747]. QuickStore [67]. Quo [1229]. 19 R [345, 1181, 442, 653]. R-tree [1181]. R-trees [442, 653]. RailwayDB [716]. random [955, 474, 386, 963, 793]. Randomized [102]. range [775, 979, 1171, 390, 274, 565, 495, 693, 1188, 922]. rank [1148]. ranked [245]. ranker [341]. Ranking [515, 543, 521, 514, 1006, 433, 491, 705]. rankings [994]. rapid [892]. Raster [1182]. Rate [137]. RATEWeb [449]. Ratio [150]. RCBench [1117]. Rdb [87]. RDBMS [509]. RDF [993, 833, 1224, 912, 616, 913, 675, 475, 720, 1156, 990, 855, 901]. RDF-3X [475]. RDFFrames [989]. RDMA [1117]. RDMA-enabled [1117]. re [505, 227]. re-identification [505]. RE-tree [227]. reach [980]. Reachability [788, 638, 980, 602, 1152, 1001, 572, 861, 799]. Read [740, 1139]. Read/write [740]. Read/write-optimized [740]. Real [51, 563, 146, 11, 93, 74, 670, 834, 636, 506, 274, 539, 928, 657]. Real-Time [51, 146, 11, 74, 563, 670, 834, 636, 506, 539]. real-world [657]. Realization [62]. Realm [55]. Realm-Based [55]. Reasoning [690, 619]. recoding [513]. recognition [878]. recommendation [503, 1048, 508, 1124, 952, 777, 834]. recommendations [627, 542, 1046, 994]. recommender [1012]. Recommending [609]. reconciliation [269]. Reconciling [1185]. reconstruction [891]. record [531, 222]. Recoverable [114]. Recovery [104, 103, 91, 282, 1129, 525, 910, 1105, 802]. rectifying [925]. recursion [161, 610]. recursive [467, 448]. redesign [701]. REdistribution [512]. Reducing [436, 562, 1177, 731]. reduction [298, 328, 762, 799]. redundancy [348]. Reference [125, 397]. Reference-based [397]. Referential [85]. Refined [109]. refinement [348]. Refiner [1166, 1127]. region [829]. regional [584]. regions [944]. registers [1027]. regression [316, 324]. regret [873]. Regular [70, 1176, 227, 706]. Reinforcement [1215, 1172, 1122, 986, 971]. related [1036, 303]. relation [1103, 947]. Relational [83, 107, 12, 113, 38, 122, 1252, 695, 933, 230, 209, 268, 370, 627, 519, 753, 751, 885, 254, 712, 389, 1132, 967, 409, 816, 660, 478, 832, 339, 187, 589, 192, 655, 308, 330]. relationalize [1221]. relations [166, 467, 808, 837]. relationship [392]. Relationships [53, 25, 1097, 221]. relative [203, 197]. relaxation [327, 660]. Relaxing [81]. Relevance [115, 744]. relevant [694, 901]. Reliability [1144]. Reliable [126, 1166, 1127]. Remote [38]. RemusDB [592]. REncoder [1171]. reordering [170]. repair [587]. repairing [925, 776]. repairs [632, 1042]. replacement [293]. replica [665]. Replicated [14, 153]. replication [805, 393, 896]. report [535]. report-generation [535]. repositories [451, 200]. repository [211]. Representation [46, 455, 1110, 305, 1209, 1048, 1023, 668]. representations [846, 249, 990]. representative [1147, 662]. Representing [454]. Reputation [449]. research [783, 369]. resident [208, 489]. Resilience [1019]. resistant [1240]. Resisting [505]. Resolution [141, 142, 421, 819, 391, 1210, 1162, 1093, 465, 624, 631, 1179]. resolve [692]. resolving [406]. Resource [129, 7, 752, 1043]. Resource-aware [1043]. response [158]. responsible [1009, 1019]. Restricted [1220]. result [627]. result-driven [627]. results [884, 1068, 492, 1042, 595]. retention [599]. rethinking [1161]. Retrieval [112, 45, 246, 120, 17, 133, 291, 338, 1178, 416, 198, 339, 424, 18, 713, 585, 901]. Retrospective [264]. Return [8]. reusability [1215]. Reuse [49, 1082]. Reverse [1058, 757, 299, 553, 581, 770, 651, 445, 747, 365, 659, 548]. Revisited 20 [77, 958, 1147, 1205, 649, 1168]. Revisiting [1256, 482]. rewriting [527, 461]. RFID [351, 450]. RHEEMix [919]. rich [1213, 457]. riding [334]. riding-aware [334]. Rights [493, 305]. Risk [795]. Risk-aware [795]. risky [1020]. RNE [997]. road [1243, 495, 801, 1061, 1089, 658, 767, 1118, 997]. Robust [1066, 809, 1133, 1040, 352]. robustness [1140]. ROLAP [375]. ROSE [55]. rotated [437]. rotations [1136]. Round [1225]. Route [1235, 801, 1048, 376]. routes [679]. routing [911, 898, 684]. RPQs [1110]. Rtree [451]. Rule [286, 247, 925, 523, 702, 1099, 1222, 290, 1228]. Rule-based [286, 247]. Rules [81, 1228, 150, 180, 560, 206, 462, 465, 631]. RUM [442]. RUM-tree [442]. rumours [1050]. running [815]. runtime [1082]. Schematic [90]. Scheme [75, 779, 426]. schemes [217]. science [1009, 1141]. sciences [283]. SCOPE [577]. scoring [290]. SD [451]. SD-Rtree [451]. SDS [35]. Search [164, 692, 618, 912, 503, 529, 876, 1053, 937, 501, 1069, 784, 914, 879, 499, 257, 685, 645, 961, 492, 536, 509, 723, 1051, 940, 785, 1034, 349, 205, 1175, 352, 511, 595, 422, 434, 1188, 365, 398, 646, 335, 904, 1173, 1165, 759, 573, 698, 486, 761, 791, 843, 683, 717, 797, 1063, 1033, 774, 851]. search-based [698]. searchable [1101]. searches [176, 790]. Searching [199, 26, 341, 1208, 742]. Seaweed [353]. Second [793, 864, 963]. Second-order [793, 963]. Secret [778, 1254, 608]. Section [64, 664, 72, 575]. Secure [146, 565, 304, 1160, 527, 534, 931, 1101, 1193, 827]. security [778]. Seeking [105]. segmentation [400]. segments [1158]. S [708, 159]. S.I. [1028]. SABRE [512]. Selected [1084]. selecting [789]. Selection safe [766, 81, 476]. sample [347]. samples [124, 809, 210, 795, 246, 665, 752, 1205, 1246, [474, 386]. Sampling 977, 700]. selectivities [396]. Selectivity [632, 418, 623, 1189, 918, 928, 771, 942]. [274, 28, 168, 312, 320, 591]. Self Sampling-based [418]. Sancus [443, 833, 392, 1238, 439]. self-adaptable [1196, 1196]. satellite [372]. Scalability [439]. self-clustering [833]. self-similarity [561, 832]. Scalable [891, 124, 463, 768, 848, [392]. self-supervised [1238]. Self-tuning 1121, 926, 511, 597, 497, 708, 969, 1054, 817, [443]. Semantic [141, 157, 45, 249, 90, 944, 748, 1254, 184, 593, 1227, 710, 756, 366, 860, 25, 192, 294, 839, 405, 269, 270, 400, 1003, 1051, 1201, 385, 475, 849, 546, 189, 1011, 666, 1135, 416, 1047, 901, 428, 239, 238, 241]. 963, 829, 1173, 1066, 1088, 572, 843, 1164]. Semantically [26]. Scale [1218, 933, 211, 852, 558, 951, 404, Semantically-Equivalent [26]. semantics 619, 643, 451, 818, 1098, 1004, 270, 1172, 732, [586, 608, 240, 583, 547, 706, 966]. semi 575, 1064, 1034, 1099, 1222, 466, 715, 630, [308, 1164]. semi-supervised [308, 1164]. 985, 1248, 941, 1017, 1073]. ScaLeKB [748]. semistructured [161, 580, 630, 342]. Scaling [382, 674, 760, 802, 805, 280, 186]. Sensitive [66, 444, 779, 512]. sensitivity Scan [809]. Scans [68, 655, 576]. scarcity [1086]. sensor [333, 359, 611, 265, 414]. [404]. SCCs [682]. scenarios [314, 322]. sentences [173]. SEPIA [396]. sequence Scheduled [700]. schedules [576]. [423, 212, 743, 1238, 666, 584]. Sequenced Scheduling [27, 11, 535, 262, 129, 801]. [541, 376]. sequences [1046]. sequential Schema [81, 481, 270, 620, 559, 586, 403, [469, 956]. serializable [773, 825]. series 847, 594, 567, 522, 810, 400, 1003, 314, 322, [969, 1054, 1206, 1069, 680, 382, 795, 437, 1060, 1135, 196, 1108, 258, 348, 355]. 1158, 860, 1160, 926, 292, 974, 956, 922, 1246, Schema-Free [355]. Schemas [3]. 1125, 1173, 1165, 1124, 1065, 746, 822, 288]. 21 Server [49, 118, 114, 75, 103, 182, 525]. serverless [1199, 1113]. Servers [134, 256]. Service [142, 369, 533, 528, 1202, 718]. services [271, 180, 242, 537, 243, 411, 449, 178, 241, 183, 646, 287, 486, 363, 289]. Set [13, 26, 800, 263, 235, 1177, 1210, 1187, 811, 513, 837, 435, 807, 968, 950]. set-based [811]. set-expression [263]. set-valued [235, 513]. sets [429, 1046, 670]. settings [766]. shapelet [1160]. shapes [437, 198]. SHARC [518]. sharding [1092]. share [1027]. Shared [51, 17, 816, 94, 504, 18, 597, 863, 576, 1018]. shared-everything [597]. Shared-Nothing [17, 94]. Sharing [4, 778, 568, 1254, 82, 270]. sharing-based [1254]. shifted [479]. Shooting [545]. short [708]. Shortest [1251, 367, 906, 1243, 613, 1062, 1089, 767, 1118, 997]. shot [1165]. shuffle [1145]. SI [887, 867, 546]. SI-Cache [546]. sideways [1030]. sight [913]. SIGMOD [72, 64]. signal [891]. Signature [124]. signed [1234]. significance [662]. SIMD [895, 917]. similar [490, 198, 1123]. similar-bicliques [1123]. Similarities [90]. Similarity [112, 607, 133, 1151, 891, 1057, 800, 951, 392, 1261, 1069, 569, 551, 580, 400, 614, 1107, 723, 785, 1187, 205, 804, 676, 646, 335, 176, 837, 1173, 573, 761, 843, 687, 683, 866, 622, 790]. Similarity-driven [1151]. Simple [964, 942, 1236, 335]. simplet [1189]. simplification [862]. SimRank [473, 830, 972, 791]. SimRank* [843]. Simultaneously [154]. single [726, 863, 972, 759, 248, 907]. single-dimensional [248]. single-function [726]. single-source [863, 972]. sites [160, 159, 361, 504]. situ [1043]. situation [252]. size [297, 744, 347, 623]. size- [744]. SKCompress [903]. sketch [1163, 1075]. Sketching [686]. Skew [20, 1240, 1219]. Skew-resistant [1240]. sky [479, 485]. SkyAlign [745]. Skyframe [425]. Skyline [1220, 865, 745, 995, 566, 485, 633, 924, 1235, 517, 425, 829, 873, 479]. skyline-based [1235]. skylines [662]. Sleepers [64, 65]. Sliding [1081, 488, 686, 970, 763]. Sliding-window [488, 686, 970]. slow [801]. small [857]. small-world [857]. smart [680]. smartcard [186]. Smooth [809]. snapshot [671, 581, 463, 721]. snapshots [1128]. Snorkel [892]. Social [503, 852, 507, 1035, 506, 505, 1000, 1192, 677, 986, 533, 504, 644, 777, 834, 780, 1007, 705]. Software [49, 314, 322, 1102]. SOLE [385]. solid [740]. solid-state [740]. Solution [136]. solutions [985, 363]. Solving [681, 826]. some [706]. Sort [568, 66, 556]. Sort-sharing-aware [568]. sortable [860]. sorted [489]. Sorting [550, 167, 731, 331]. source [1057, 620, 863, 972]. sourced [615]. sources [1112, 618, 1047, 273]. Space [1241, 46, 508, 497, 553, 806, 1171, 410, 1079, 1051, 1106, 990, 356, 248]. space-time [1171]. spaces [1008, 689, 785, 199, 397, 548, 977]. Span [1001]. Span-reachability [1001]. Spark [960, 813]. SPARQL [993, 890, 725, 720, 652]. sparse [893, 905, 1036, 903, 176, 1083]. sparsity [681]. Spatial [43, 55, 130, 120, 46, 203, 152, 875, 1244, 582, 1058, 208, 48, 912, 553, 530, 440, 937, 1261, 451, 853, 526, 1182, 42, 204, 1235, 383, 199, 647, 804, 412, 694, 1188, 855, 1193, 477, 1142, 763, 829, 585, 604, 899, 438, 757, 1207, 486, 276, 797, 1100, 452]. spatial-keyword [937, 763]. spatial-range-constrained [1188]. Spatio [800, 298, 654, 385, 197, 676, 326, 1207, 831]. spatio-bitemporal [197]. Spatio-temporal [298, 654, 385, 676, 326, 831]. Spatio-textual [800, 1207]. spatiotemporal [247, 295, 1192, 1048, 398, 541, 901, 730]. Special [516, 664, 915, 22, 37, 48, 63, 72, 57, 557, 64, 22 1131, 697, 736, 883, 984, 615, 470, 812, 1226, 283, 427, 43, 537, 309, 317, 453, 1009, 709, 575, 590, 749, 1167, 1084, 930, 635, 128, 1024, 32, 894, 17, 402, 338, 302, 260, 750]. specification [159, 195]. specified [420]. speech [1143, 1143]. speech-driven [1143]. Speech-to-SQL [1143]. Speed [510, 424, 1094]. Speeding [204, 1051]. spurious [492]. SQL [703, 448, 1119, 1186, 555, 1074, 734, 785, 1143, 192, 326]. SQL2 [85]. SQUID [1073]. SRX [855]. SSD [948]. SSDs [738]. STAIRS [544]. staleness [1196]. standard [751]. stars [545]. Start [967]. state [783, 740, 411, 946, 823]. state-of-the-art [946]. stateful [650]. static [1049, 860, 648, 830, 1237]. Statistical [466]. Status [1229]. Status-Quo [1229]. step [1221]. Stepwise [141]. Stochastic [1145, 898, 794]. Storage [109, 123, 103, 877, 332, 731, 880, 349, 547, 474, 416, 716, 932, 280, 330, 642, 907]. storage-centric [547]. Store [67, 781, 428]. stores [993, 955, 1184]. Storing [268]. story [636, 1026]. Strategies [64, 62, 153, 65]. Strategy [137, 423, 1156]. Stratosphere [669]. Stream [771, 228, 262, 1224, 859, 608, 1116, 432, 650, 260, 360, 255, 1255, 1077, 1104, 668, 261, 856, 1114]. Streaming [1094, 494, 636, 708, 229, 259, 563, 410, 860, 547, 1050, 598, 408]. streams [464, 909, 471, 263, 488, 278, 366, 928, 1163, 729, 1187, 688, 385, 478, 686, 511, 865, 706, 412, 603, 579, 498, 644]. string [92, 417, 569, 396, 1107, 918, 364, 741, 761]. strings [497]. strong [918, 655]. Structural [136, 409, 492, 161, 951, 505, 580, 685, 842]. Structure [47, 1258, 1247, 227, 464, 913, 1066, 790]. Structured [119, 109, 1251, 147, 615, 301, 343]. structured-document [301]. structures [235, 1169, 466, 896]. study [852, 890, 960, 235, 1230, 977]. Sub [1122, 300]. sub-linear [300]. Sub-trajectory [1122]. subgraph [636, 1000, 645, 1049, 768, 1102, 904, 1153, 687, 1075, 1259]. Subgraphs [1253, 583, 988]. subjective [936]. subscribe [909, 763, 707]. subsequence [969, 1054, 693, 926, 571]. Subset [26, 418]. subset-based [418]. subspace [633, 549]. substring [168]. subtrajectory [1073]. Succinct [305]. suffix [982, 284]. summaries [744]. summarization [913, 292]. summarizations [860]. Summarizing [839]. Super [614]. Super-EGO [614]. supervised [1238, 308, 1164]. supervision [892]. Support [85, 10, 142, 2, 53, 962, 406, 392, 167, 184, 641, 195, 1227, 813, 336, 221, 192, 525, 707]. Supporting [14, 254, 437, 174, 375, 1101, 491, 405, 91, 753, 351, 1150, 442]. Suppressing [487]. surface [391]. surfing [357]. surprising [888]. surrounder [542]. Survey [1159, 1077, 695, 858, 993, 778, 962, 1224, 839, 876, 867, 957, 643, 914, 869, 879, 877, 1116, 850, 878, 193, 787, 566, 675, 1074, 1003, 976, 1055, 1191, 880, 874, 1184, 1183, 393, 1016, 871, 196, 888, 1155, 868, 823, 875, 598, 873, 1023, 1114, 977, 1104]. SVD [1136]. SW [428]. SW-Store [428]. sweeping [947]. sweeping-based [947]. switching [423]. Swizzling [62]. SWOOP [1187]. Swoosh [421]. SWORD [665]. Symbolic [132]. Sync [285]. Synchronization [103]. synchronous [862]. synopses [347, 419]. synopsis [410, 390, 854]. synthesis [1106]. synthesizing [1221]. synthetic [314, 322]. System [64, 1, 406, 33, 114, 60, 103, 34, 132, 76, 36, 72, 507, 229, 82, 943, 201, 215, 1126, 506, 710, 336, 1166, 1127, 931, 666, 221, 829, 1012, 941, 781, 971, 907]. System-oriented [64, 72]. systematic [1113, 845]. Systems [57, 40, 6, 14, 146, 148, 43, 11, 4, 7, 139, 142, 99, 88, 32, 116, 93, 17, 21, 380, 22, 37, 48, 63, 58, 262, 962, 39, 160, 1224, 1052, 370, 753, 1116, 751, 195, 42, 919, 665, 752, 178, 94, 23 592, 1159, 439, 872, 31, 701, 272, 823, 18, 192, 1077, 1104, 407, 425, 1145, 760]. Table [1210, 555]. TablePuppet [1252]. Tables [1252, 519, 1221]. Tabular [1106, 1257, 1212, 1014]. TADOC [938]. tagged [1188]. tagging [637]. tailoring [1147]. Taking [662]. targeted [733]. Task [691, 1151, 1100]. task-driven [1151]. tasks [786, 826]. Taxonomies [124, 803]. Taxonomy [660, 78, 273]. Taxonomy-based [660, 273]. Technique [40, 39, 680, 303]. Techniques [118, 10, 1250, 473, 880, 202, 1162, 393, 186, 251, 598, 280, 331]. technologies [850, 224, 369]. Technology [101, 35, 100]. Tee [1184]. Tee-based [1184]. template [206]. Temporal [1095, 83, 27, 130, 928, 162, 395, 1248, 1218, 1185, 846, 298, 654, 173, 965, 267, 564, 1227, 500, 1071, 385, 991, 949, 676, 399, 326, 407, 1152, 1001, 236, 1200, 861, 831, 1259]. temporal-clique [1259]. Tempura [1091]. tenant [1217]. tensor [849]. tensors [732]. term [909]. termination [940]. Test [13]. testing [703, 480]. tests [316, 324]. Text [1232, 124, 1249, 938, 708, 231, 1074, 409, 536, 524, 544, 18]. text-to-SQL [1074]. Text-to-Visualization [1249]. textual [800, 909, 957, 1207]. Their [136, 4, 7, 54, 714, 1120, 607]. Thematic [838]. Thémis [61]. theoretic [580, 175]. theoretical [927]. Theory [21, 1223, 789, 870, 534, 1231]. THESUS [240]. theta [889]. thinker [988]. Third [1197]. Three [93, 1211, 548]. three-dimensional [548]. Threshold [1223, 483]. Threshold-based [483]. thresholds [379]. Tidy [967]. tier [546, 634]. Tiered [1219, 932]. Tiered-Indexing [1219]. TIGUKAT [60]. TIMBER [214]. Time [51, 1241, 146, 11, 137, 10, 70, 1071, 74, 922, 1124, 636, 992, 1206, 1243, 680, 1171, 382, 563, 506, 158, 410, 795, 437, 1158, 69, 539, 758, 801, 1061, 1160, 292, 898, 300, 956, 1246, 970, 1125, 603, 407, 670, 1165, 791, 834, 1259, 288]. time-dependent [1243, 1061]. time-series [1206, 680, 288]. Time-topology [1071]. time-varying [795, 898, 791]. timed [1095]. Timestamping [151, 1185]. timestamps [949]. TM [708]. tolerance [859, 902]. tolerances [693]. Tool [79, 1011]. Toolkit [6]. tools [989, 1139]. Top [909, 612, 446, 685, 500, 763, 901, 1058, 429, 401, 798, 937, 1261, 995, 254, 1068, 488, 651, 939, 545, 789, 747, 1163, 1034, 1187, 489, 694, 1188, 342, 873, 757, 441, 717, 483, 774]. Top- [909, 612, 446, 500, 763, 901, 685, 1058, 429, 798, 937, 1261, 995, 254, 1068, 488, 651, 939, 545, 789, 747, 1163, 1034, 1187, 489, 694, 1188, 342, 873, 757, 441, 717, 483, 774]. top-k [401]. Topic [124]. topics [831]. topology [1071, 759, 843, 1259]. topology-based [759]. TopX [342]. TR [1018]. TR-GCN [1018]. traceability [1076]. traces [552]. tracing [223]. Tracking [263, 798, 539]. trade [208, 1204]. trade-offs [208, 1204]. tradeoff [256]. tradeoffs [1216]. trained [1256, 1179]. training [1254, 1048, 1067, 1201, 1196, 892]. trajectories [499, 679, 543, 730]. trajectory [943, 540, 679, 539, 801, 1122, 862, 493, 538, 647, 804, 676, 868]. Transaction [5, 1, 101, 10, 2, 24, 1225, 100, 195, 628, 411, 407, 525, 802, 1117]. transaction-time [407]. Transactional [641, 125, 1214, 206, 739, 1155, 1114]. Transactions [27, 9, 671, 935, 1029]. transformation [1160]. transformations [223, 281, 1221, 607]. Transformer [1239]. transformers [1087]. transforms [303]. translation [403, 481, 188, 448]. transparent [592]. transportation [1048]. travel [795]. traversals [73]. treatment [1022, 1125]. treatment-adaptive [1022]. Tree [216, 89, 164, 47, 383, 388, 227, 530, 740, 1181, 23, 1250, 420, 498, 464, 707, 356, 24 91, 1240, 442]. Tree-based [383]. tree-like [388]. tree-pattern [420, 498]. Trees [104, 133, 19, 982, 1254, 616, 1140, 282, 300, 653, 284, 442]. trends [877, 850]. Triangle [1253, 1081, 928]. trichotomy [458]. Trie [569]. trie-based [569]. Trie-join [569]. Triejoin [1241]. tries [417, 497]. trillion [1073]. trillion-scale [1073]. triples [616]. Truss [1233, 961]. Trust [449]. Trustworthy [349]. truth [1057, 105]. truths [972]. Tunable [833]. Tunable-LSH [833]. tuning [472, 443, 314, 322, 1139, 1142, 971]. tuple [1185, 1210, 1129]. Tuples [967, 1006]. TurboLift [910, 1105]. Turn [1249]. Tutorial [4, 7]. TV [47]. TV-Tree [47]. twenty [810]. twenty-first [810]. twig [606, 469, 589]. Twitter [644]. Two [46, 1225, 1128, 854, 548]. two- [548]. Two-Dimensional [46, 854]. Two-Round [1225]. Type [81, 552, 110, 536, 111, 1047]. type-ahead [536]. Type-safe [81]. Types [55, 122, 1077, 1104]. typicality [446]. Ubiquitous [181]. ubiquity [888]. UDA [758]. UDF [1076]. ULISSE [926]. Umbra [967]. unbiased [1163]. Uncertain [1220, 315, 323, 463, 775, 770, 453, 795, 515, 488, 583, 445, 514, 545, 454, 491, 543, 579, 604, 683, 1078]. uncertainty [350, 431, 567, 898, 673]. Understanding [25, 479, 617]. undirected [588]. unfairness [962]. Unified [1048, 678, 521, 835, 761]. Uniform [60]. uniformity [623]. unifying [249]. units [524, 670]. univariate [956]. Unleashed [1257, 1210]. unobstructed [806]. UnQL [161]. unscalable [628]. unstructured [343]. Unsupervised [969, 255, 1054]. untrusted [533]. Unveiling [540]. Update [153, 285, 263, 443, 547, 220, 1255, 1181, 663]. update-intensive [443, 1181]. Updates [14, 117, 636, 467, 889, 1132, 364, 442, 1203]. Updating [54, 562, 251]. UpStream [547]. usage [1081]. use [1019]. User [836, 191, 800, 1035, 462, 1214, 1080, 866, 777]. User-cognizant [191]. users [477]. Using [112, 10, 150, 135, 115, 120, 125, 132, 325, 833, 357, 1232, 1057, 268, 190, 297, 803, 476, 344, 619, 798, 596, 744, 551, 158, 674, 193, 808, 245, 336, 409, 281, 918, 314, 322, 621, 758, 801, 1169, 1221, 862, 1062, 785, 527, 303, 1050, 415, 1047, 386, 189, 754, 706, 1101, 442, 1108, 966, 1109, 670, 461, 494, 1203, 997, 777]. Utility [1244, 661, 700]. Utility-based [700]. utilizing [829]. UV [604]. UV-diagram [604]. V [1258, 1247]. V* [484]. V*-kNN [484]. V-ADS [1258, 1247]. valid [362]. validation [786]. Value [378, 11, 1257, 1057, 1184, 781]. Value-Based [11]. valued [235, 924, 513]. Values [71, 26, 435]. Variable [137, 13]. Variable-Bit-Rate [137]. variants [873]. variety [973]. varying [795, 898, 791]. VBTree [827]. VDDA [712]. vector [1036, 310, 318, 336, 1159, 1027]. vectorized [918, 917]. vectors [724, 1188, 176]. vehicle [911]. Verifiable [1258, 1247]. verification [426]. Versatile [79, 1174, 342]. Version [1091, 65, 810, 885, 1214]. Versioning [30, 885]. vertex [1045]. vertical [232]. vertically [428]. vertices [1172]. Very [152, 250, 474, 386, 1011, 666, 176, 572]. via [231, 656, 1053, 859, 948, 627, 1086, 1049, 1189, 1051, 1174, 312, 320, 1201, 772, 661, 811, 762, 1023, 554]. video [1260, 247, 571, 777]. View [119, 163, 311, 319, 38, 1213, 210, 244]. View-Objects [38]. Views [211, 275, 107, 113, 467, 297, 193, 245, 639, 311, 319, 189, 434]. violations [632]. VIP [917]. virtual [307, 434]. visibility [935]. visible [526]. visual [645, 1043, 172, 1214, 904, 765, 249]. Visualization [1249, 712, 1212, 871]. visualization-driven [712]. visualizing REFERENCES [941]. Visually [952]. ViSWeb [249]. VLDB [750, 144, 516, 887, 557, 1028, 697, 883, 470, 812, 867, 1226, 253, 427, 309, 317, 709, 590, 749, 1084, 930, 635, 143, 144]. VLL [701]. VOD [142]. VoIP [413]. volatile [1040]. VolcanoML [1051]. Voronoi [412, 604]. voting [1231]. vp [164]. vp-Tree [164]. vs [1236]. VUS [1206]. walk [963, 793]. walk-based [793]. wall [983]. warehouse [223]. warehouses [1185, 194]. warfare [718]. warping [382, 437, 603]. Watermarking [230]. WaveCluster [152]. Wavelet [390, 152, 419]. wavelets [190]. WavingSketch [1163]. Way [20, 360, 998, 742, 335]. weak [892]. wearing [731]. web [593, 361, 528, 352, 694, 287, 585, 428, 155, 271, 160, 618, 615, 157, 184, 518, 612, 239, 249, 519, 159, 242, 617, 240, 257, 256, 411, 238, 449, 241, 379, 363]. WebSemantics [200]. WebSources [158]. weight [636, 602]. weighted [925]. weighting [503]. Weights [115]. Which [556, 398]. While [54]. why-not [828, 747]. Wide [76]. Wide-Area [76]. wild [1223]. window [1119, 1081, 360, 488, 686, 970, 1077, 1104, 763]. window-based [1081]. Windowed [570]. windows [771]. wireless [414, 289, 452]. Wise [164, 257]. WISE-Integrator [257]. within [962]. without [809, 1221, 1245, 1145]. word [400]. work [745]. work-efficient [745]. Workaholics [64, 65]. workarounds [623]. worker [1005]. workflow [286, 242, 195, 183]. workflows [783, 1199]. workload [562, 665, 1156]. workload-aware [665, 1156]. workloads [535, 722, 390, 739, 805, 667, 1138, 663, 576, 822]. workstations [443]. world [140, 588, 857, 657]. worlds [455, 873]. worst [970, 653, 771]. worst-case [970, 653, 771]. wrapper [178]. write [587, 561]. write-access [587]. write-ahead 25 [561]. write-optimized [740]. writes [731]. WWW [357]. xDBTagger [1108]. XML [387, 456, 211, 690, 570, 268, 692, 180, 481, 467, 587, 291, 218, 301, 217, 609, 215, 616, 567, 219, 214, 278, 459, 366, 341, 368, 492, 364, 527, 395, 187, 434, 183, 407, 498, 598, 348, 629]. XML-based [407]. XML-enabled [183]. XPath [218, 448, 630]. XQuery [259, 355, 261]. Yannakakis [889]. years [1128, 1211]. YmalDB [627]. York [144]. Z [485]. Z-order [485]. Z-SKY [485]. Zen [1040]. zero [648, 1165]. zero-overhead [648]. zero-shot [1165]. Zigzag [19]. zones [766, 1101]. References Breitbart:1992:TMI [1] Yuri Breitbart, Abraham Silberschatz, and Glenn R. Thompson. Transaction management issues in a failure-prone multidatabase system environment. VLDB Journal: Very Large Data Bases, 1(1):1– 39, July 1992. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/b/Breitbart:Yuri. http://ftp.informatik.rwthhtml; aachen.de/dblp/db/indices/a-tree/ http: s/Silberschatz:Abraham.html; //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/t/Thompson: Glenn_R=.html. Electronic edition. Nodine:1992:CTH [2] Marian H. Nodine and Stanley B. REFERENCES 26 Zdonik. Cooperative transaction hiBreitbart:1992:OMT erarchies: Transaction support for [5] Yuri Breitbart, Hector Garcia-Molina, design applications. VLDB Jourand Abraham Silberschatz. Overview nal: Very Large Data Bases, 1 of multidatabase transaction man(1):41–80, July 1992. CODEN agement. VLDB Journal: Very VLDBFR. ISSN 1066-8888 (print), Large Data Bases, 1(2):181–240, Oc0949-877X (electronic). URL http: tober 1992. CODEN VLDBFR. //ftp.informatik.rwth-aachen.de/ ISSN 1066-8888 (print), 0949-877X dblp/db/indices/a-tree/n/Nodine: URL http://ftp. http://ftp.informatik.(electronic). Marian_H=.html; informatik.rwth-aachen.de/dblp/ rwth-aachen.de/dblp/db/indices/ db/indices/a-tree/b/Breitbart:Yuri. a-tree/z/Zdonik:Stanley_B=.html. http://ftp.informatik.rwthhtml; Electronic edition. aachen.de/dblp/db/indices/a-tree/ Spaccapietra:1992:MIA http: g/Garcia=Molina:Hector.html; //ftp.informatik.rwth-aachen.de/ [3] Stefano Spaccapietra, Christine Pardblp/db/indices/a-tree/s/Silberschatz: ent, and Yann Dupont. Model indeAbraham.html. Electronic edition. pendent assertions for integration of Drew:1992:TII heterogeneous schemas. VLDB Journal: Very Large Data Bases, 1(1):81– [6] Pamela Drew, Roger King, and 126, July 1992. CODEN VLDBFR. Dennis Heimbigner. A toolkit for ISSN 1066-8888 (print), 0949-877X the incremental implementation of (electronic). URL http://ftp. heterogeneous database management informatik.rwth-aachen.de/dblp/ systems. VLDB Journal: Very db/indices/a-tree/d/Dupont:Yann. Large Data Bases, 1(2):241–284, Ochttp://ftp.informatik.rwthhtml; tober 1992. CODEN VLDBFR. aachen.de/dblp/db/indices/a-tree/ ISSN 1066-8888 (print), 0949-877X p/Parent:Christine.html; http: (electronic). URL http://ftp. //ftp.informatik.rwth-aachen.de/ informatik.rwth-aachen.de/dblp/ dblp/db/indices/a-tree/s/Spaccapietra: db/indices/a-tree/d/Drew:Pamela. Stefano.html. Electronic edition. http://ftp.informatik.rwthhtml; aachen.de/dblp/db/indices/a-tree/ Hsiao:1992:FDSa http: h/Heimbigner:Dennis.html; //ftp.informatik.rwth-aachen.de/ [4] David K. Hsiao. Federated databases dblp/db/indices/a-tree/k/King:Roger. and systems: Part I — a tutohtml. Electronic edition. rial on their data sharing. VLDB Journal: Very Large Data Bases, 1 Hsiao:1992:FDSb (1):127–179, July 1992. CODEN [7] David K. Hsiao. Federated databases VLDBFR. ISSN 1066-8888 (print), and systems: Part II — a tutorial on 0949-877X (electronic). URL http: their resource consolidation. VLDB //ftp.informatik.rwth-aachen.de/ Journal: Very Large Data Bases, 1 dblp/db/indices/a-tree/h/Hsiao: (2):285–310, October 1992. CODEN David_K=.html. Electronic edition. REFERENCES 27 VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/h/Hsiao: David_K=.html. Electronic edition. Yu:1993:BMB VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/j/Jensen: Christian_S=.html; http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/m/Mark:Leo.html; http://ftp.informatik.rwth-aachen. de/dblp/db/indices/a-tree/r/Roussopoulos: http://ftp.informatik. Nick.html; rwth-aachen.de/dblp/db/indices/ a-tree/s/Sellis:Timos_K=.html. Electronic edition. [8] Philip S. Yu and Douglas W. Cornell. Buffer management based on return on consumption in a multiquery environment. VLDB Journal: Very Large Data Bases, 2(1):1–37, January 1993. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X Haritsa:1993:VBS (electronic). URL http://ftp. [11] Jayant R. Haritsa, Michael J. Carey, informatik.rwth-aachen.de/dblp/ and Miron Livny. Value-based db/indices/a-tree/c/Cornell:Douglas_ scheduling in real-time database http://ftp.informatik. W=.html; systems. VLDB Journal: Very rwth-aachen.de/dblp/db/indices/ Large Data Bases, 2(2):117–152, a-tree/y/Yu:Philip_S=.html. ElecApril 1993. CODEN VLDBFR. tronic edition. ISSN 1066-8888 (print), 0949-877X Harder:1993:CCI (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ [9] Theo Härder and Kurt Rothermel. db/indices/a-tree/c/Carey:Michael_ Concurrency control issues in nested http://ftp.informatik. J=.html; transactions. VLDB Journal: Very rwth-aachen.de/dblp/db/indices/ Large Data Bases, 2(1):39–74, Jana-tree/h/Haritsa:Jayant_R=.html; uary 1993. CODEN VLDBFR. http://ftp.informatik.rwth-aachen. ISSN 1066-8888 (print), 0949-877X de/dblp/db/indices/a-tree/l/Livny: (electronic). URL http://ftp. Miron.html. Electronic edition. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/h/H=auml=rder: Grant:1993:QLR http://ftp.informatik. Theo.html; [12] John Grant, Witold Litwin, Nick rwth-aachen.de/dblp/db/indices/ Roussopoulos, and Timos K. Sela-tree/r/Rothermel:Kurt.html. Eleclis. Query languages for relational tronic edition. multidatabases. VLDB Journal: Jensen:1993:UDT Very Large Data Bases, 2(2):153– [10] Christian S. Jensen, Leo Mark, Nick 171, April 1993. CODEN VLDBFR. Roussopoulos, and Timos K. Sellis. UsISSN 1066-8888 (print), 0949-877X ing differential techniques to efficiently (electronic). URL http://ftp. support transaction time. VLDB informatik.rwth-aachen.de/dblp/ Journal: Very Large Data Bases, 2 db/indices/a-tree/g/Grant:John. http://ftp.informatik.rwth(1):75–116, January 1993. CODEN html; REFERENCES 28 aachen.de/dblp/db/indices/a-tree/ dblp/db/indices/a-tree/e/Elmagarmid: http://ftp.informatik. l/Litwin:Witold.html; http:// Ahmed_K=.html; ftp.informatik.rwth-aachen.de/dblp/ rwth-aachen.de/dblp/db/indices/ db/indices/a-tree/r/Roussopoulos: a-tree/k/Kim:Won.html. Electronic http://ftp.informatik. edition. Nick.html; rwth-aachen.de/dblp/db/indices/ Anonymous:1993:Ca a-tree/s/Sellis:Timos_K=.html. Electronic edition. [15] Anonymous. Column. VLDB Journal: Very Large Data Bases, 2(2):??, April Neufeld:1993:GCT 1993. CODEN VLDBFR. ISSN 1066[13] Andrea Neufeld, Guido Moerkotte, 8888 (print), 0949-877X (electronic). and Peter C. Lockemann. GenAnonymous:1993:Cb erating consistent test data for a variable set of general consistency [16] Anonymous. Column. VLDB Journal: constraints. VLDB Journal: Very Very Large Data Bases, 2(2):??, April Large Data Bases, 2(2):173–213, 1993. CODEN VLDBFR. ISSN 1066April 1993. CODEN VLDBFR. 8888 (print), 0949-877X (electronic). ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. Tomasic:1993:SIP informatik.rwth-aachen.de/dblp/ db/indices/a-tree/l/Lockemann:Peter_ [17] Anthony Tomasic and Hector GarciaMolina. Special issue in paralhttp://ftp.informatik. C=.html; lelism in database systems: Query rwth-aachen.de/dblp/db/indices/ processing and inverted indices in a-tree/m/Moerkotte:Guido.html; shared-nothing document informahttp://ftp.informatik.rwth-aachen. tion retrieval systems. VLDB Jourde/dblp/db/indices/a-tree/n/Neufeld: nal: Very Large Data Bases, 2 Andrea.html. Electronic edition. (3):243–275, July 1993. CODEN Du:1993:SCU VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: [14] Weimin Du, Ahmed K. Elma//ftp.informatik.rwth-aachen.de/ garmid, Won Kim, and Omran A. dblp/db/indices/a-tree/g/Garcia= Bukhres. Supporting consistent uphttp://ftp. Molina:Hector.html; dates in replicated multidatabase informatik.rwth-aachen.de/dblp/ systems. VLDB Journal: Very db/indices/a-tree/t/Tomasic:Anthony. Large Data Bases, 2(2):215–241, html. Electronic edition. April 1993. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X Tomasic:1993:QPI (electronic). URL http://ftp. [18] Anthony Tomasic and Hector Garciainformatik.rwth-aachen.de/dblp/ db/indices/a-tree/b/Bukhres:Omran_ Molina. Query processing and inhttp://ftp.informatik. A=.html; verted indices in shared: nothing text rwth-aachen.de/dblp/db/indices/ document information retrieval sysa-tree/d/Du:Weimin.html; http: tems. VLDB Journal: Very Large //ftp.informatik.rwth-aachen.de/ Data Bases, 2(3):243–276, July 1993. REFERENCES 29 CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Ziane:1993:PQP systems. VLDB Journal: Very Large Data Bases, 2(3):331–360, July 1993. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/e/Elmagarmid: Ahmed_K=.html; http://ftp.informatik. rwth-aachen.de/dblp/db/indices/ a-tree/z/Zhang:Aidong.html. Electronic edition. [19] Mikal Ziane, Mohamed Zaı̈t, and Pascale Borla-Salamet. Parallel query processing with zigzag trees. VLDB Journal: Very Large Data Bases, 2 (3):277–301, July 1993. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //ftp.informatik.rwth-aachen.de/ Anonymous:1993:SIP dblp/db/indices/a-tree/b/Borla= Salamet:Pascale.html; http:// [22] Anonymous. Special issue in paralftp.informatik.rwth-aachen.de/dblp/ lelism in database systems. VLDB db/indices/a-tree/z/Za=iuml=t:Mohamed. Journal: Very Large Data Bases, 2 http://ftp.informatik.rwthhtml; (3):??, July 1993. CODEN VLDBFR. aachen.de/dblp/db/indices/a-tree/ ISSN 1066-8888 (print), 0949-877X z/Ziane:Mikal.html. Electronic edi(electronic). tion. Srinivasan:1993:PBT Hua:1993:CDS [20] Kien A. Hua, Yu lung Lo, and Honesty C. Young. Considering data skew factor in multi-way join query optimization for parallel execution. VLDB Journal: Very Large Data Bases, 2(3):303–330, July 1993. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/h/Hua:Kien_A= .html; http://ftp.informatik. rwth-aachen.de/dblp/db/indices/ a-tree/l/Lo:Yu=lung.html; http: //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/y/Young: Honesty_C=.html. Electronic edition. Zhang:1993:TGC [21] Aidong Zhang and Ahmed K. Elmagarmid. A theory of global concurrency control in multidatabase [23] V. Srinivasan and Michael J. Carey. Performance of B+ tree concurrency control algorithms. VLDB Journal: Very Large Data Bases, 2(4): 361–406, October 1993. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/c/Carey: http://ftp.informatik. Michael_J=.html; rwth-aachen.de/dblp/db/indices/ a-tree/s/Srinivasan:V=.html. Electronic edition. Weikum:1993:MLT [24] Gerhard Weikum and Christof Hasse. Multi-level transaction management for complex objects: Implementation, performance, parallelism. VLDB Journal: Very Large Data Bases, 2(4): 407–453, October 1993. CODEN VLDBFR. ISSN 1066-8888 (print), REFERENCES 30 Data Bases, 3(1):1–28, January 1994. 0949-877X (electronic). URL http: CODEN VLDBFR. ISSN 1066//ftp.informatik.rwth-aachen.de/ 8888 (print), 0949-877X (electronic). dblp/db/indices/a-tree/h/Hasse: http://ftp.informatik. URL http://ftp.informatik.rwthChristof.html; aachen.de/dblp/db/indices/a-tree/ rwth-aachen.de/dblp/db/indices/ g/Georgakopoulos:Dimitrios.html; a-tree/w/Weikum:Gerhard.html. Elechttp://ftp.informatik.rwth-aachen. tronic edition. de/dblp/db/indices/a-tree/l/Litwin: Storey:1993:USR Witold.html; http://ftp.informatik. [25] Veda C. Storey. Understanding serwth-aachen.de/dblp/db/indices/ mantic relationships. VLDB Joura-tree/r/Rusinkiewicz:Marek.html. nal: Very Large Data Bases, 2(4): Electronic edition. 455–488, October 1993. CODEN Whang:1994:DMD VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: [28] Kyu Young Whang, Sang Wook Kim, //ftp.informatik.rwth-aachen.de/ and Gio Wiederhold. Dynamic maindblp/db/indices/a-tree/s/Storey: tenance of data distribution for seVeda_C=.html. Electronic edition. lectivity estimation. VLDB Journal: Very Large Data Bases, 3(1):29–51, Tseng:1993:SMS January 1994. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X [26] Frank Shou-Cheng Tseng, Arbee L. P. (electronic). URL http://ftp. Chen, and W.-P. Yang. Searching a informatik.rwth-aachen.de/dblp/ minimal semantically-equivalent subset db/indices/a-tree/k/Kim:Sang=Wook. of a set of partial values. VLDB Jourhttp://ftp.informatik.rwthhtml; nal: Very Large Data Bases, 2(4):489– aachen.de/dblp/db/indices/a-tree/ 512, October 1993. CODEN VLDBFR. w/Whang:Kyu=Young.html; http: ISSN 1066-8888 (print), 0949-877X //ftp.informatik.rwth-aachen.de/ (electronic). URL http://ftp. dblp/db/indices/a-tree/w/Wiederhold: informatik.rwth-aachen.de/dblp/ Gio.html. Electronic edition. db/indices/a-tree/c/Chen:Arbee_ http://ftp.informatik. L=_P=.html; Kamel:1994:PBO rwth-aachen.de/dblp/db/indices/ [29] Nabil Kamel, Ping Wu, and Stana-tree/t/Tseng:Frank_Shou=Cheng. ley Y. W. Su. A pattern-based http://ftp.informatik.rwthhtml; object calculus. VLDB Journal: aachen.de/dblp/db/indices/a-tree/ Very Large Data Bases, 3(1):53–76, y/Yang:W==P=.html. Electronic ediJanuary 1994. CODEN VLDBFR. tion. ISSN 1066-8888 (print), 0949-877X Georgakopoulos:1994:CST (electronic). URL http://ftp. [27] Dimitrios Georgakopoulos, Marek informatik.rwth-aachen.de/dblp/ Rusinkiewicz, and Witold Litwin. db/indices/a-tree/k/Kamel:Nabil. http://ftp.informatik.rwthChronological scheduling of transhtml; aachen.de/dblp/db/indices/a-tree/ actions with temporal dependens/Su:Stanley_Y=_W=.html; http: cies. VLDB Journal: Very Large REFERENCES 31 //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/w/Wu:Ping. html. Electronic edition. Sciore:1994:VCM [30] Edward Sciore. Versioning and configuration management in an objectoriented data model. VLDB Journal: Very Large Data Bases, 3(1): 77–106, January 1994. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/s/Sciore: Edward.html. Electronic edition. Ramamohanarao:1994:IDD [31] Kotagiri Ramamohanarao and James Harland. An introduction to deductive database languages and systems. VLDB Journal: Very Large Data Bases, 3(2):107–122, April 1994. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Ramamohanarao:1994:SIP Derr:1994:GND [33] Marcia A. Derr, Shinichi Morishita, and Geoffrey Phipps. The glue-nail deductive database system: Design, implementation, and evaluation. VLDB Journal: Very Large Data Bases, 3(2):123–160, April 1994. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/d/Derr:Marcia_ http://ftp.informatik. A=.html; rwth-aachen.de/dblp/db/indices/ a-tree/m/Morishita:Shinichi.html; http://ftp.informatik.rwth-aachen. de/dblp/db/indices/a-tree/p/Phipps: Geoffrey.html. Electronic edition. Ramakrishnan:1994:CDS [34] Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan, and Praveen Seshadri. The CORAL deductive system. VLDB Journal: Very Large Data Bases, 3(2):161–210, April 1994. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/r/Ramakrishnan: http://ftp.informatik. Raghu.html; rwth-aachen.de/dblp/db/indices/ a-tree/s/Seshadri:Praveen.html; http://ftp.informatik.rwth-aachen. de/dblp/db/indices/a-tree/s/Srivastava: http://ftp.informatik. Divesh.html; rwth-aachen.de/dblp/db/indices/ a-tree/s/Sudarshan:S=.html. Electronic edition. [32] Kotagiri Ramamohanarao and James Harland. Special issue on prototypes of deductive database systems: An introduction to deductive database languages and systems. VLDB Journal: Very Large Data Bases, 3(2):107– 122, April 1994. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/h/Harland:James. http://ftp.informatik.rwthhtml; Kiessling:1994:DSE aachen.de/dblp/db/indices/a-tree/ r/Ramamohanarao:Kotagiri.html. Elec- [35] Werner Kießling, Helmut Schmidt, tronic edition. Werner Strauß, and Gerhard Dünzinger. REFERENCES 32 dblp/db/indices/a-tree/s/Stuckey: DECLARE and SDS: Early efhttp://ftp.informatik. Peter_J=.html; forts to commercialize deductive rwth-aachen.de/dblp/db/indices/ database technology. VLDB Joura-tree/v/Vaghani:Jayen.html. Elecnal: Very Large Data Bases, 3 tronic edition. (2):211–243, April 1994. CODEN VLDBFR. ISSN 1066-8888 (print), Anonymous:1994:SIP 0949-877X (electronic). URL http: //ftp.informatik.rwth-aachen.de/ [37] Anonymous. Special issue on prodblp/db/indices/a-tree/d/D=uuml= totypes of deductive database sysnzinger:Gerhard.html; http:// tems. VLDB Journal: Very Large Data ftp.informatik.rwth-aachen.de/dblp/ Bases, 3(2):??, April 1994. CODEN db/indices/a-tree/k/Kie=szlig=ling: VLDBFR. ISSN 1066-8888 (print), http://ftp.informatik. Werner.html; 0949-877X (electronic). rwth-aachen.de/dblp/db/indices/ Lee:1994:EIV a-tree/s/Schmidt:Helmut.html; http://ftp.informatik.rwth-aachen. [38] Byung Suk Lee and Gio Wiederhold. de/dblp/db/indices/a-tree/s/Strau= Efficiently instantiating view-objects szlig=:Werner.html. Electronic edifrom remote relational databases. tion. VLDB Journal: Very Large Data Vaghani:1994:ADD Bases, 3(3):289–323, July 1994. CODEN VLDBFR. ISSN 1066[36] Jayen Vaghani, Kotagiri Ramamoha8888 (print), 0949-877X (electronic). narao, David B. Kemp, Zoltan SomURL http://ftp.informatik.rwthogyi, Peter J. Stuckey, Tim S. Leask, aachen.de/dblp/db/indices/a-tree/ and James Harland. The Aditi del/Lee:Byung_Suk.html; http:// ductive database system. VLDB Jourftp.informatik.rwth-aachen.de/dblp/ nal: Very Large Data Bases, 3(2):245– db/indices/a-tree/w/Wiederhold: 288, April 1994. CODEN VLDBFR. Gio.html. Electronic edition. ISSN 1066-8888 (print), 0949-877X Barbara-Milla:1994:DPT (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/h/Harland:James. [39] Daniel Barbará-Millá and Hector Garcia-Molina. The demarcation prohttp://ftp.informatik.rwthhtml; tocol: a technique for maintaining conaachen.de/dblp/db/indices/a-tree/ straints in distributed database sysk/Kemp:David_B=.html; http:// tems. VLDB Journal: Very Large ftp.informatik.rwth-aachen.de/dblp/ Data Bases, 3(3):325–353, July 1994. db/indices/a-tree/l/Leask:Tim_S= CODEN VLDBFR. ISSN 1066-8888 .html; http://ftp.informatik. (print), 0949-877X (electronic). rwth-aachen.de/dblp/db/indices/ a-tree/r/Ramamohanarao:Kotagiri. Barbara:1994:DPT http://ftp.informatik.rwthhtml; aachen.de/dblp/db/indices/a-tree/ [40] Daniel Barbará and Hector Garcias/Somogyi:Zoltan.html; http:/ Molina. The demarcation protocol: a /ftp.informatik.rwth-aachen.de/ technique for maintaining constraints REFERENCES 33 in distributed database systems. VLDB Journal: Very Large Data Bases, 3 (3):325–353, July 1994. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/b/Barbar= http://ftp. aacute=:Daniel.html; informatik.rwth-aachen.de/dblp/ db/indices/a-tree/g/Garcia=Molina: Hector.html. Electronic edition. Bertino:1994:ICO [41] Elisa Bertino. Index configuration in object-oriented databases. VLDB Journal: Very Large Data Bases, 3 (3):355–399, July 1994. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/b/Bertino: Elisa.html. Electronic edition. Guting:1994:ISD [42] Ralf Hartmut Güting. An introduction to spatial database systems. VLDB Journal: Very Large Data Bases, 3 (4):357–399, October 1994. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Guting:1994:SIS [43] Ralf Hartmut Güting. Special issue on spatial database systems: An introduction to spatial database systems. VLDB Journal: Very Large Data Bases, 3(4):357–399, October 1994. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/g/G=uuml=ting: Ralf_Hartmut.html. Electronic edition. Baumann:1994:MMD [44] Peter Baumann. Management of multidimensional discrete data. VLDB Journal: Very Large Data Bases, 3(4):401– 444, October 1994. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/b/Baumann:Peter. html. Electronic edition. Chu:1994:SMA [45] Wesley W. Chu, Ion Tim Ieong, and Ricky K. Taira. A semantic modeling approach for image retrieval by content. VLDB Journal: Very Large Data Bases, 3(4):445–477, October 1994. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/c/Chu:Wesley_ http://ftp.informatik. W=.html; rwth-aachen.de/dblp/db/indices/ http: a-tree/i/Ieong:Ion_Tim.html; //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/t/Taira: Ricky_K=.html. Electronic edition. Papadias:1994:QRS [46] Dimitris Papadias and Timos K. Sellis. Qualitative representation of spatial knowledge in two-dimensional space. VLDB Journal: Very Large Data Bases, 3(4):479–516, October 1994. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/p/Papadias:Dimitris. http://ftp.informatik.rwthhtml; aachen.de/dblp/db/indices/a-tree/ REFERENCES 34 s/Sellis:Timos_K=.html. Electronic edition. Lin:1994:TTI http://ftp.informatik.rwth-aachen. de/dblp/db/indices/a-tree/m/Mylopoulos: http://ftp.informatik. John.html; rwth-aachen.de/dblp/db/indices/ a-tree/v/Vassiliou:Yannis.html. Electronic edition. [47] King Ip Lin, H. V. Jagadish, and Christos Faloutsos. The TVtree: An index structure for highClifton:1995:HDQ dimensional data. VLDB Journal: Very Large Data Bases, 3(4):517–542, [50] Chris Clifton, Hector Garcia-Molina, October 1994. CODEN VLDBFR. and David Bloom. HyperFile: a ISSN 1066-8888 (print), 0949-877X data and query model for doc(electronic). URL http://ftp. uments. VLDB Journal: Very informatik.rwth-aachen.de/dblp/ Large Data Bases, 4(1):45–86, Jandb/indices/a-tree/f/Faloutsos:Christos. uary 1995. CODEN VLDBFR. http://ftp.informatik.rwthhtml; ISSN 1066-8888 (print), 0949-877X aachen.de/dblp/db/indices/a-tree/ (electronic). URL http://ftp. j/Jagadish:H=_V=.html; http:/ informatik.rwth-aachen.de/dblp/ /ftp.informatik.rwth-aachen.de/ db/indices/a-tree/b/Bloom:David. dblp/db/indices/a-tree/l/Lin:King= http://ftp.informatik.rwthhtml; Ip.html. Electronic edition. aachen.de/dblp/db/indices/a-tree/ Anonymous:1994:SIS [48] Anonymous. Special issue on spatial database systems. VLDB Journal: Very Large Data Bases, 3(4):??, October 1994. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). c/Clifton:Chris.html; http:// ftp.informatik.rwth-aachen.de/dblp/ db/indices/a-tree/g/Garcia=Molina: Hector.html. Electronic edition. Agrawal:1995:OSL [51] Divyakant Agrawal, Amr El Abbadi, Richard Jeffers, and Lijing Lin. Ordered shared locks for realConstantopoulos:1995:SIB time databases. VLDB Journal: [49] Panos Constantopoulos, Matthias Very Large Data Bases, 4(1):87–126, Jarke, John Mylopoulos, and Yannis January 1995. CODEN VLDBFR. Vassiliou. The software information ISSN 1066-8888 (print), 0949-877X base: a server for reuse. VLDB Jour(electronic). URL http://ftp. nal: Very Large Data Bases, 4(1):1– informatik.rwth-aachen.de/dblp/ 43, January 1995. CODEN VLDBFR. db/indices/a-tree/a/Abbadi:Amr_ http://ftp.informatik. ISSN 1066-8888 (print), 0949-877X El.html; rwth-aachen.de/dblp/db/indices/ (electronic). URL http://ftp. a-tree/a/Agrawal:Divyakant.html; informatik.rwth-aachen.de/dblp/ db/indices/a-tree/c/Constantopoulos: http://ftp.informatik.rwth-aachen. http://ftp.informatik. de/dblp/db/indices/a-tree/j/Jeffers: Panos.html; http://ftp.informatik. rwth-aachen.de/dblp/db/indices/ Richard.html; rwth-aachen.de/dblp/db/indices/ a-tree/j/Jarke:Matthias.html; REFERENCES 35 a-tree/l/Lin:Lijing.html. tronic edition. Elec- Dan:1995:CDA 241, April 1995. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/o/Oliv=eacute= :Antoni.html; http://ftp.informatik. rwth-aachen.de/dblp/db/indices/ a-tree/t/Teniente:Ernest.html. Electronic edition. [52] Asit Dan, Philip S. Yu, and Jen Yao Chung. Characterization of database access pattern for analytic prediction of buffer hit probability. VLDB Journal: Very Large Data Bases, 4 (1):127–154, January 1995. CODEN Guting:1995:RBS VLDBFR. ISSN 1066-8888 (print), [55] Ralf Hartmut Güting and Markus 0949-877X (electronic). URL http: Schneider. Realm-based spatial data //ftp.informatik.rwth-aachen.de/ types: The ROSE algebra. VLDB dblp/db/indices/a-tree/c/Chung: http://ftp.informatik. Journal: Very Large Data Bases, 4 Jen=Yao.html; rwth-aachen.de/dblp/db/indices/ (2):243–286, April 1995. CODEN a-tree/d/Dan:Asit.html; http: VLDBFR. ISSN 1066-8888 (print), //ftp.informatik.rwth-aachen.de/ 0949-877X (electronic). URL http: dblp/db/indices/a-tree/y/Yu:Philip_ //ftp.informatik.rwth-aachen.de/ S=.html. Electronic edition. dblp/db/indices/a-tree/g/G=uuml= ting:Ralf_Hartmut.html; http: Peckham:1995:DME //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/s/Schneider: [53] Joan Peckham, Bonnie MacKellar, and Markus.html. Electronic edition. Michael Doherty. Data model for extensible support of explicit relationTempleton:1995:IDC ships in design databases. VLDB Jour[56] Marjorie Templeton, Herbert Hennal: Very Large Data Bases, 4(2):157– ley, Edward Maros, and Darrel J. 191, April 1995. CODEN VLDBFR. Van Buer. InterViso: Dealing ISSN 1066-8888 (print), 0949-877X with the complexity of federated (electronic). URL http://ftp. database access. VLDB Journal: informatik.rwth-aachen.de/dblp/ db/indices/a-tree/d/Doherty:Michael. Very Large Data Bases, 4(2):287– http://ftp.informatik.rwthhtml; 317, April 1995. CODEN VLDBFR. aachen.de/dblp/db/indices/a-tree/ ISSN 1066-8888 (print), 0949-877X m/MacKellar:Bonnie.html; http: (electronic). URL http://ftp. //ftp.informatik.rwth-aachen.de/ informatik.rwth-aachen.de/dblp/ dblp/db/indices/a-tree/p/Peckham: db/indices/a-tree/b/Buer:Darrel_ http://ftp.informatik. Joan.html. Electronic edition. J=_Van.html; rwth-aachen.de/dblp/db/indices/ Teniente:1995:UKB a-tree/h/Henley:Herbert.html; http://ftp.informatik.rwth-aachen. [54] Ernest Teniente and Antoni Olivé. Upde/dblp/db/indices/a-tree/m/Maros: dating knowledge bases while mainhttp://ftp.informatik. Edward.html; taining their consistency. VLDB Jourrwth-aachen.de/dblp/db/indices/ nal: Very Large Data Bases, 4(2):193– REFERENCES 36 a-tree/t/Templeton:Marjorie.html. Electronic edition. Ozsu:1995:TUB [60] M. Tamer Özsu, Randal J. Peters, Duane Szafron, Boman Irani, [57] Malcolm P. Atkinson and Ronald MorAnna Lipka, and Adriana Muñoz. rison. Special issue on persistent TIGUKAT: a uniform behavioral obobject systems: Orthogonally persisjectbase management system. VLDB tent object systems. VLDB JourJournal: Very Large Data Bases, 4 nal: Very Large Data Bases, 4(3):319– (3):445–492, July 1995. CODEN 401, July 1995. CODEN VLDBFR. VLDBFR. ISSN 1066-8888 (print), ISSN 1066-8888 (print), 0949-877X 0949-877X (electronic). URL http: (electronic). URL http://ftp. //ftp.informatik.rwth-aachen.de/ informatik.rwth-aachen.de/dblp/ dblp/db/indices/a-tree/=/=Ouml= db/indices/a-tree/a/Atkinson:Malcolm_ zsu:M=_Tamer.html; http://ftp. http://ftp.informatik. P=.html; informatik.rwth-aachen.de/dblp/ rwth-aachen.de/dblp/db/indices/ db/indices/a-tree/i/Irani:Boman. a-tree/m/Morrison:Ronald.html. Elechttp://ftp.informatik.rwthhtml; tronic edition. aachen.de/dblp/db/indices/a-tree/ Atkinson:1995:OPO l/Lipka:Anna.html; http://ftp.informatik. rwth-aachen.de/dblp/db/indices/ [58] Malcolm Atkinson and Ronald Mora-tree/m/Mu=ntilde=oz:Adriana.html; rison. Orthogonally persistent object http://ftp.informatik.rwth-aachen. systems. VLDB Journal: Very Large de/dblp/db/indices/a-tree/p/Peters: Data Bases, 4(3):319–402, July 1995. http://ftp.informatik. Randal_J=.html; CODEN VLDBFR. ISSN 1066-8888 rwth-aachen.de/dblp/db/indices/ (print), 0949-877X (electronic). a-tree/s/Szafron:Duane.html. Electronic edition. Albano:1995:FPL Atkinson:1995:SIP Benzaken:1995:TDP [59] Antonio Albano, Giorgio Ghelli, and Renzo Orsini. Fibonacci: a [61] Véronique Benzaken and Anne Doucet. programming language for object Thémis: a database programming databases. VLDB Journal: Very language handling integrity conLarge Data Bases, 4(3):403–444, straints. VLDB Journal: Very July 1995. CODEN VLDBFR. Large Data Bases, 4(3):493–517, ISSN 1066-8888 (print), 0949-877X July 1995. CODEN VLDBFR. (electronic). URL http://ftp. ISSN 1066-8888 (print), 0949-877X informatik.rwth-aachen.de/dblp/ db/indices/a-tree/a/Albano:Antonio. (electronic). URL http://ftp. http://ftp.informatik.rwthhtml; informatik.rwth-aachen.de/dblp/ aachen.de/dblp/db/indices/a-tree/ db/indices/a-tree/b/Benzaken:V= http://ftp. g/Ghelli:Giorgio.html; http:/ eacute=ronique.html; informatik.rwth-aachen.de/dblp/ /ftp.informatik.rwth-aachen.de/ db/indices/a-tree/d/Doucet:Anne. dblp/db/indices/a-tree/o/Orsini: html. Electronic edition. Renzo.html. Electronic edition. REFERENCES 37 Kemper:1995:APS strategies in mobile environments (extended version). VLDB Journal: Very Large Data Bases, 4(4):567–602, October 1995. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [62] Alfons Kemper and Donald Kossmann. Adaptable pointer swizzling strategies in object bases: Design, realization, and quantitative analysis. VLDB Journal: Very Large Data Bases, 4 Nyberg:1995:ACS (3):519–566, July 1995. CODEN VLDBFR. ISSN 1066-8888 (print), [66] Chris Nyberg, Tom Barclay, Zarka 0949-877X (electronic). URL http: Cvetanovic, Jim Gray, and David B. //ftp.informatik.rwth-aachen.de/ Lomet. AlphaSort: a cache-sensitive dblp/db/indices/a-tree/k/Kemper: parallel external sort. VLDB Jourhttp://ftp.informatik. Alfons.html; nal: Very Large Data Bases, 4(4):603– rwth-aachen.de/dblp/db/indices/ 627, October 1995. CODEN VLDBFR. a-tree/k/Kossmann:Donald.html. ElecISSN 1066-8888 (print), 0949-877X tronic edition. (electronic). URL http://ftp. Anonymous:1995:SIP [63] Anonymous. Special issue on persistent object systems. VLDB Journal: Very Large Data Bases, 4(3):??, July 1995. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Barbara:1995:SSO [64] Daniel Barbará and Tomasz Imielinski. Special system-oriented section: The best of SIGMOD 1994: Sleepers and workaholics: Caching strategies in mobile environments. VLDB Journal: Very Large Data Bases, 4 (4):567–602, October 1995. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/b/Barbar= http://ftp. aacute=:Daniel.html; informatik.rwth-aachen.de/dblp/ db/indices/a-tree/i/Imielinski: Tomasz.html. Electronic edition. Barbara:1995:SWC [65] Daniel Barbará and Tomasz Imieliński. Sleepers and workaholics: caching informatik.rwth-aachen.de/dblp/ db/indices/a-tree/b/Barclay:Tom. http://ftp.informatik.rwthhtml; aachen.de/dblp/db/indices/a-tree/ c/Cvetanovic:Zarka.html; http: //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/g/Gray:Jim. http://ftp.informatik.rwthhtml; aachen.de/dblp/db/indices/a-tree/ l/Lomet:David_B=.html; http:/ /ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/n/Nyberg: Chris.html. Electronic edition. White:1995:QHP [67] Seth J. White and David J. DeWitt. QuickStore: a high performance mapped object store. VLDB Journal: Very Large Data Bases, 4 (4):629–673, October 1995. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/d/DeWitt: http://ftp.informatik. David_J=.html; rwth-aachen.de/dblp/db/indices/ a-tree/w/White:Seth_J=.html. Electronic edition. REFERENCES 38 Swami:1995:EPF Abiteboul:1995:PLM [71] Serge Abiteboul and Catriel Beeri. The [68] Arun N. Swami and K. Bernhard power of languages for the manipulaSchiefer. Estimating page fetches tion of complex values. VLDB Jourfor index scans with finite LRU nal: Very Large Data Bases, 4(4):727– buffers. VLDB Journal: Very 794, October 1995. CODEN VLDBFR. Large Data Bases, 4(4):675–701, OcISSN 1066-8888 (print), 0949-877X tober 1995. CODEN VLDBFR. (electronic). URL http://ftp. ISSN 1066-8888 (print), 0949-877X informatik.rwth-aachen.de/dblp/ (electronic). URL http://ftp. db/indices/a-tree/a/Abiteboul:Serge. informatik.rwth-aachen.de/dblp/ http://ftp.informatik.rwthhtml; db/indices/a-tree/s/Schiefer:K=_ aachen.de/dblp/db/indices/a-tree/ http://ftp.informatik. Bernhard.html; b/Beeri:Catriel.html. Electronic rwth-aachen.de/dblp/db/indices/ edition. a-tree/s/Swami:Arun_N=.html. Electronic edition. Anonymous:1995:SSO Landau:1995:HQA [69] Gad M. Landau, Jeanette P. Schmidt, and Vassilis J. Tsotras. Historical queries along multiple lines of time evolution. VLDB Journal: Very Large Data Bases, 4(4):703–726, October 1995. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). [72] Anonymous. Special system-oriented section: the best of SIGMOD ‘94. VLDB Journal: Very Large Data Bases, 4(4):??, October 1995. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). DeWitt:1996:POT [73] David J. De Witt, Jeffrey F. Naughton, John C. Shafer, and Shivakumar Venkataraman. Paralleliz[70] Gad M. Landau, Jeanette P. Schmidt, ing OODBMS traversals: a perand Vassilis J. Tsotras. Regular journal formance evaluation. VLDB Jourarticles: Historical queries along multinal: Very Large Data Bases, 5 ple lines of time evolution. VLDB Jour(1):3–18, January 1996. CODEN nal: Very Large Data Bases, 4(4):703– VLDBFR. ISSN 1066-8888 (print), 726, October 1995. CODEN VLDBFR. 0949-877X (electronic). URL http: ISSN 1066-8888 (print), 0949-877X //ftp.informatik.rwth-aachen.de/ (electronic). URL http://ftp. dblp/db/indices/a-tree/d/DeWitt: http://ftp.informatik. informatik.rwth-aachen.de/dblp/ David_J=.html; rwth-aachen.de/dblp/db/indices/ db/indices/a-tree/l/Landau:Gad_ http://ftp.informatik. a-tree/n/Naughton:Jeffrey_F=.html; M=.html; http://ftp.informatik.rwth-aachen. rwth-aachen.de/dblp/db/indices/ a-tree/s/Schmidt:Jeanette_P=.html; de/dblp/db/indices/a-tree/s/Shafer: http://ftp.informatik.rwth-aachen. http://ftp.informatik. John_C=.html; de/dblp/db/indices/a-tree/t/Tsotras: rwth-aachen.de/dblp/db/indices/ a-tree/v/Venkataraman:Shivakumar. Vassilis_J=.html. Electronic edition. Landau:1995:RJA REFERENCES 39 for client-server database architechtml; http://link.springer.de/ tures. VLDB Journal: Very link/service/journals/00778/bibs/ Large Data Bases, 5(1):35–47, Jan6005001/60050003.htm; http://link. uary 1996. CODEN VLDBFR. springer.de/link/service/journals/ ISSN 1066-8888 (print), 0949-877X 00778/papers/6005001/60050003.pdf; URL http://ftp. http://link.springer.de/link/service/ (electronic). journals/00778/papers/6005001/60050003. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/b/Basu:Julie. ps.gz. Electronic edition. html; http://ftp.informatik.rwthSivasankaran:1996:PAR aachen.de/dblp/db/indices/a-tree/ k/Keller:Arthur_M=.html; http: [74] Rajendran M. Sivasankaran, John A. //link.springer.de/link/service/ Stankovic, Donald F. Towsley, Bhaskar journals/00778/bibs/6005001/60050035. Purimetla, and Krithi Ramamritham. htm; http://link.springer.de/link/ Priority assignment in real-time acservice/journals/00778/papers/6005001/ tive databases. VLDB Journal: http://link.springer. 60050035.pdf; Very Large Data Bases, 5(1):19–34, de/link/service/journals/00778/ January 1996. CODEN VLDBFR. papers/6005001/60050035.ps.gz. ElecISSN 1066-8888 (print), 0949-877X tronic edition. (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ Stonebraker:1996:MWA db/indices/a-tree/p/Purimetla:Bhaskar. http://ftp.informatik.rwth- [76] Michael Stonebraker, Paul M. Aoki, html; Witold Litwin, Avi Pfeffer, Adam aachen.de/dblp/db/indices/a-tree/ Sah, Jeff Sidell, Carl Staelin, and Anhttp: r/Ramamritham:Krithi.html; drew Yu. Mariposa: a wide-area dis//ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/s/Sivasankaran: tributed database system. VLDB Journal: Very Large Data Bases, 5(1):48– Rajendran_M=.html; http://ftp. 63, January 1996. CODEN VLDBFR. informatik.rwth-aachen.de/dblp/ ISSN 1066-8888 (print), 0949-877X db/indices/a-tree/s/Stankovic:John_ (electronic). URL http://ftp. http://ftp.informatik. A=.html; informatik.rwth-aachen.de/dblp/ rwth-aachen.de/dblp/db/indices/ db/indices/a-tree/a/Aoki:Paul_M= a-tree/t/Towsley:Donald_F=.html; http://ftp.informatik. http://link.springer.de/link/service/ .html; rwth-aachen.de/dblp/db/indices/ journals/00778/bibs/6005001/60050019. http: a-tree/l/Litwin:Witold.html; htm; http://link.springer.de/link/ service/journals/00778/papers/6005001/ //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/p/Pfeffer: http://link.springer. 60050019.pdf; http://ftp.informatik. Avi.html; de/link/service/journals/00778/ rwth-aachen.de/dblp/db/indices/ papers/6005001/60050019.ps.gz. Eleca-tree/s/Sah:Adam.html; http: tronic edition. //ftp.informatik.rwth-aachen.de/ Keller:1996:PBC dblp/db/indices/a-tree/s/Sidell: http://ftp.informatik. [75] Arthur M. Keller and Julie Basu. Jeff.html; rwth-aachen.de/dblp/db/indices/ A predicate-based caching scheme REFERENCES 40 http: a-tree/s/Staelin:Carl.html; //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/s/Stonebraker: http://ftp.informatik. Michael.html; rwth-aachen.de/dblp/db/indices/ a-tree/y/Yu:Andrew.html; http: //link.springer.de/link/service/ journals/00778/bibs/6005001/60050048. htm; http://link.springer.de/link/ service/journals/00778/papers/6005001/ http://link.springer. 60050048.pdf; de/link/service/journals/00778/ papers/6005001/60050048.ps.gz. Electronic edition. Harris:1996:JAC ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/c/Chrysanthis: Panos_K=.html; http://ftp.informatik. rwth-aachen.de/dblp/db/indices/ a-tree/r/Ramamritham:Krithi.html; http://link.springer.de/link/service/ journals/00778/bibs/6005001/60050085. htm; http://link.springer.de/link/ service/journals/00778/papers/6005001/ http://link.springer. 60050085.pdf; de/link/service/journals/00778/ papers/6005001/60050085.ps.gz. Electronic edition. Tsatalos:1996:GVT [77] Evan P. Harris and Kotagiri Ramamohanarao. Join algorithm costs [79] Odysseas G. Tsatalos, Marvin H. revisited. VLDB Journal: Very Solomon, and Yannis E. Ioannidis. Large Data Bases, 5(1):64–84, JanThe GMAP: a versatile tool for physuary 1996. CODEN VLDBFR. ical data independence. VLDB JourISSN 1066-8888 (print), 0949-877X nal: Very Large Data Bases, 5(2):101– (electronic). URL http://ftp. 118, April 1996. CODEN VLDBFR. informatik.rwth-aachen.de/dblp/ ISSN 1066-8888 (print), 0949-877X db/indices/a-tree/h/Harris:Evan_ (electronic). URL http://ftp. http://ftp.informatik. P=.html; informatik.rwth-aachen.de/dblp/ rwth-aachen.de/dblp/db/indices/ db/indices/a-tree/i/Ioannidis:Yannis_ a-tree/r/Ramamohanarao:Kotagiri. http://ftp.informatik. E=.html; html; http://link.springer.de/ rwth-aachen.de/dblp/db/indices/ link/service/journals/00778/bibs/ a-tree/s/Solomon:Marvin_H=.html; 6005001/60050064.htm; http://link. http://ftp.informatik.rwth-aachen. springer.de/link/service/journals/ de/dblp/db/indices/a-tree/t/Tsatalos: 00778/papers/6005001/60050064.pdf; Odysseas_G=.html; http://link. http://link.springer.de/link/service/ springer.de/link/service/journals/ journals/00778/papers/6005001/60050064. 00778/bibs/6005002/60050101.htm; ps.gz. Electronic edition. http://link.springer.de/link/service/ journals/00778/papers/6005002/60050101. Ramamritham:1996:TCC pdf; http://link.springer.de/ link/service/journals/00778/papers/ [78] Krithi Ramamritham and Panos K. 6005002/60050101.ps.gz. Electronic Chrysanthis. A taxonomy of coredition. rectness criteria in database applications (*). VLDB Journal: Very Poulovassilis:1996:AQO Large Data Bases, 5(1):85–97, Jan[80] Alexandra Poulovassilis and Carol uary 1996. CODEN VLDBFR. REFERENCES 41 link/service/journals/00778/papers/ Small. Algebraic query optimisa6005002/60050133.pdf; http:// tion for database programming lanlink.springer.de/link/service/journals/ guages. VLDB Journal: Very 00778/papers/6005002/60050133.ps. Large Data Bases, 5(2):119–132, gz. Electronic edition. April 1996. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X Fang:1996:EOB (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ [82] Doug Fang, Shahram Ghandeharizadeh, db/indices/a-tree/p/Poulovassilis: and Dennis McLeod. An experimenhttp://ftp.informatik. Alexandra.html; tal object-based sharing system for rwth-aachen.de/dblp/db/indices/ networked databases. VLDB Jourhttp: a-tree/s/Small:Carol.html; nal: Very Large Data Bases, 5(2):151– //link.springer.de/link/service/ 165, April 1996. CODEN VLDBFR. journals/00778/bibs/6005002/60050119. ISSN 1066-8888 (print), 0949-877X htm; http://link.springer.de/link/ (electronic). URL http://ftp. service/journals/00778/papers/6005002/ informatik.rwth-aachen.de/dblp/ http://link.springer. 60050119.pdf; db/indices/a-tree/f/Fang:Doug.html; de/link/service/journals/00778/ http://ftp.informatik.rwth-aachen. papers/6005002/60050119.ps.gz. Elecde/dblp/db/indices/a-tree/g/Ghandeharizadeh: tronic edition. http://link.springer. Shahram.html; Amiel:1996:TSR de/link/service/journals/00778/ bibs/6005002/60050151.htm; http: [81] Eric Amiel, Marie-Jo Bellosta, Eric //link.springer.de/link/service/ Dujardin, and Eric Simon. Typejournals/00778/papers/6005002/60050151. safe relaxing of schema consispdf; http://link.springer.de/ tency rules for flexible modeling in link/service/journals/00778/papers/ OODBMS. VLDB Journal: Very 6005002/60050151.ps.gz; http: Large Data Bases, 5(2):133–150, //link.springer.de/link/service/ April 1996. CODEN VLDBFR. journals/00778/tocs/mailto:helpdesk@ ISSN 1066-8888 (print), 0949-877X link.springer.de. Electronic edition. (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ Dey:1996:CTR db/indices/a-tree/a/Amiel:Eric. http://ftp.informatik.rwth- [83] Debabrata Dey, Terence M. Barron, html; and Veda C. Storey. A complete aachen.de/dblp/db/indices/a-tree/ http: b/Bellosta:Marie=Jo.html; temporal relational algebra. VLDB //ftp.informatik.rwth-aachen.de/ Journal: Very Large Data Bases, 5 dblp/db/indices/a-tree/d/Dujardin: (3):167–180, August 1996. CODEN http://ftp.informatik. Eric.html; VLDBFR. ISSN 1066-8888 (print), rwth-aachen.de/dblp/db/indices/ 0949-877X (electronic). URL http: a-tree/s/Simon:Eric.html; http: //ftp.informatik.rwth-aachen.de/ //link.springer.de/link/service/ dblp/db/indices/a-tree/b/Barron: journals/00778/bibs/6005002/60050133. http://ftp.informatik. Terence_M=.html; htm; http://link.springer.de/ rwth-aachen.de/dblp/db/indices/ REFERENCES 42 cess path support for referential inhttp: a-tree/d/Dey:Debabrata.html; tegrity in SQL2. VLDB Journal: //ftp.informatik.rwth-aachen.de/ Very Large Data Bases, 5(3):196–214, dblp/db/indices/a-tree/s/Storey: August 1996. CODEN VLDBFR. http://link.springer. Veda_C=.html; ISSN 1066-8888 (print), 0949-877X de/link/service/journals/00778/ (electronic). URL http://ftp. bibs/6005003/60050167.htm; http: informatik.rwth-aachen.de/dblp/ //link.springer.de/link/service/ journals/00778/papers/6005003/60050167. db/indices/a-tree/h/H=auml=rder: Theo.html; pdf; http://link.springer.de/ http://ftp.informatik. link/service/journals/00778/papers/ rwth-aachen.de/dblp/db/indices/ 6005003/60050167.ps.gz. Electronic a-tree/r/Reinert:Joachim.html; edition. http://link.springer.de/link/service/ journals/00778/bibs/6005003/60050196. Shyy:1996:DIK htm; http://link.springer.de/link/ service/journals/00778/papers/6005003/ [84] Yuh-Ming Shyy, Javier Arroyo, Stanley http://link.springer. 60050196.pdf; Y. W. Su, and Herman Lam. The dede/link/service/journals/00778/ sign and implementation of K: a highpapers/6005003/60050196.ps.gz. Eleclevel knowledge-base programming lantronic edition. guage of OSAM*.KBMS. VLDB Journal: Very Large Data Bases, 5 Ooi:1996:INE (3):181–195, August 1996. CODEN [86] Beng Chin Ooi, Jiawei Han, Hongjun VLDBFR. ISSN 1066-8888 (print), Lu, and Kian Lee Tan. In0949-877X (electronic). URL http: dex nesting — an efficient ap//ftp.informatik.rwth-aachen.de/ proach to indexing in object-oriented dblp/db/indices/a-tree/a/Arroyo: http://ftp.informatik. databases. VLDB Journal: Very Javier.html; rwth-aachen.de/dblp/db/indices/ Large Data Bases, 5(3):215–228, Aua-tree/l/Lam:Herman.html; http: gust 1996. CODEN VLDBFR. //ftp.informatik.rwth-aachen.de/ ISSN 1066-8888 (print), 0949-877X dblp/db/indices/a-tree/s/Shyy:Yuh= (electronic). URL http://ftp. http://ftp.informatik. Ming.html; informatik.rwth-aachen.de/dblp/ rwth-aachen.de/dblp/db/indices/ db/indices/a-tree/h/Han:Jiawei. http://ftp.informatik.rwtha-tree/s/Su:Stanley_Y=_W=.html; html; http://link.springer.de/link/service/ aachen.de/dblp/db/indices/a-tree/ journals/00778/bibs/6005003/60050181. l/Lu:Hongjun.html; http://ftp.informatik. htm; http://link.springer.de/link/ rwth-aachen.de/dblp/db/indices/ service/journals/00778/papers/6005003/ a-tree/o/Ooi:Beng_Chin.html; http: http://link.springer. 60050181.pdf; //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/t/Tan:Kian= de/link/service/journals/00778/ http://link.springer. Lee.html; papers/6005003/60050181.ps.gz. Electronic edition. de/link/service/journals/00778/ bibs/6005003/60050215.htm; http: Harder:1996:APS //link.springer.de/link/service/ journals/00778/papers/6005003/60050215. [85] Theo Härder and Joachim Reinert. Ac- REFERENCES 43 pdf; http://link.springer.de/ link/service/journals/00778/papers/ 6005003/60050215.ps.gz; http: //link.springer.de/link/service/ journals/00778/tocs/mailto:helpdesk@ link.springer.de. Electronic edition. Antoshenkov:1996:QPO a-tree/m/Mylopoulos:John.html; http://ftp.informatik.rwth-aachen. de/dblp/db/indices/a-tree/p/Plexousakis: http://ftp.informatik. Dimitris.html; rwth-aachen.de/dblp/db/indices/ http: a-tree/s/Shrufi:Adel.html; //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/t/Topaloglou: Thodoros.html; http://link.springer. de/link/service/journals/00778/ bibs/6005004/60050238.htm; http: //link.springer.de/link/service/ journals/00778/papers/6005004/60050238. pdf; http://link.springer.de/ link/service/journals/00778/papers/ 6005004/60050238.ps.gz. Electronic edition. [87] Gennady Antoshenkov and Mohamed Ziauddin. Query processing and optimization in Oracle Rdb. VLDB Journal: Very Large Data Bases, 5(4):229–237, December 1996. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/a/Antoshenkov: Becker:1996:AOM http://ftp.informatik. Gennady.html; [89] Bruno Becker, Stephan Gschwind, rwth-aachen.de/dblp/db/indices/ Thomas Ohler, Bernhard Seeger, and a-tree/z/Ziauddin:Mohamed.html; http://link.springer.de/link/service/ Peter Widmayer. An asymptotically optimal multiversion B-tree. VLDB journals/00778/bibs/6005004/60050229. Journal: Very Large Data Bases, 5 htm; http://link.springer.de/link/ service/journals/00778/papers/6005004/ (4):264–275, December 1996. CODEN VLDBFR. ISSN 1066-8888 (print), http://link.springer. 60050229.pdf; 0949-877X (electronic). URL http: de/link/service/journals/00778/ //ftp.informatik.rwth-aachen.de/ papers/6005004/60050229.ps.gz. Elecdblp/db/indices/a-tree/b/Becker: tronic edition. http://ftp.informatik. Bruno.html; Mylopoulos:1996:BKB rwth-aachen.de/dblp/db/indices/ [88] John Mylopoulos, Vinay K. Chaudhri, a-tree/g/Gschwind:Stephan.html; http://ftp.informatik.rwth-aachen. Dimitris Plexousakis, Adel Shrufi, de/dblp/db/indices/a-tree/o/Ohler: and Thodoros Topologlou. Buildhttp://ftp.informatik. Thomas.html; ing knowledge base management sysrwth-aachen.de/dblp/db/indices/ tems. VLDB Journal: Very Large a-tree/s/Seeger:Bernhard.html; Data Bases, 5(4):238–263, Decemhttp://ftp.informatik.rwth-aachen. ber 1996. CODEN VLDBFR. de/dblp/db/indices/a-tree/w/Widmayer: ISSN 1066-8888 (print), 0949-877X http://link.springer. Peter.html; (electronic). URL http://ftp. de/link/service/journals/00778/ informatik.rwth-aachen.de/dblp/ db/indices/a-tree/c/Chaudhri:Vinay_ bibs/6005004/60050264.htm; http: http://ftp.informatik. K=.html; //link.springer.de/link/service/ journals/00778/papers/6005004/60050264. rwth-aachen.de/dblp/db/indices/ REFERENCES 44 pdf; http://link.springer.de/ link/service/journals/00778/papers/ 6005004/60050264.ps.gz. Electronic edition. Kashyap:1996:SSS a-tree/l/Lomet:David_B=.html; http://ftp.informatik.rwth-aachen. de/dblp/db/indices/a-tree/s/Salzberg: http://link.springer. Betty.html; de/link/service/journals/00778/ bibs/7006001/70060001.htm; http: //link.springer.de/link/service/ journals/00778/papers/7006001/70060001. pdf; http://link.springer.de/ link/service/journals/00778/papers/ 7006001/70060001.ps.gz. Electronic edition. [90] Vipul Kashyap and Amit P. Sheth. Semantic and schematic similarities between database objects: a contextbased approach. VLDB Journal: Very Large Data Bases, 5(4):276–304, December 1996. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X Antoshenkov:1997:DBO (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ [92] Gennady Antoshenkov. Dictionarydb/indices/a-tree/k/Kashyap:Vipul. based order-preserving string comhttp://ftp.informatik.rwthhtml; pression (*). VLDB Journal: Very aachen.de/dblp/db/indices/a-tree/ Large Data Bases, 6(1):26–39, Februs/Sheth:Amit_P=.html; http:// ary 1997. CODEN VLDBFR. link.springer.de/link/service/journals/ ISSN 1066-8888 (print), 0949-877X 00778/bibs/6005004/60050276.htm; (electronic). URL http://ftp. http://link.springer.de/link/service/ informatik.rwth-aachen.de/dblp/ journals/00778/papers/6005004/60050276. db/indices/a-tree/a/Antoshenkov: pdf; http://link.springer.de/ http://link.springer. Gennady.html; link/service/journals/00778/papers/ de/link/service/journals/00778/ 6005004/60050276.ps.gz; http: bibs/7006001/70060026.htm; http: //link.springer.de/link/service/ //link.springer.de/link/service/ journals/00778/tocs/mailto:helpdesk@ journals/00778/papers/7006001/70060026. link.springer.de. Electronic edition. pdf; http://link.springer.de/ link/service/journals/00778/papers/ Evangelidis:1997:HTM 7006001/70060026.ps.gz. Electronic edition. [91] Georgios Evangelidis, David B. Lomet, and Betty Salzberg. The hB Π Singhal:1997:ALB tree: a multi-attribute index sup[93] Vigyan Singhal and Alan Jay Smith. porting concurrency, recovery and Analysis of locking behavior in three node consolidation. VLDB Journal: real database systems. VLDB JourVery Large Data Bases, 6(1):1–25, nal: Very Large Data Bases, 6(1):40– February 1997. CODEN VLDBFR. 52, February 1997. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ informatik.rwth-aachen.de/dblp/ db/indices/a-tree/e/Evangelidis: http://ftp.informatik. db/indices/a-tree/s/Singhal:Vigyan. Georgios.html; http://ftp.informatik.rwthrwth-aachen.de/dblp/db/indices/ html; REFERENCES 45 aachen.de/dblp/db/indices/a-tree/ s/Smith:Alan_Jay.html; http:/ /link.springer.de/link/service/ journals/00778/bibs/7006001/70060040. htm; http://link.springer.de/link/ service/journals/00778/papers/7006001/ http://link.springer. 70060040.pdf; de/link/service/journals/00778/ papers/7006001/70060040.ps.gz. Electronic edition. Mehta:1997:DPS db/indices/a-tree/k/Kr=auml=mer: Bernd_J=.html; http://ftp.informatik. rwth-aachen.de/dblp/db/indices/ a-tree/p/Papazoglou:Mike_P=.html; http://link.springer.de/link/service/ journals/00778/bibs/7006002/70060073. htm; http://link.springer.de/link/ service/journals/00778/papers/7006002/ 70060073.pdf; http://link.springer. de/link/service/journals/00778/ papers/7006002/70060073.ps.gz. Electronic edition. See erratum [106]. [94] Manish Mehta and David J. DeWitt. Catarci:1997:GIH Data placement in shared-nothing parallel database systems (*). VLDB [96] Tiziana Catarci, Giuseppe SanJournal: Very Large Data Bases, 6 tucci, and John Cardiff. Graph(1):53–72, February 1997. CODEN ical interaction with heterogeneous VLDBFR. ISSN 1066-8888 (print), databases (*). VLDB Journal: Very 0949-877X (electronic). URL http: Large Data Bases, 6(2):97–120, Au//ftp.informatik.rwth-aachen.de/ gust 1997. CODEN VLDBFR. dblp/db/indices/a-tree/d/DeWitt: ISSN 1066-8888 (print), 0949-877X http://ftp.informatik. (electronic). David_J=.html; URL http://ftp. rwth-aachen.de/dblp/db/indices/ informatik.rwth-aachen.de/dblp/ http: a-tree/m/Mehta:Manish.html; db/indices/a-tree/c/Cardiff:John. //link.springer.de/link/service/ http://ftp.informatik.rwthhtml; journals/00778/bibs/7006001/70060053. aachen.de/dblp/db/indices/a-tree/ htm; http://link.springer.de/link/ c/Catarci:Tiziana.html; http: service/journals/00778/papers/7006001/ //ftp.informatik.rwth-aachen.de/ http://link.springer. 70060053.pdf; dblp/db/indices/a-tree/s/Santucci: de/link/service/journals/00778/ http://link.springer. Giuseppe.html; papers/7006001/70060053.ps.gz; de/link/service/journals/00778/ http://link.springer.de/link/service/ bibs/7006002/70060097.htm; http: journals/00778/tocs/mailto:helpdesk@ //link.springer.de/link/service/ link.springer.de. Electronic edition. journals/00778/papers/7006002/70060097. Papazoglou:1997:DMO [95] Mike P. Papazoglou and Bernd J. Krämer. A database model for object dynamics. VLDB Journal: Very Large Data Bases, 6(2):73–96, August 1997. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ pdf; http://link.springer.de/ link/service/journals/00778/papers/ 7006002/70060097.ps.gz. Electronic edition. Chen:1997:AHF [97] Ming-Syan Chen, Hui-I Hsiao, and Philip S. Yu. On applying hash filters to improving the execution of multi-join queries. VLDB Journal: REFERENCES 46 70060132.pdf; http://link.springer. Very Large Data Bases, 6(2):121–131, de/link/service/journals/00778/ August 1997. CODEN VLDBFR. papers/7006002/70060132.ps.gz. ElecISSN 1066-8888 (print), 0949-877X tronic edition. (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ Mehrotra:1997:CCH db/indices/a-tree/c/Chen:Ming=Syan. http://ftp.informatik.rwth- [99] Sharad Mehrotra, Henry F. Kohtml; rth, and Avi Silberschatz. Concuraachen.de/dblp/db/indices/a-tree/ rency control in hierarchical multih/Hsiao:Hui=I.html; http://ftp. database systems. VLDB Journal: informatik.rwth-aachen.de/dblp/ Very Large Data Bases, 6(2):152–172, db/indices/a-tree/y/Yu:Philip_S= August 1997. CODEN VLDBFR. http://link.springer.de/ .html; ISSN 1066-8888 (print), 0949-877X link/service/journals/00778/bibs/ (electronic). URL http://ftp. 7006002/70060121.htm; http://link. informatik.rwth-aachen.de/dblp/ springer.de/link/service/journals/ db/indices/a-tree/k/Korth:Henry_ 00778/papers/7006002/70060121.pdf; http://ftp.informatik. http://link.springer.de/link/service/ F=.html; rwth-aachen.de/dblp/db/indices/ journals/00778/papers/7006002/70060121. a-tree/m/Mehrotra:Sharad.html; ps.gz. Electronic edition. http://ftp.informatik.rwth-aachen. de/dblp/db/indices/a-tree/s/Silberschatz: Ioannidis:1997:PQO http://link.springer. Abraham.html; de/link/service/journals/00778/ [98] Yannis E. Ioannidis, Raymond T. bibs/7006002/70060152.htm; http: Ng, Kyuseok Shim, and Timos K. //link.springer.de/link/service/ Sellis. Parametric query optijournals/00778/papers/7006002/70060152. mization. VLDB Journal: Very pdf; http://link.springer.de/ Large Data Bases, 6(2):132–151, Aulink/service/journals/00778/papers/ gust 1997. CODEN VLDBFR. 7006002/70060152.ps.gz; http: ISSN 1066-8888 (print), 0949-877X //link.springer.de/link/service/ (electronic). URL http://ftp. journals/00778/tocs/mailto:helpdesk@ informatik.rwth-aachen.de/dblp/ link.springer.de. Electronic edition. db/indices/a-tree/i/Ioannidis:Yannis_ http://ftp.informatik. E=.html; Cobb:1997:IOT rwth-aachen.de/dblp/db/indices/ http:[100] Edward E. Cobb. The impact of oba-tree/n/Ng:Raymond_T=.html; ject technology on commercial transac//ftp.informatik.rwth-aachen.de/ tion processing. VLDB Journal: Very dblp/db/indices/a-tree/s/Sellis: http://ftp.informatik. Large Data Bases, 6(3):173–190, AuTimos_K=.html; gust 1997. CODEN VLDBFR. ISSN rwth-aachen.de/dblp/db/indices/ 1066-8888 (print), 0949-877X (elechttp: a-tree/s/Shim:Kyuseok.html; tronic). //link.springer.de/link/service/ journals/00778/bibs/7006002/70060132. Cobb:1997:ITC htm; http://link.springer.de/link/ service/journals/00778/papers/7006002/ [101] Edward E. Cobb. The impact of REFERENCES technology on commercial transaction processing. VLDB Journal: Very Large Data Bases, 6(3):173–190, August 1997. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/c/Cobb:Edward_ E=.html; http://link.springer. de/link/service/journals/00778/ bibs/7006003/70060173.htm. Electronic edition. 47 db/indices/a-tree/b/Biliris:Alexandros. http://ftp.informatik.rwthhtml; aachen.de/dblp/db/indices/a-tree/ http: p/Panagos:Euthimios.html; //link.springer.de/link/service/ journals/00778/bibs/7006003/70060209. htm. Electronic edition. Lomet:1997:CRI [104] David B. Lomet and Betty Salzberg. Concurrency and recovery for index trees. VLDB Journal: Very Large Data Bases, 6(3):224–240, AuSteinbrunn:1997:HRO gust 1997. CODEN VLDBFR. [102] Michael Steinbrunn, Guido Moerkotte, ISSN 1066-8888 (print), 0949-877X and Alfons Kemper. Heuristic and (electronic). URL http://ftp. randomized optimization for the join informatik.rwth-aachen.de/dblp/ ordering problem. VLDB Jourdb/indices/a-tree/l/Lomet:David_ http://ftp.informatik. nal: Very Large Data Bases, 6(3): B=.html; rwth-aachen.de/dblp/db/indices/ 191–208, August 1997. CODEN a-tree/s/Salzberg:Betty.html; VLDBFR. ISSN 1066-8888 (print), http://link.springer.de/link/service/ 0949-877X (electronic). URL http: journals/00778/bibs/7006003/70060224. //ftp.informatik.rwth-aachen.de/ htm. Electronic edition. dblp/db/indices/a-tree/k/Kemper: http://ftp.informatik. Alfons.html; Haas:1997:STA rwth-aachen.de/dblp/db/indices/ [105] Laura M. Haas, Michael J. Carey, a-tree/m/Moerkotte:Guido.html; http://ftp.informatik.rwth-aachen. Miron Livny, and Amit Shukla. de/dblp/db/indices/a-tree/s/Steinbrunn: Seeking the truth about ad hoc http://link.springer. Michael.html; join costs. VLDB Journal: Very de/link/service/journals/00778/ Large Data Bases, 6(3):241–256, Aubibs/7006003/70060191.htm. Elecgust 1997. CODEN VLDBFR. tronic edition. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. Panagos:1997:SRC informatik.rwth-aachen.de/dblp/ db/indices/a-tree/c/Carey:Michael_ [103] Euthimios Panagos and Alexandros http://ftp.informatik. J=.html; Biliris. Synchronization and rerwth-aachen.de/dblp/db/indices/ covery in a client-server storage http: a-tree/h/Haas:Laura_M=.html; system. VLDB Journal: Very //ftp.informatik.rwth-aachen.de/ Large Data Bases, 6(3):209–223, Audblp/db/indices/a-tree/l/Livny: gust 1997. CODEN VLDBFR. http://ftp.informatik. Miron.html; ISSN 1066-8888 (print), 0949-877X rwth-aachen.de/dblp/db/indices/ (electronic). URL http://ftp. http: a-tree/s/Shukla:Amit.html; informatik.rwth-aachen.de/dblp/ REFERENCES 48 //link.springer.de/link/service/ journals/00778/bibs/7006003/70060241. htm. Electronic edition. Papazoglou:1997:EDM Journal: Very Large Data Bases, 6 (4):282–295, November 1997. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/d/D=iacute= http://ftp.informatik. az:Oscar.html; rwth-aachen.de/dblp/db/indices/ http: a-tree/j/Jaime:Arturo.html; //link.springer.de/link/service/ journals/00778/bibs/7006004/70060282. htm; http://link.springer.de/link/ service/journals/00778/papers/7006004/ 70060282.pdf. Electronic edition. [106] Mike P. Papazoglou and Bernd J. Krämer. Erratum — A database model for object dynamics. VLDB Journal: Very Large Data Bases, 6(3):257– 260, August 1997. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/k/Kr=auml=mer: http://ftp.informatik. Bernd_J=.html; Bohm:1997:SDS rwth-aachen.de/dblp/db/indices/ a-tree/p/Papazoglou:Mike_P=.html; [109] Klemens Böhm, Karl Aberer, Erich J. http://link.springer.de/link/service/ Neuhold, and Xiaoya Yang. Structured journals/00778/bibs/7006003/70060257. document storage and refined declarhtm. Electronic edition. See [95]. ative and navigational access mechaFahl:1997:QPO nisms in HyperStorM. VLDB Journal: Very Large Data Bases, 6(4):296–311, [107] Gustav Fahl and Tore Risch. Query November 1997. CODEN VLDBFR. processing over object views of relaISSN 1066-8888 (print), 0949-877X tional data. VLDB Journal: Very (electronic). URL http://ftp. Large Data Bases, 6(4):261–281, informatik.rwth-aachen.de/dblp/ November 1997. CODEN VLDBFR. db/indices/a-tree/a/Aberer:Karl. ISSN 1066-8888 (print), 0949-877X http://ftp.informatik.rwthhtml; (electronic). URL http://ftp. aachen.de/dblp/db/indices/a-tree/ informatik.rwth-aachen.de/dblp/ http: b/B=ouml=hm:Klemens.html; db/indices/a-tree/f/Fahl:Gustav. //ftp.informatik.rwth-aachen.de/ http://ftp.informatik.rwthhtml; dblp/db/indices/a-tree/n/Neuhold: aachen.de/dblp/db/indices/a-tree/ http://ftp.informatik. Erich_J=.html; r/Risch:Tore.html; http://link. rwth-aachen.de/dblp/db/indices/ springer.de/link/service/journals/ http: a-tree/y/Yang:Xiaoya.html; 00778/bibs/7006004/70060261.htm; //link.springer.de/link/service/ http://link.springer.de/link/service/ journals/00778/bibs/7006004/70060296. journals/00778/papers/7006004/70060261. htm; http://link.springer.de/link/ pdf. Electronic edition. service/journals/00778/papers/7006004/ Diaz:1997:EEA 70060296.pdf. Electronic edition. [108] Oscar Dı́az and Arturo Jaime. EXACT: An extensible approach to active object-oriented databases. VLDB Muck:1997:CTH [110] Thomas A. Mück and Martin L. Po- REFERENCES 49 springer.de/link/service/journals/ laschek. A configurable type hierar00778/bibs/7006004/70060333.htm; chy index for OODB. VLDB Jourhttp://link.springer.de/link/service/ nal: Very Large Data Bases, 6(4): journals/00778/papers/7006004/70060333. 312–332, November 1997. CODEN pdf. Electronic edition. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: Han:1998:ORQ //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/m/M=uuml= [113] Jia Liang Han. Optimizing relack:Thomas_A=.html; http://ftp. tional queries in connection hyperinformatik.rwth-aachen.de/dblp/ graphs: Nested queries, views, and db/indices/a-tree/p/Polaschek:Martin_ binding propagations. VLDB JourL=.html. Electronic edition. nal: Very Large Data Bases, 7(1):1– 11, February 1998. CODEN VLDBFR. Mueck:1997:CTH ISSN 1066-8888 (print), 0949-877X [111] Thomas A. Mueck and Martin L. Po(electronic). URL http://ftp. laschek. A configurable type hierarinformatik.rwth-aachen.de/dblp/ chy index for OODB. VLDB Jourdb/indices/a-tree/h/Han:Jia_Liang. nal: Very Large Data Bases, 6(4): html; http://link.springer.de/ 312–332, November 1997. CODEN link/service/journals/00778/bibs/ VLDBFR. ISSN 1066-8888 (print), 8007001/80070001.htm; http://link. 0949-877X (electronic). URL http: springer.de/link/service/journals/ //link.springer.de/link/service/ 00778/papers/8007001/80070001.pdf. journals/00778/bibs/7006004/70060312. Electronic edition. htm; http://link.springer.de/ Hanson:1998:FRC link/service/journals/00778/papers/ 7006004/70060312.pdf. [114] Eric N. Hanson, I.-Cheng Chen, Roxana Dastur, Kurt Engel, ViBerchtold:1997:UEF jay Ramaswamy, Wendy Tan, and [112] Stefan Berchtold, Daniel A. Keim, Chun Xu. A flexible and recovand Hans-Peter Kriegel. Using exerable client/server database event tended feature objects for partial notification system. VLDB Joursimilarity retrieval. VLDB Journal: nal: Very Large Data Bases, 7(1): Very Large Data Bases, 6(4):333–348, 12–24, February 1998. CODEN November 1997. CODEN VLDBFR. VLDBFR. ISSN 1066-8888 (print), ISSN 1066-8888 (print), 0949-877X 0949-877X (electronic). URL http: (electronic). URL http://ftp. //ftp.informatik.rwth-aachen.de/ informatik.rwth-aachen.de/dblp/ dblp/db/indices/a-tree/c/Chen:I= db/indices/a-tree/b/Berchtold:Stefan. http://ftp.informatik. =Cheng.html; http://ftp.informatik.rwthhtml; rwth-aachen.de/dblp/db/indices/ aachen.de/dblp/db/indices/a-tree/ http: a-tree/d/Dastur:Roxana.html; k/Keim:Daniel_A=.html; http:/ //ftp.informatik.rwth-aachen.de/ /ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/e/Engel: dblp/db/indices/a-tree/k/Kriegel: Kurt.html; http://ftp.informatik. Hans=Peter.html; http://link. rwth-aachen.de/dblp/db/indices/ REFERENCES 50 a-tree/h/Hanson:Eric_N=.html; http://ftp.informatik.rwth-aachen. de/dblp/db/indices/a-tree/r/Ramaswamy: http://ftp.informatik. Vijay.html; rwth-aachen.de/dblp/db/indices/ a-tree/t/Tan:Wendy.html; http: //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/x/Xu:Chun. html; http://link.springer.de/ link/service/journals/00778/bibs/ 8007001/80070012.htm; http://link. springer.de/link/service/journals/ 00778/papers/8007001/80070012.pdf. Electronic edition. Mehta:1998:OPM tioning and load balancing in parallel disk systems. VLDB Journal: Very Large Data Bases, 7(1):48–66, February 1998. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/s/Scheuermann: Peter.html; http://ftp.informatik. rwth-aachen.de/dblp/db/indices/ a-tree/w/Weikum:Gerhard.html; http://ftp.informatik.rwth-aachen. de/dblp/db/indices/a-tree/z/Zabback: http://link.springer. Peter.html; de/link/service/journals/00778/ bibs/8007001/80070048.htm; http: //link.springer.de/link/service/ journals/00778/papers/8007001/80070048. pdf. Electronic edition. [115] Ashish Mehta, James Geller, Yehoshua Perl, and Erich J. Neuhold. The OODB path-method generator (PMG) using access weights and precomIshakbeyoglu:1998:MII puted access relevance. VLDB Journal: Very Large Data Bases, 7(1): 25–47, February 1998. CODEN [117] Naci S. Ishakbeyoğlu and Z. Meral Özsoyoğlu. Maintenance of implicaVLDBFR. ISSN 1066-8888 (print), tion integrity constraints under up0949-877X (electronic). URL http: dates to constraints. VLDB Jour//ftp.informatik.rwth-aachen.de/ nal: Very Large Data Bases, 7 dblp/db/indices/a-tree/g/Geller: (2):67–78, May 1998. CODEN http://ftp.informatik. James.html; VLDBFR. ISSN 1066-8888 (print), rwth-aachen.de/dblp/db/indices/ 0949-877X (electronic). URL http: http: a-tree/m/Mehta:Ashish.html; //ftp.informatik.rwth-aachen.de/ //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/=/=Ouml= dblp/db/indices/a-tree/n/Neuhold: http: http://ftp.informatik. zsoyoglu:Z=_Meral.html; Erich_J=.html; //ftp.informatik.rwth-aachen.de/ rwth-aachen.de/dblp/db/indices/ dblp/db/indices/a-tree/i/Ishakbeyoglu: http: a-tree/p/Perl:Yehoshua.html; http://link.springer. Naci.html; //link.springer.de/link/service/ de/link/service/journals/00778/ journals/00778/bibs/8007001/80070025. bibs/8007002/80070067.htm; http: htm; http://link.springer.de/link/ service/journals/00778/papers/8007001/ //link.springer.de/link/service/ journals/00778/papers/8007002/80070067. 80070025.pdf. Electronic edition. pdf. Electronic edition. Scheuermann:1998:DPL Dessloch:1998:ADP [116] Peter Scheuermann, Gerhard Weikum, and Peter Zabback. Data parti- [118] Stefan Deßloch, Theo Härder, Nel- REFERENCES 51 db/indices/a-tree/m/Milo:Tova.html; son Mendonça Mattos, Bernhard http://link.springer.de/link/service/ Mitschang, and Joachim Thomas. Adjournals/00778/bibs/8007002/80070096. vanced data processing in KRISYS: htm; http://link.springer.de/link/ Modeling concepts, implementation service/journals/00778/papers/8007002/ techniques, and client/server issues. 80070096.pdf. Electronic edition. VLDB Journal: Very Large Data Bases, 7(2):79–95, May 1998. CODEN Ooi:1998:FIR VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: [120] Beng Chin Ooi, Kian-Lee Tan, //ftp.informatik.rwth-aachen.de/ Tat Seng Chua, and Wynne Hsu. dblp/db/indices/a-tree/d/De=szlig= Fast image retrieval using colorloch:Stefan.html; http://ftp. spatial information. VLDB Jourinformatik.rwth-aachen.de/dblp/ nal: Very Large Data Bases, 7(2):115– db/indices/a-tree/h/H=auml=rder: 128, May 1998. CODEN VLDBFR. http://ftp.informatik. Theo.html; ISSN 1066-8888 (print), 0949-877X rwth-aachen.de/dblp/db/indices/ (electronic). URL http://ftp. a-tree/m/Mattos:Nelson_Mendon=ccedil= informatik.rwth-aachen.de/dblp/ a.html; http://ftp.informatik. db/indices/a-tree/c/Chua:Tat=Seng. rwth-aachen.de/dblp/db/indices/ http://ftp.informatik.rwthhtml; a-tree/m/Mitschang:Bernhard.html; aachen.de/dblp/db/indices/a-tree/ http://ftp.informatik.rwth-aachen. h/Hsu:Wynne.html; http://ftp. de/dblp/db/indices/a-tree/t/Thomas: informatik.rwth-aachen.de/dblp/ http://link.springer. Joachim.html; db/indices/a-tree/o/Ooi:Beng_Chin. de/link/service/journals/00778/ http://ftp.informatik.rwthhtml; bibs/8007002/80070079.htm; http: aachen.de/dblp/db/indices/a-tree/ //link.springer.de/link/service/ http://link. t/Tan:Kian=Lee.html; journals/00778/papers/8007002/80070079. springer.de/link/service/journals/ pdf. Electronic edition. 00778/bibs/8007002/80070115.htm; http://link.springer.de/link/service/ Abiteboul:1998:LVS journals/00778/papers/8007002/80070115. pdf. Electronic edition. [119] Serge Abiteboul, Sophie Cluet, and Tova Milo. A logical view of Jarke:1998:GE structured files. VLDB Journal: Guest Editorial. Very Large Data Bases, 7(2):96– [121] Matthias Jarke. VLDB Journal: Very Large Data 114, May 1998. CODEN VLDBFR. Bases, 7(3):129, August 1998. CODEN ISSN 1066-8888 (print), 0949-877X VLDBFR. ISSN 1066-8888 (print), (electronic). URL http://ftp. 0949-877X (electronic). URL http: informatik.rwth-aachen.de/dblp/ db/indices/a-tree/a/Abiteboul:Serge. //link.springer.de/link/service/ http://ftp.informatik.rwthjournals/00778/bibs/8007003/80070129. html; aachen.de/dblp/db/indices/a-tree/ htm; http://link.springer.de/ http://ftp. link/service/journals/00778/papers/ c/Cluet:Sophie.html; informatik.rwth-aachen.de/dblp/ 8007003/80070129.pdf. REFERENCES 52 Seshadri:1998:EAD [122] Praveen Seshadri. Enhanced abstract data types in object-relational databases. VLDB Journal: Very Large Data Bases, 7(3):130–140, August 1998. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/s/Seshadri:Praveen. html; http://link.springer.de/ link/service/journals/00778/bibs/ 8007003/80070130.htm; http://link. springer.de/link/service/journals/ 00778/papers/8007003/80070130.pdf. Special Issue on VLDB 1997. Electronic edition. Kraiss:1998:IDC eration for organizing large text databases into hierarchical topic taxonomies. VLDB Journal: Very Large Data Bases, 7(3):163–178, August 1998. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/a/Agrawal:Rakesh. http://ftp.informatik.rwthhtml; aachen.de/dblp/db/indices/a-tree/ http: c/Chakrabarti:Soumen.html; //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/d/Dom:Byron. http://ftp.informatik.rwthhtml; aachen.de/dblp/db/indices/a-tree/ http: r/Raghavan:Prabhakar.html; //link.springer.de/link/service/ journals/00778/bibs/8007003/80070163. htm; http://link.springer.de/link/ service/journals/00778/papers/8007003/ 80070163.pdf. Electronic edition. [123] Achim Kraiss and Gerhard Weikum. Integrated document caching and prefetching in storage hierarchies based on Markov-chain predictions. VLDB Roy:1998:GCO Journal: Very Large Data Bases, 7 (3):141–162, August 1998. CODEN [125] Prasan Roy, S. Seshadri, Abraham SilVLDBFR. ISSN 1066-8888 (print), berschatz, S. Sudarshan, and S. Ash0949-877X (electronic). URL http: win. Garbage collection in object//ftp.informatik.rwth-aachen.de/ oriented databases using transactional dblp/db/indices/a-tree/k/Kraiss: cyclic reference counting. VLDB http://ftp.informatik. Achim.html; Journal: Very Large Data Bases, 7 rwth-aachen.de/dblp/db/indices/ (3):179–193, August 1998. CODEN a-tree/w/Weikum:Gerhard.html; VLDBFR. ISSN 1066-8888 (print), http://link.springer.de/link/service/ 0949-877X (electronic). URL http: journals/00778/bibs/8007003/80070141. //ftp.informatik.rwth-aachen.de/ htm; http://link.springer.de/link/ dblp/db/indices/a-tree/a/Ashwin: service/journals/00778/papers/8007003/ S=.html; http://ftp.informatik. 80070141.pdf. Electronic edition. rwth-aachen.de/dblp/db/indices/ a-tree/r/Roy:Prasan.html; http: Chakrabarti:1998:SFS //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/s/Seshadri: [124] Soumen Chakrabarti, Byron Dom, http://ftp.informatik. S=.html; Rakesh Agrawal, and Prabhakar rwth-aachen.de/dblp/db/indices/ Raghavan. Scalable feature seleca-tree/s/Silberschatz:Abraham.html; tion, classification and signature gen- REFERENCES 53 informatik.rwth-aachen.de/dblp/ http://ftp.informatik.rwth-aachen. de/dblp/db/indices/a-tree/s/Sudarshan: db/indices/a-tree/=/=Ouml=zsu:M= _Tamer.html; http://ftp.informatik. S=.html; http://link.springer. rwth-aachen.de/dblp/db/indices/ de/link/service/journals/00778/ a-tree/c/Christodoulakis:Stavros. bibs/8007003/80070179.htm; http: html; http://link.springer.de/ //link.springer.de/link/service/ journals/00778/papers/8007003/80070179. link/service/journals/00778/bibs/ pdf. Electronic edition. 8007004/80070205.htm; http://link. springer.de/link/service/journals/ Ng:1998:IRM 00778/papers/8007004/80070205.pdf. edition. Electronic [126] Wee Teck Ng and Peter M. Chen. Integrating reliable memory in databases. Garofalakis:1998:PRS VLDB Journal: Very Large Data Bases, 7(3):194–204, August 1998. [129] Minos N. Garofalakis, Banu Özden, CODEN VLDBFR. ISSN 1066and Avi Silberschatz. On periodic 8888 (print), 0949-877X (electronic). resource scheduling for continuousURL http://ftp.informatik.rwthmedia databases. VLDB Journal: Very aachen.de/dblp/db/indices/a-tree/ Large Data Bases, 7(4):206–225, Dec/Chen:Peter_M=.html; http:// cember 1998. CODEN VLDBFR. ftp.informatik.rwth-aachen.de/dblp/ ISSN 1066-8888 (print), 0949-877X db/indices/a-tree/n/Ng:Wee_Teck. (electronic). URL http://ftp. html; http://link.springer.de/ informatik.rwth-aachen.de/dblp/ link/service/journals/00778/bibs/ db/indices/a-tree/=/=Ouml=zden: 8007003/80070194.htm; http://link. http://ftp.informatik. Banu.html; springer.de/link/service/journals/ rwth-aachen.de/dblp/db/indices/ 00778/papers/8007003/80070194.pdf. a-tree/g/Garofalakis:Minos_N=.html; Electronic edition. http://ftp.informatik.rwth-aachen. de/dblp/db/indices/a-tree/s/Silberschatz: Ozsu:1998:I http://link.springer. Abraham.html; de/link/service/journals/00778/ [127] M. Tamer Özsu and Stavros Christodoulakis. bibs/8007004/80070206.htm; http: Introduction. VLDB Journal: Very //link.springer.de/link/service/ Large Data Bases, 7(4):205, December journals/00778/papers/8007004/80070206. 1998. CODEN VLDBFR. ISSN 1066pdf. Electronic edition. 8888 (print), 0949-877X (electronic). Ozsu:1998:SIM Jiang:1998:STC [130] Haitao Jiang and Ahmed K. El[128] M. Tamer Özsu and Stavros Christodoulakis. Special issue on multimedia databases: magarmid. Spatial and temporal Introduction. VLDB Journal: Very content-based access to hypervideo Large Data Bases, 7(4):205, Dedatabases. VLDB Journal: Very cember 1998. CODEN VLDBFR. Large Data Bases, 7(4):226–238, DeISSN 1066-8888 (print), 0949-877X cember 1998. CODEN VLDBFR. (electronic). URL http://ftp. ISSN 1066-8888 (print), 0949-877X REFERENCES 54 html; http://ftp.informatik.rwth(electronic). URL http://ftp. aachen.de/dblp/db/indices/a-tree/ informatik.rwth-aachen.de/dblp/ s/Soffer:Aya.html; http://link. db/indices/a-tree/e/Elmagarmid: http://ftp.informatik. springer.de/link/service/journals/ Ahmed_K=.html; rwth-aachen.de/dblp/db/indices/ 00778/bibs/8007004/80070253.htm; http: http://link.springer.de/link/service/ a-tree/j/Jiang:Haitao.html; journals/00778/papers/8007004/80070253. //link.springer.de/link/service/ journals/00778/bibs/8007004/80070226. pdf. Electronic edition. htm; http://link.springer.de/link/ Zezula:1998:ASR service/journals/00778/papers/8007004/ 80070226.pdf. Electronic edition. [133] Pavel Zezula, Pasquale Savino, Giuseppe Amato, and Fausto Rabitti. ApNg:1998:OCO proximate similarity retrieval with [131] Raymond T. Ng and Paul Shum. M-trees. VLDB Journal: Very Optimal clip ordering for multi-clip Large Data Bases, 7(4):275–293, Dequeries. VLDB Journal: Very cember 1998. CODEN VLDBFR. Large Data Bases, 7(4):239–252, DeISSN 1066-8888 (print), 0949-877X cember 1998. CODEN VLDBFR. (electronic). URL http://ftp. ISSN 1066-8888 (print), 0949-877X informatik.rwth-aachen.de/dblp/ db/indices/a-tree/a/Amato:Giuseppe. (electronic). URL http://ftp. http://ftp.informatik.rwthhtml; informatik.rwth-aachen.de/dblp/ aachen.de/dblp/db/indices/a-tree/ db/indices/a-tree/n/Ng:Raymond_ http://ftp.informatik. r/Rabitti:Fausto.html; http:/ T=.html; rwth-aachen.de/dblp/db/indices/ /ftp.informatik.rwth-aachen.de/ a-tree/s/Shum:Paul.html; http: dblp/db/indices/a-tree/s/Savino: http://ftp.informatik. //link.springer.de/link/service/ Pasquale.html; journals/00778/bibs/8007004/80070239. rwth-aachen.de/dblp/db/indices/ http: htm; http://link.springer.de/link/ a-tree/z/Zezula:Pavel.html; service/journals/00778/papers/8007004/ //link.springer.de/link/service/ journals/00778/bibs/8007004/80070275. 80070239.pdf. Electronic edition. htm; http://link.springer.de/link/ Soffer:1998:ISI service/journals/00778/papers/8007004/ 80070275.pdf. Electronic edition. [132] Aya Soffer and Hanan Samet. Integrating symbolic images into a Balkir:1998:DPM multimedia database system using classification and abstraction ap- [134] Nevzat Hurkan Balkir and Gultekin Özsoyoglu. Delivering presentations proaches. VLDB Journal: Very from multimedia servers. VLDB JourLarge Data Bases, 7(4):253–274, Denal: Very Large Data Bases, 7(4): cember 1998. CODEN VLDBFR. 294–307, December 1998. CODEN ISSN 1066-8888 (print), 0949-877X VLDBFR. ISSN 1066-8888 (print), (electronic). URL http://ftp. 0949-877X (electronic). URL http: informatik.rwth-aachen.de/dblp/ //ftp.informatik.rwth-aachen.de/ db/indices/a-tree/s/Samet:Hanan. REFERENCES 55 http://ftp.informatik.rwth-aachen. dblp/db/indices/a-tree/=/=Ouml= de/dblp/db/indices/a-tree/t/Thomas: zsoyoglu:Gultekin.html; http: http://link.springer. Joachim.html; //ftp.informatik.rwth-aachen.de/ de/link/service/journals/00778/ dblp/db/indices/a-tree/b/Balkir: http://link. bibs/9008001/90080025.htm; http: Nevzat_Hurkan.html; springer.de/link/service/journals/ //link.springer.de/link/service/ journals/00778/papers/9008001/90080025. 00778/bibs/8007004/80070294.htm; http://link.springer.de/link/service/ pdf. Electronic edition. journals/00778/papers/8007004/80070294. Huang:1999:CTP pdf. Electronic edition. [137] Yueh-Min Huang, Jen-Wen Ding, and Shiao-Li Tsao. Constant time per[135] Zhe Li and Kenneth A. Ross. Fast mutation: An efficient block allocajoins using join indices. VLDB Jourtion strategy for variable-bit-rate connal: Very Large Data Bases, 8(1):1– tinuous media data. VLDB Jour24, April 1999. CODEN VLDBFR. nal: Very Large Data Bases, 8(1):44– ISSN 1066-8888 (print), 0949-877X 54, April 1999. CODEN VLDBFR. (electronic). URL http://ftp. ISSN 1066-8888 (print), 0949-877X informatik.rwth-aachen.de/dblp/ (electronic). URL http://ftp. db/indices/a-tree/l/Li:Zhe.html; informatik.rwth-aachen.de/dblp/ http://ftp.informatik.rwth-aachen. db/indices/a-tree/d/Ding:Jen=Wen. de/dblp/db/indices/a-tree/r/Ross: http://ftp.informatik.rwthhtml; aachen.de/dblp/db/indices/a-tree/ Kenneth_A=.html; http://link. springer.de/link/service/journals/ h/Huang:Yueh=Min.html; http:/ 00778/bibs/9008001/90080001.htm; /ftp.informatik.rwth-aachen.de/ http://link.springer.de/link/service/ dblp/db/indices/a-tree/t/Tsao:Shiao= journals/00778/papers/9008001/90080001. Li.html; http://link.springer. pdf. Electronic edition. de/link/service/journals/00778/ bibs/9008001/90080044.htm; http: Harder:1999:IPS //link.springer.de/link/service/ journals/00778/papers/9008001/90080044. [136] Theo Härder, Günter Sauter, and pdf. Electronic edition. Joachim Thomas. The intrinsic problems of structural heterogeneity and Kabra:1999:OOO an approach to their solution. VLDB [138] Navin Kabra and David J. DeWitt. Journal: Very Large Data Bases, 8(1): OPT++: an object-oriented imple25–43, April 1999. CODEN VLDBFR. mentation for extensible database ISSN 1066-8888 (print), 0949-877X query optimization. VLDB Jour(electronic). URL http://ftp. nal: Very Large Data Bases, 8 informatik.rwth-aachen.de/dblp/ (1):55–78, April 1999. CODEN db/indices/a-tree/h/H=auml=rder: http://ftp.informatik. VLDBFR. ISSN 1066-8888 (print), Theo.html; rwth-aachen.de/dblp/db/indices/ 0949-877X (electronic). URL http: a-tree/s/Sauter:G=uuml=nter.html; //ftp.informatik.rwth-aachen.de/ Li:1999:FJU REFERENCES 56 db/indices/a-tree/b/Boncz:Peter_ dblp/db/indices/a-tree/d/DeWitt: http://ftp.informatik. A=.html; http://ftp.informatik. David_J=.html; rwth-aachen.de/dblp/db/indices/ rwth-aachen.de/dblp/db/indices/ http: a-tree/k/Kabra:Navin.html; a-tree/k/Kersten:Martin_L=.html; http://link.springer.de/link/service/ //link.springer.de/link/service/ journals/00778/bibs/9008001/90080055. journals/00778/bibs/9008002/90080101. htm; http://link.springer.de/link/ htm; http://link.springer.de/link/ service/journals/00778/papers/9008001/ service/journals/00778/papers/9008002/ 90080055.pdf. Electronic edition. 90080101.pdf. Electronic edition. Krivokapic:1999:DDD Aslan:1999:SHR [139] Natalija Krivokapić, Alfons Kemper, [141] Goksel Aslan and Dennis McLeod. Seand Ehud Gudes. Deadlock detecmantic heterogeneity resolution in fedtion in distributed database systems: erated databases by metadata implana new algorithm and a comparative tation and stepwise evolution. VLDB performance analysis. VLDB JourJournal: Very Large Data Bases, 8 nal: Very Large Data Bases, 8(2):79– (2):120–132, April 1999. CODEN 100, April 1999. CODEN VLDBFR. VLDBFR. ISSN 1066-8888 (print), ISSN 1066-8888 (print), 0949-877X 0949-877X (electronic). URL http: (electronic). URL http://ftp. //ftp.informatik.rwth-aachen.de/ informatik.rwth-aachen.de/dblp/ dblp/db/indices/a-tree/a/Aslan: http://ftp.informatik. db/indices/a-tree/g/Gudes:Ehud. Goksel.html; http://ftp.informatik.rwthrwth-aachen.de/dblp/db/indices/ html; aachen.de/dblp/db/indices/a-tree/ http: a-tree/m/McLeod:Dennis.html; k/Kemper:Alfons.html; http:// //link.springer.de/link/service/ ftp.informatik.rwth-aachen.de/dblp/ journals/00778/bibs/9008002/90080120. db/indices/a-tree/k/Krivokapic: htm; http://link.springer.de/link/ http://link.springer. service/journals/00778/papers/9008002/ Natalija.html; de/link/service/journals/00778/ 90080120.pdf. Electronic edition. bibs/9008002/90080079.htm; http: Law:1999:ESI //link.springer.de/link/service/ journals/00778/papers/9008002/90080079. [142] Kelvin K. W. Law, John C. S. Lui, pdf. Electronic edition. and Leana Golubchik. Efficient support for interactive service in multiBoncz:1999:MPQ resolution VOD systems. VLDB Jour[140] Peter A. Boncz and Martin L. Kernal: Very Large Data Bases, 8(2):133– sten. MIL primitives for querying 153, April 1999. CODEN VLDBFR. a fragmented world. VLDB JourISSN 1066-8888 (print), 0949-877X nal: Very Large Data Bases, 8(2):101– (electronic). URL http://ftp. 119, April 1999. CODEN VLDBFR. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/g/Golubchik:Leana. ISSN 1066-8888 (print), 0949-877X http://ftp.informatik.rwthhtml; (electronic). URL http://ftp. aachen.de/dblp/db/indices/a-tree/ informatik.rwth-aachen.de/dblp/ REFERENCES 57 ing. VLDB Journal: Very Large l/Law:Kelvin_K=_W=.html; http: Data Bases, 8(3–4):156–177, Febru//ftp.informatik.rwth-aachen.de/ ary 2000. CODEN VLDBFR. dblp/db/indices/a-tree/l/Lui:John_ ISSN 1066-8888 (print), 0949-877X http://link.springer. C=_S=.html; (electronic). URL http://ftp. de/link/service/journals/00778/ informatik.rwth-aachen.de/dblp/ bibs/9008002/90080133.htm; http: db/indices/a-tree/b/Braumandl:Reinhard. //link.springer.de/link/service/ journals/00778/papers/9008002/90080133. html; http://ftp.informatik.rwthpdf. Electronic edition. aachen.de/dblp/db/indices/a-tree/ http: c/Clau=szlig=en:Jens.html; Shmueli:2000:FVP //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/k/Kemper: [143] O. Shmueli and J. Widom. Foreword by http://ftp.informatik. Alfons.html; the VLDB ‘98 PC Chairmen. VLDB rwth-aachen.de/dblp/db/indices/ Journal: Very Large Data Bases, 8 a-tree/k/Kossmann:Donald.html; (3–4):155, February 2000. CODEN http://link.springer.de/link/service/ VLDBFR. ISSN 1066-8888 (print), journals/00778/bibs/0008003/00080156. 0949-877X (electronic). htm; http://link.springer.de/link/ Widom:2000:BPV service/journals/00778/papers/0008003/ 00080156.pdf. Electronic edition. [144] Jennifer Widom and Oded Shmueli. Best papers of VLDB ‘98, New George:2000:SBF York: Foreword by the VLDB ‘98 PC Chairmen: Best Papers [146] Binto George and Jayant R. Haritsa. Secure buffering in firm realof VLDB ‘98. VLDB Journal: time database systems. VLDB JourVery Large Data Bases, 8(3–4):155, nal: Very Large Data Bases, 8(3– February 2000. CODEN VLDBFR. 4):178–198, February 2000. CODEN ISSN 1066-8888 (print), 0949-877X VLDBFR. ISSN 1066-8888 (print), (electronic). URL http://ftp. 0949-877X (electronic). URL http: informatik.rwth-aachen.de/dblp/ //ftp.informatik.rwth-aachen.de/ db/indices/a-tree/s/Shmueli:Oded. dblp/db/indices/a-tree/g/George: http://ftp.informatik.rwthhtml; http://ftp.informatik. Binto.html; aachen.de/dblp/db/indices/a-tree/ rwth-aachen.de/dblp/db/indices/ w/Widom:Jennifer.html; http:/ a-tree/h/Haritsa:Jayant_R=.html; /link.springer.de/link/service/ http://link.springer.de/link/service/ journals/00778/bibs/0008003/00080155. journals/00778/bibs/0008003/00080178. htm; http://link.springer.de/link/ service/journals/00778/papers/0008003/ htm; http://link.springer.de/link/ service/journals/00778/papers/0008003/ 00080155.pdf. Electronic edition. 00080178.pdf. Electronic edition. Braumandl:2000:FJP Muth:2000:LLS [145] Reinhard Braumandl, Jens Claußen, Alfons Kemper, and Donald Koss- [147] Peter Muth, Patrick E. O’Neil, Achim Pick, and Gerhard Weikum. The mann. Functional-join process- REFERENCES 58 pdf. Electronic edition. LHAM log-structured history data access method. VLDB Journal: Very Knorr:2000:DBO Large Data Bases, 8(3–4):199–221, February 2000. CODEN VLDBFR. [149] Edwin M. Knorr, Raymond T. Ng, ISSN 1066-8888 (print), 0949-877X and Vladimir Tucakov. Distance(electronic). URL http://ftp. based outliers: Algorithms and apinformatik.rwth-aachen.de/dblp/ plications. VLDB Journal: Very db/indices/a-tree/m/Muth:Peter. Large Data Bases, 8(3–4):237–253, http://ftp.informatik.rwthhtml; February 2000. CODEN VLDBFR. aachen.de/dblp/db/indices/a-tree/ ISSN 1066-8888 (print), 0949-877X http: o/O=Neil:Patrick_E=.html; (electronic). URL http://ftp. //ftp.informatik.rwth-aachen.de/ informatik.rwth-aachen.de/dblp/ dblp/db/indices/a-tree/p/Pick:Achim. db/indices/a-tree/k/Knorr:Edwin_ html; http://ftp.informatik.rwthhttp://ftp.informatik. M=.html; aachen.de/dblp/db/indices/a-tree/ rwth-aachen.de/dblp/db/indices/ w/Weikum:Gerhard.html; http:/ http: a-tree/n/Ng:Raymond_T=.html; /link.springer.de/link/service/ //ftp.informatik.rwth-aachen.de/ journals/00778/bibs/0008003/00080199. dblp/db/indices/a-tree/t/Tucakov: htm; http://link.springer.de/link/ V=.html; http://link.springer.de/ service/journals/00778/papers/0008003/ link/service/journals/00778/bibs/ 00080199.pdf. Electronic edition. 0008003/00080237.htm; http:// link.springer.de/link/service/journals/ Gibson:2000:CCD 00778/papers/0008003/00080237.pdf. Electronic edition. [148] David Gibson, Jon M. Kleinberg, and Korn:2000:QDM Prabhakar Raghavan. Clustering categorical data: An approach based [150] Flip Korn, Alexandros Labrinidis, Yannis Kotidis, and Christos Faloutsos. on dynamical systems. VLDB JourQuantifiable data mining using ranal: Very Large Data Bases, 8(3– tio rules. VLDB Journal: Very 4):222–236, February 2000. CODEN Large Data Bases, 8(3–4):254–266, VLDBFR. ISSN 1066-8888 (print), February 2000. CODEN VLDBFR. 0949-877X (electronic). URL http: ISSN 1066-8888 (print), 0949-877X //ftp.informatik.rwth-aachen.de/ (electronic). URL http://ftp. dblp/db/indices/a-tree/g/Gibson: http://ftp.informatik. informatik.rwth-aachen.de/dblp/ David.html; db/indices/a-tree/f/Faloutsos:Christos. rwth-aachen.de/dblp/db/indices/ http://ftp.informatik.rwthhtml; a-tree/k/Kleinberg:Jon_M=.html; http://ftp.informatik.rwth-aachen. aachen.de/dblp/db/indices/a-tree/ de/dblp/db/indices/a-tree/r/Raghavan: k/Korn:Flip.html; http://ftp. http://link.springer. informatik.rwth-aachen.de/dblp/ Prabhakar.html; db/indices/a-tree/k/Kotidis:Yannis. de/link/service/journals/00778/ http://ftp.informatik.rwthhtml; bibs/0008003/00080222.htm; http: aachen.de/dblp/db/indices/a-tree/ //link.springer.de/link/service/ journals/00778/papers/0008003/00080222. l/Labrinidis:Alexandros.html; REFERENCES 59 http://link.springer.de/link/service/ journals/00778/bibs/0008003/00080254. htm; http://link.springer.de/link/ service/journals/00778/papers/0008003/ 00080254.pdf. Electronic edition. Torp:2000:ETD html; http://ftp.informatik.rwthaachen.de/dblp/db/indices/a-tree/ http://link. z/Zhang:Aidong.html; springer.de/link/service/journals/ 00778/bibs/0008003/00080289.htm; http://link.springer.de/link/service/ journals/00778/papers/0008003/00080289. pdf. Electronic edition. [151] Kristian Torp, Christian S. Jensen, and Richard Thomas Snodgrass. Effective Pacitti:2000:UPS timestamping in databases. VLDB Journal: Very Large Data Bases, 8(3– [153] Esther Pacitti and Eric Simon. Update propagation strategies to im4):267–288, February 2000. CODEN prove freshness in lazy master repliVLDBFR. ISSN 1066-8888 (print), cated databases. VLDB Journal: Very 0949-877X (electronic). URL http: Large Data Bases, 8(3–4):305–318, //ftp.informatik.rwth-aachen.de/ February 2000. CODEN VLDBFR. dblp/db/indices/a-tree/j/Jensen: ISSN 1066-8888 (print), 0949-877X Christian_S=.html; http://ftp. (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/s/Snodgrass:Richard_ informatik.rwth-aachen.de/dblp/ http://ftp.informatik. db/indices/a-tree/p/Pacitti:Esther. T=.html; http://ftp.informatik.rwthrwth-aachen.de/dblp/db/indices/ html; http: aachen.de/dblp/db/indices/a-tree/ a-tree/t/Torp:Kristian.html; //link.springer.de/link/service/ s/Simon:Eric.html; http://link. journals/00778/bibs/0008003/00080267. springer.de/link/service/journals/ htm; http://link.springer.de/link/ 00778/bibs/0008003/00080305.htm; service/journals/00778/papers/0008003/ http://link.springer.de/link/service/ journals/00778/papers/0008003/00080305. 00080267.pdf. Electronic edition. pdf. Electronic edition. Sheikholeslami:2000:WWB Liang:2000:OMD [152] Gholamhosein Sheikholeslami, Surojit Chatterjee, and Aidong Zhang. [154] Weifa Liang, Maria E. Orlowska, and Jeffrey X. Yu. OptimizWaveCluster: a wavelet based clustering multiple dimensional queries siing approach for spatial data in very multaneously in multidimensional large databases. VLDB Journal: Very databases. VLDB Journal: Very Large Data Bases, 8(3–4):289–304, Large Data Bases, 8(3–4):319–338, February 2000. CODEN VLDBFR. February 2000. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X ISSN 1066-8888 (print), 0949-877X (electronic). URL http://ftp. (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ informatik.rwth-aachen.de/dblp/ db/indices/a-tree/c/Chatterjee: http://ftp.informatik. db/indices/a-tree/l/Liang:Weifa. Surojit.html; http://ftp.informatik.rwthrwth-aachen.de/dblp/db/indices/ html; a-tree/s/Sheikholeslami:Gholamhosein. aachen.de/dblp/db/indices/a-tree/ REFERENCES 60 (electronic). URL http://ftp. http: o/Orlowska:Maria_E=.html; informatik.rwth-aachen.de/dblp/ //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/y/Yu:Jeffrey_ db/indices/a-tree/b/Borghoff:Uwe_ http://ftp.informatik. X=.html; http://link.springer. M=.html; rwth-aachen.de/dblp/db/indices/ de/link/service/journals/00778/ a-tree/c/Chidlovskii:Boris.html; bibs/0008003/00080319.htm; http: http://link.springer.de/link/service/ //link.springer.de/link/service/ journals/00778/papers/0008003/00080319. journals/00778/bibs/0009001/00090002. pdf. Electronic edition. htm; http://link.springer.de/link/ service/journals/00778/papers/0009001/ Atzeni:2000:DWG 00090002.pdf. Electronic edition. [155] Paolo Atzeni and Alberto O. MendelGruser:2000:LRT zon. Databases and the Web: Guest editorial: Databases and the Web. [158] Jean-Robert Gruser, Louiqa Raschid, Vladimir Zadorozhny, and Tao Zhan. VLDB Journal: Very Large Data Learning response time for WebSources Bases, 9(1):1, March 2000. CODEN using query feedback and applicaVLDBFR. ISSN 1066-8888 (print), tion in query optimization. VLDB 0949-877X (electronic). URL http: Journal: Very Large Data Bases, 9 //ftp.informatik.rwth-aachen.de/ (1):18–37, March 2000. CODEN dblp/db/indices/a-tree/a/Atzeni: VLDBFR. ISSN 1066-8888 (print), http://ftp.informatik. Paolo.html; 0949-877X (electronic). URL http: rwth-aachen.de/dblp/db/indices/ //ftp.informatik.rwth-aachen.de/ a-tree/m/Mendelzon:Alberto_O=.html; http://link.springer.de/link/service/ dblp/db/indices/a-tree/g/Gruser: Jean=Robert.html; http://ftp. journals/00778/bibs/0009001/00090001. informatik.rwth-aachen.de/dblp/ htm; http://link.springer.de/link/ service/journals/00778/papers/0009001/ db/indices/a-tree/r/Raschid:Louiqa. http://ftp.informatik.rwthhtml; 00090001.pdf. Electronic edition. aachen.de/dblp/db/indices/a-tree/ Atzeni:2000:GE http: z/Zadorozhny:Vladimir.html; //ftp.informatik.rwth-aachen.de/ [156] Paolo Atzeni and Alberto O. Mendeldblp/db/indices/a-tree/z/Zhan:Tao. zon. Guest editorial. VLDB Journal: html; http://link.springer.de/ Very Large Data Bases, 9(1):1, March link/service/journals/00778/bibs/ 2000. CODEN VLDBFR. ISSN 10660009001/00090018.htm; http://link. 8888 (print), 0949-877X (electronic). springer.de/link/service/journals/ 00778/papers/0009001/00090018.pdf. Chidlovskii:2000:SCW Electronic edition. [157] Boris Chidlovskii and Uwe M. Fernandez:2000:DSW Borghoff. Semantic caching of Web queries. VLDB Journal: [159] Mary Fernández, Daniela Florescu, Alon Levy, and Dan Suciu. DeclarVery Large Data Bases, 9(1):2–17, ative specification of Web sites with March 2000. CODEN VLDBFR. S. VLDB Journal: Very Large ISSN 1066-8888 (print), 0949-877X REFERENCES 61 a query language and algebra for Data Bases, 9(1):38–55, March 2000. semistructured data based on strucCODEN VLDBFR. ISSN 1066tural recursion. VLDB Journal: 8888 (print), 0949-877X (electronic). Very Large Data Bases, 9(1):76–110, URL http://ftp.informatik.rwthMarch 2000. CODEN VLDBFR. aachen.de/dblp/db/indices/a-tree/ ISSN 1066-8888 (print), 0949-877X http: f/Fernandez:Mary_F=.html; (electronic). URL http://ftp. //ftp.informatik.rwth-aachen.de/ informatik.rwth-aachen.de/dblp/ dblp/db/indices/a-tree/f/Florescu: Daniela.html; http://ftp.informatik. db/indices/a-tree/b/Buneman:Peter. http://ftp.informatik.rwthrwth-aachen.de/dblp/db/indices/ html; http: aachen.de/dblp/db/indices/a-tree/ a-tree/l/Levy:Alon_Y=.html; http: //ftp.informatik.rwth-aachen.de/ f/Fernandez:Mary_F=.html; //ftp.informatik.rwth-aachen.de/ dblp/db/indices/a-tree/s/Suciu: http://link.springer. dblp/db/indices/a-tree/s/Suciu: Dan.html; http://link.springer. de/link/service/journals/00778/ Dan.html; de/link/service/journals/00778/ bibs/0009001/00090038.htm; http: bibs/0009001/00090076.htm; http: //link.springer.de/link/service/ journals/00778/papers/0009001/00090038. //link.springer.de/link/service/ journals/00778/papers/0009001/00090076. pdf. Electronic edition. pdf. Electronic edition. Berendt:2000:ANB Mirbel:2000:CTI [160] Bettina Berendt and Myra Spiliopoulou. Analysis of navigation behaviour in [162] Isabelle Mirbel, Barbara Pernici, Web sites integrating multiple inTimos K. Sellis, S. Tserkezoglou, formation systems. VLDB Journal: and Michalis Vazirgiannis. CheckVery Large Data Bases, 9(1):56–75, ing the temporal integrity of interacMarch 2000. CODEN VLDBFR. tive multimedia documents. VLDB ISSN 1066-8888 (print), 0949-877X Journal: Very Large Data Bases, 9 (electronic). URL http://ftp. (2):111–130, July 2000. CODEN informatik.rwth-aachen.de/dblp/ VLDBFR. ISSN 1066-8888 (print), db/indices/a-tree/b/Berendt:Bettina. 0949-877X (electronic). URL http: http://ftp.informatik.rwthhtml; //ftp.informatik.rwth-aachen.de/ aachen.de/dblp/db/indices/a-tree/ dblp/db/indices/a-tree/m/Mirbel: http: s/Spiliopoulou:Myra.html; http://ftp.informatik. Isabelle.html; //link.springer.de/link/service/ rwth-aachen.de/dblp/db/indices/ journals/00778/bibs/0009001/00090056. a-tree/p/Pernici:Barbara.html; htm; http://link.springer.de/link/ http://ftp.informatik.rwth-aachen. service/journals/00778/papers/0009001/ de/dblp/db/indices/a-tree/s/Sellis: 00090056.pdf. Electronic edition. http://ftp.informatik. Timos_K=.html; rwth-aachen.de/dblp/db/indices/ Buneman:2000:UQL a-tree/t/Tserkezoglou:S=.html; [161] Peter Buneman, Mary F. Fernanhttp://ftp.informatik.rwth-aachen. de/dblp/db/indices/a-tree/v/Vazirgiannis: dez, and Dan Suciu. UnQL: REFERENCES 62 http://link.springer. a-tree/c/Cheung:Yin=Ling.html; Michalis.html; http://ftp.informatik.rwth-aachen. de/link/service/journals/00778/ de/dblp/db/indices/a-tree/f/Fu: bibs/0009002/00090111.htm; http: Ada_Wai=Chee.html; http://ftp. //link.springer.de/link/service/ journals/00778/papers/0009002/00090111. informatik.rwth-aachen.de/dblp/ db/indices/a-tree/m/Moon:Yiu_Sang. pdf. Electronic edition. html; http://link.springer.de/ Candan:2000:VMM link/service/journals/00778/bibs/ 0009002/00090154.htm; http://link. [163] K. Selçuk Candan, Eric Lemar, and springer.de/link/service/journals/ V. S. Subrahmanian. View manage00778/papers/0009002/00090154.pdf. ment in multimedia databases. VLDB Electronic edition. Journal: Very Large Data Bases, 9 Atkinson:2000:GE (2):131–153, July 2000. CODEN VLDBFR. ISSN 1066-8888 (print), [165] Malcolm P. Atkinson. Guest edi0949-877X (electronic). URL http: torial. VLDB Journal: Very Large //ftp.informatik.rwth-aachen.de/ Data Bases, 9(3):175–176, December dblp/db/indices/a-tree/c/Candan: 2000. CODEN VLDBFR. ISSN K=_Sel=ccedil=uk.html; http:/ 1066-8888 (print), 0949-877X (elec/ftp.informatik.rwth-aachen.de/ tronic). URL http://link.springer. dblp/db/indices/a-tree/l/Lemar: de/link/service/journals/00778/ Eric.html; http://ftp.informatik. http: bibs/0009003/00090175.htm; rwth-aachen.de/dblp/db/indices/ //link.springer.de/link/service/ a-tree/s/Subrahmanian:V=_S=.html; journals/00778/papers/0009003/00090175. http://link.springer.de/link/service/ pdf. journals/00778/bibs/0009002/00090131. Bernstein:2000:CBP htm; http://link.springer.de/link/ service/journals/00778/papers/0009002/ [166] Philip A. Bernstein, Shankar Pal, and 00090131.pdf. Electronic edition. David Shutt. Context-based prefetch — an optimization for implementing Fu:2000:DVT objects on relations. VLDB Journal: Very Large Data Bases, 9(3): [164] Ada Wai chee Fu, Polly Mei shuen 177–189, December 2000. CODEN Chan, Yin-Ling Cheung, and Yiu Sang VLDBFR. ISSN 1066-8888 (print), Moon. Dynamic vp-tree indexing 0949-877X (electronic). URL http: for n-nearest neighbor search given //link.springer.de/link/service/ pair-wise distances. VLDB Jourjournals/00778/bibs/0009003/00090177. nal: Very Large Data Bases, 9(2):154– htm; http://link.springer.de/ 173, July 2000. CODEN VLDBFR. link/service/journals/00778/papers/ ISSN 1066-8888 (print), 0949-877X 0009003/00090177.pdf. (electronic). URL http://ftp. informatik.rwth-aachen.de/dblp/ Claussen:2000:EES db/indices/a-tree/c/Chan:Polly_ http://ftp.informatik. [167] J. Claussen, A. Kemper, D. KossMei=shuen.html; rwth-aachen.de/dblp/db/indices/ mann, and C. Wiesner. Exploit- REFERENCES 63 journals/00778/papers/0009003/00090231. ing early sorting and early partitionpdf. ing for decision support query processing. VLDB Journal: Very Large Raman:2000:ODR Data Bases, 9(3):190–213, December 2000. CODEN VLDBFR. ISSN [170] Vijayshankar Raman, Bhaskaran 1066-8888 (print), 0949-877X (elecRaman, and Joseph M. Hellertronic). URL http://link.springer. stein. Online dynamic reorderde/link/service/journals/00778/ ing. VLDB Journal: Very Large http: bibs/0009003/00090190.htm; Data Bases, 9(3):247–260, December //link.springer.de/link/service/ 2000. CODEN VLDBFR. ISSN journals/00778/papers/0009003/00090190. 1066-8888 (print), 0949-877X (elecpdf. tronic). URL http://link.springer. Jagadish:2000:ODM de/link/service/journals/00778/ http: bibs/0009003/00090247.htm; //link.springer.de/link/service/ journals/00778/papers/0009003/00090247. pdf. [168] H. V. Jagadish, Olga Kapitskaia, Raymond T. Ng, and Divesh Srivastava. One-dimensional and multiTan:2000:PEN dimensional substring selectivity estimation. VLDB Journal: Very Large [171] Kian-Lee Tan, Cheng Hian Goh, Data Bases, 9(3):214–230, December and Beng Chin Ooi. Progres2000. CODEN VLDBFR. ISSN sive evaluation of nested aggregate 1066-8888 (print), 0949-877X (elecqueries. VLDB Journal: Very Large tronic). URL http://link.springer. Data Bases, 9(3):261–278, December de/link/service/journals/00778/ 2000. CODEN VLDBFR. ISSN http: bibs/0009003/00090214.htm; 1066-8888 (print), 0949-877X (elec//link.springer.de/link/service/ journals/00778/papers/0009003/00090214. tronic). URL http://link.springer. de/link/service/journals/00778/ pdf. http: bibs/0009003/00090261.htm; //link.springer.de/link/service/ Manegold:2000:ODA journals/00778/papers/0009003/00090261. pdf. [169] Stefan Manegold, Peter A. Boncz, and Martin L. Kersten. OpNgu:2001:CMV timizing database architecture for [172] Anne H. H. Ngu, Quan Z. Sheng, Du Q. the new bottleneck: memory acHuynh, and Ron Lei. Combining multicess. VLDB Journal: Very Large visual features for efficient indexing in a Data Bases, 9(3):231–246, December large image database. VLDB Journal: 2000. CODEN VLDBFR. ISSN Very Large Data Bases, 9(4):279–293, 1066-8888 (print), 0949-877X (elecApril 2001. CODEN VLDBFR. ISSN tronic). URL http://link.springer. 1066-8888 (print), 0949-877X (elecde/link/service/journals/00778/ http: tronic). URL http://link.springer. bibs/0009003/00090231.htm; //link.springer.de/link/service/ de/link/service/journals/00778/ REFERENCES 64 1066-8888 (print), 0949-877X (elechttp: bibs/1009004/10090279.htm; tronic). URL http://link.springer. //link.springer.de/link/service/ journals/00778/papers/1009004/10090279. de/link/service/journals/00778/ bibs/1009004/10090327.htm; http: pdf. //link.springer.de/link/service/ Combi:2001:HTD journals/00778/papers/1009004/10090327. pdf. [173] Carlo Combi and Giuseppe Pozzi. HMAP — a temporal data model manWang:2001:IVH aging intervals with different granularities and indeterminacy from natural [176] Changzhou Wang and X. Sean Wang. Indexing very high-dimensional sparse language sentences. VLDB Journal: and quasi-sparse vectors for similarVery Large Data Bases, 9(4):294–311, ity searches. VLDB Journal: Very April 2001. CODEN VLDBFR. ISSN Large Data Bases, 9(4):344–361, April 1066-8888 (print), 0949-877X (elec2001. CODEN VLDBFR. ISSN tronic). URL http://link.springer. 1066-8888 (print), 0949-877X (elecde/link/service/journals/00778/ http: tronic). URL http://link.springer. bibs/1009004/10090294.htm; //link.springer.de/link/service/ de/link/service/journals/00778/ journals/00778/papers/1009004/10090294. bibs/1009004/10090344.htm; http: pdf. //link.springer.de/link/service/ journals/00778/papers/1009004/10090344. Li:2001:SEM pdf. [174] Wen-Syan Li, K. Selçuk Candan, KyCasati:2001:GE oji Hirata, and Yoshinori Hara. Supporting efficient multimedia database [177] Fabio Casati, Ming-Chien Shan, and Dimitrios Georgakopoulos. Guest exploration. VLDB Journal: Very editorial. VLDB Journal: Very Large Data Bases, 9(4):312–326, April Large Data Bases, 10(1):1, August 2001. CODEN VLDBFR. ISSN 2001. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (elec1066-8888 (print), 0949-877X (electronic). URL http://link.springer. tronic). URL http://link.springer. de/link/service/journals/00778/ http: de/link/service/journals/00778/ bibs/1009004/10090312.htm; http: //link.springer.de/link/service/ bibs/1010001/10100001.htm; journals/00778/papers/1009004/10090312. //link.springer.de/link/service/ journals/00778/papers/1010001/10100001. pdf. pdf. Lee:2001:GTM Mecella:2001:DWC [175] Chiang Lee, Chi-Sheng Shih, and Yaw-Huei Chen. A graph-theoretic [178] Massimo Mecella and Barbara Pernici. Designing wrapper components model for optimizing queries involvfor e-services in integrating heterogeing methods. VLDB Journal: Very neous systems. VLDB Journal: Very Large Data Bases, 9(4):327–343, April Large Data Bases, 10(1):2–15, Au2001. CODEN VLDBFR. ISSN REFERENCES 65 ternet. VLDB Journal: Very Large gust 2001. CODEN VLDBFR. ISSN Data Bases, 10(1):48–71, August 1066-8888 (print), 0949-877X (elec2001. CODEN VLDBFR. ISSN tronic). URL http://link.springer. 1066-8888 (print), 0949-877X (elecde/link/service/journals/00778/ tronic). URL http://link.springer. http: bibs/1010001/10100002.htm; de/link/service/journals/00778/ //link.springer.de/link/service/ journals/00778/papers/1010001/10100002. bibs/1010001/10100048.htm; http: pdf. //link.springer.de/link/service/ journals/00778/papers/1010001/10100048. Eyal:2001:ICH pdf. [179] Anat Eyal and Tova Milo. IntegratSu:2001:IBN ing and customizing heterogeneous ecommerce applications. VLDB Journal: Very Large Data Bases, 10 [182] Stanley Y. W. Su, Chunbo Huang, Joachim Hammer, Yihua Huang, (1):16–38, August 2001. CODEN Haifei Li, Liu Wang, Youzhong Liu, VLDBFR. ISSN 1066-8888 (print), Charnyote Pluempitiwiriyawej, Min0949-877X (electronic). URL http: soo Lee, and Herman Lam. An //link.springer.de/link/service/ Internet-based negotiation server for journals/00778/bibs/1010001/10100016. e-commerce. VLDB Journal: Very htm; http://link.springer.de/ Large Data Bases, 10(1):72–90, Aulink/service/journals/00778/papers/ gust 2001. CODEN VLDBFR. ISSN 1010001/10100016.pdf. 1066-8888 (print), 0949-877X (elecBonifati:2001:ARX tronic). URL http://link.springer. de/link/service/journals/00778/ [180] Angela Bonifati, Stefano Ceri, and http: bibs/1010001/10100072.htm; Stefano Paraboschi. Active rules //link.springer.de/link/service/ for XML: a new paradigm for Ejournals/00778/papers/1010001/10100072. services. VLDB Journal: Very pdf. Large Data Bases, 10(1):39–47, August 2001. CODEN VLDBFR. ISSN Shegalov:2001:XEW 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. [183] German Shegalov, Michael Gillde/link/service/journals/00778/ mann, and Gerhard Weikum. XMLhttp: bibs/1010001/10100039.htm; enabled workflow management for e//link.springer.de/link/service/ services across heterogeneous platjournals/00778/papers/1010001/10100039. forms. VLDB Journal: Very Large pdf. Data Bases, 10(1):91–103, August Braumandl:2001:OUQ [181] R. Braumandl, M. Keidl, A. Kemper, D. Kossmann, A. Kreutz, S. Seltzsam, and K. Stocker. ObjectGlobe: Ubiquitous query processing on the In- 2001. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. de/link/service/journals/00778/ http: bibs/1010001/10100091.htm; //link.springer.de/link/service/ REFERENCES 66 journals/00778/papers/1010001/10100091. tronic). URL http://link.springer. de/link/service/journals/00778/ pdf. bibs/1010002/10100120.htm; http: Datta:2001:ASS //link.springer.de/link/service/ journals/00778/papers/1010002/10100120. [184] Anindya Datta, Kaushik Dutta, Depdf. bra VanderMeer, Krithi Ramamritham, and Shamkant B. Navathe. Shanmugasundaram:2001:EPR An architecture to support scalable online personalization on the [187] Jayavel Shanmugasundaram, Eugene Shekita, Rimon Barr, Michael Carey, Web. VLDB Journal: Very Large Bruce Lindsay, Hamid Pirahesh, and Data Bases, 10(1):104–117, August Berthold Reinwald. Efficiently pub2001. CODEN VLDBFR. ISSN lishing relational data as XML doc1066-8888 (print), 0949-877X (elecuments. VLDB Journal: Very Large tronic). URL http://link.springer. Data Bases, 10(2–3):133–154, Septemde/link/service/journals/00778/ http: ber 2001. CODEN VLDBFR. ISSN bibs/1010001/10100104.htm; //link.springer.de/link/service/ 1066-8888 (print), 0949-877X (elecjournals/00778/papers/1010001/10100104. tronic). URL http://link.springer. pdf. de/link/service/journals/00778/ http: bibs/1010002/10100133.htm; ElAbbadi:2001:GE //link.springer.de/link/service/ journals/00778/papers/1010002/10100133. [185] Amr El Abbadi, Gunter Schlageter, pdf. and Kyu-Young Whang. Guest editorial. VLDB Journal: Very Large Chang:2001:AQM Data Bases, 10(2–3):119, September 2001. CODEN VLDBFR. ISSN [188] Kevin Chen-Chuan Chang and Héctor Garcı́a-Molina. Approximate query 1066-8888 (print), 0949-877X (elecmapping: Accounting for translation tronic). URL http://link.springer. closeness. VLDB Journal: Very Large de/link/service/journals/00778/ http: Data Bases, 10(2–3):155–181, Septembibs/1010002/10100119.htm; //link.springer.de/link/service/ ber 2001. CODEN VLDBFR. ISSN journals/00778/papers/1010002/10100119. 1066-8888 (print), 0949-877X (elecpdf. tronic). URL http://link.springer. de/link/service/journals/00778/ Pucheral:2001:PSD http: bibs/1010002/10100155.htm; //link.springer.de/link/service/ [186] Philippe Pucheral, Luc Bouganim, journals/00778/papers/1010002/10100155. Patrick Valduriez, and Christophe pdf. Bobineau. PicoDBMS: Scaling down database techniques for the smartcard. VLDB Journal: Very Large Data Bases, 10(2–3):120–132, September 2001. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (elec- Pottinger:2001:MSA [189] Rachel Pottinger and Alon Halevy. MiniCon: a scalable algorithm for answering queries using views. REFERENCES 67 database management systems. VLDB VLDB Journal: Very Large Data Journal: Very Large Data Bases, 10 Bases, 10(2–3):182–198, September (4):241–269, December 2001. CODEN 2001. CODEN VLDBFR. ISSN VLDBFR. ISSN 1066-8888 (print), 1066-8888 (print), 0949-877X (elec0949-877X (electronic). URL http: tronic). URL http://link.springer. //link.springer.de/link/service/ de/link/service/journals/00778/ http: journals/00778/bibs/1010004/10100241. bibs/1010002/10100182.htm; //link.springer.de/link/service/ htm; http://link.springer.de/ journals/00778/papers/1010002/10100182. link/service/journals/00778/papers/ pdf. 1010004/10100241.pdf. Chakrabarti:2001:AQP Halevy:2001:AQU [190] Kaushik Chakrabarti, Minos Garo- [193] Alon Y. Halevy. Answering queries falakis, Rajeev Rastogi, and Kyuseok using views: a survey. VLDB JourShim. Approximate query processnal: Very Large Data Bases, 10(4): ing using wavelets. VLDB Jour270–294, December 2001. CODEN nal: Very Large Data Bases, 10(2–3): VLDBFR. ISSN 1066-8888 (print), 199–223, September 2001. CODEN 0949-877X (electronic). URL http: VLDBFR. ISSN 1066-8888 (print), //link.springer.de/link/service/ journals/00778/bibs/1010004/10100270. 0949-877X (electronic). URL http: htm; http://link.springer.de/ //link.springer.de/link/service/ journals/00778/bibs/1010002/10100199. link/service/journals/00778/papers/ htm; http://link.springer.de/ 1010004/10100270.pdf. link/service/journals/00778/papers/ Laurent:2001:MCI 1010002/10100199.pdf. [194] D. Laurent, J. Lechtenbörger, N. Spyratos, and G. Vossen. Monotonic com[191] Sunita Sarawagi. User-cognizant mulplements for independent data waretidimensional analysis. VLDB Jourhouses. VLDB Journal: Very Large nal: Very Large Data Bases, 10(2–3): Data Bases, 10(4):295–315, Decem224–239, September 2001. CODEN ber 2001. CODEN VLDBFR. ISSN VLDBFR. ISSN 1066-8888 (print), 1066-8888 (print), 0949-877X (elec0949-877X (electronic). URL http: tronic). URL http://link.springer. //link.springer.de/link/service/ de/link/service/journals/00778/ journals/00778/bibs/1010002/10100224. http: bibs/1010004/10100295.htm; htm; http://link.springer.de/ //link.springer.de/link/service/ link/service/journals/00778/papers/ journals/00778/papers/1010004/10100295. 1010002/10100224.pdf. pdf. Sarawagi:2001:UCM Turker:2001:SIS Grefen:2001:GTS [192] Can Türker and Michael Gertz. Semantic integrity support in SQL:1999 and commercial (object-)relational [195] Paul Grefen, Jochem Vonk, and Peter Apers. Global transaction support for workflow management systems: from REFERENCES 68 lar shapes. VLDB Journal: Very formal specification to practical imLarge Data Bases, 11(1):17–27, Auplementation. VLDB Journal: Very gust 2002. CODEN VLDBFR. ISSN Large Data Bases, 10(4):316–333, De1066-8888 (print), 0949-877X (eleccember 2001. CODEN VLDBFR. ISSN tronic). URL http://link.springer. 1066-8888 (print), 0949-877X (elecde/link/service/journals/00778/ tronic). URL http://link.springer. bibs/2011001/20110017.htm; http: de/link/service/journals/00778/ http: //link.springer.de/link/service/ bibs/1010004/10100316.htm; //link.springer.de/link/service/ journals/00778/papers/2011001/20110017. journals/00778/papers/1010004/10100316. pdf. pdf. Navarro:2002:SMS Rahm:2001:SAA [199] Gonzalo Navarro. Searching in met[196] Erhard Rahm and Philip A. Bernric spaces by spatial approximastein. A survey of approaches to autotion. VLDB Journal: Very Large matic schema matching. VLDB JourData Bases, 11(1):28–46, August nal: Very Large Data Bases, 10(4): 2002. CODEN VLDBFR. ISSN 334–350, December 2001. CODEN 1066-8888 (print), 0949-877X (elecVLDBFR. ISSN 1066-8888 (print), tronic). URL http://link.springer. 0949-877X (electronic). URL http: de/link/service/journals/00778/ //link.springer.de/link/service/ http: bibs/2011001/20110028.htm; journals/00778/bibs/1010004/10100334. //link.springer.de/link/service/ htm; http://link.springer.de/ journals/00778/papers/2011001/20110028. link/service/journals/00778/papers/ pdf. 1010004/10100334.pdf. Mihaila:2002:LAD Saltenis:2002:INR [200] George A. Mihaila, Louiqa Raschid, and Anthony Tomasic. Locating and [197] Simonas Šaltenis and Christian S. accessing data repositories with WebJensen. Indexing of now-relative Semantics. VLDB Journal: Very spatio-bitemporal data. VLDB JourLarge Data Bases, 11(1):47–57, Aunal: Very Large Data Bases, 11 gust 2002. CODEN VLDBFR. ISSN (1):1–16, August 2002. CODEN 1066-8888 (print), 0949-877X (elecVLDBFR. ISSN 1066-8888 (print), tronic). URL http://link.springer. 0949-877X (electronic). URL http: de/link/service/journals/00778/ //link.springer.de/link/service/ http: bibs/2011001/20110047.htm; journals/00778/bibs/2011001/20110001. //link.springer.de/link/service/ htm; http://link.springer.de/ journals/00778/papers/2011001/20110047. link/service/journals/00778/papers/ pdf. 2011001/20110001.pdf. Rafiei:2002:ERS Ferrari:2002:ASD [198] Davood Rafiei and Alberto O. Mendelzon. Efficient retrieval of simi- [201] E. Ferrari, N. R. Adam, V. Atluri, E. Bertino, and U. Capuozzo. An REFERENCES 69 authorization system for digital liHjaltason:2002:SCP braries. VLDB Journal: Very Large Data Bases, 11(1):58–67, August [204] Gisli R. Hjaltason and Hanan Samet. Speeding up construction of PMR 2002. CODEN VLDBFR. ISSN quadtree-based spatial indexes. VLDB 1066-8888 (print), 0949-877X (elecJournal: Very Large Data Bases, 11 tronic). URL http://link.springer. (2):109–137, October 2002. CODEN de/link/service/journals/00778/ VLDBFR. ISSN 1066-8888 (print), http: bibs/2011001/20110058.htm; 0949-877X (electronic). URL http: //link.springer.de/link/service/ journals/00778/papers/2011001/20110058. //link.springer.de/link/service/ journals/00778/bibs/2011002/20110109. pdf. htm; http://link.springer.de/ link/service/journals/00778/papers/ Marathe:2002:QPT 2011002/20110109.pdf. Nanopoulos:2002:ESS [202] Arunprasad P. Marathe and Kenneth Salem. Query processing techniques [205] Alexandros Nanopoulos and Yanfor arrays. VLDB Journal: Very nis Manolopoulos. Efficient simLarge Data Bases, 11(1):68–91, Auilarity search for market basket gust 2002. CODEN VLDBFR. ISSN data. VLDB Journal: Very Large 1066-8888 (print), 0949-877X (elecData Bases, 11(2):138–152, October tronic). URL http://link.springer. 2002. CODEN VLDBFR. ISSN de/link/service/journals/00778/ 1066-8888 (print), 0949-877X (elechttp: bibs/2011001/20110068.htm; tronic). URL http://link.springer. //link.springer.de/link/service/ de/link/service/journals/00778/ journals/00778/papers/2011001/20110068. bibs/2011002/20110138.htm; http: pdf. //link.springer.de/link/service/ Sakurai:2002:SIH journals/00778/papers/2011002/20110138. pdf. Feng:2002:TMM [203] Yasushi Sakurai, Masatoshi Yoshikawa, Shunsuke Uemura, and Haruhiko Ko- [206] Ling Feng, Jeffrey Xu Yu, Hongjun Lu, and Jiawei Han. A template model for jima. Spatial indexing of highmultidimensional inter-transactional dimensional data based on relative apassociation rules. VLDB Journal: Very proximation. VLDB Journal: Very Large Data Bases, 11(2):153–175, OcLarge Data Bases, 11(2):93–108, Octotober 2002. CODEN VLDBFR. ISSN ber 2002. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (elec1066-8888 (print), 0949-877X (electronic). URL http://link.springer. tronic). URL http://link.springer. de/link/service/journals/00778/ de/link/service/journals/00778/ http: http: bibs/2011002/20110153.htm; bibs/2011002/20110093.htm; //link.springer.de/link/service/ //link.springer.de/link/service/ journals/00778/papers/2011002/20110093. journals/00778/papers/2011002/20110153. pdf. pdf. REFERENCES 70 Apers:2002:E journals/00778/bibs/2011003/20110198. htm; http://link.springer.de/ link/service/journals/00778/papers/ 2011003/20110198.pdf. Special issue VLDB best papers 2001. [207] Peter Apers, Stefano Ceri, and Richard Snodgrass. Editorial. VLDB Journal: Very Large Data Bases, 11(3): 177–178, November 2002. CODEN Chirkova:2002:FPV VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: [210] Rada Chirkova, Alon Y. Halevy, //link.springer.de/link/service/ and Dan Suciu. A formal perjournals/00778/bibs/2011003/20110177. spective on the view selection probhtm; http://link.springer.de/ lem. VLDB Journal: Very Large link/service/journals/00778/papers/ Data Bases, 11(3):216–237, Novem2011003/20110177.pdf. Special issue ber 2002. CODEN VLDBFR. ISSN VLDB best papers 2001. 1066-8888 (print), 0949-877X (elecAn:2002:EPT tronic). URL http://link.springer. de/link/service/journals/00778/ [208] Ning An, Sudhanva Gurumurthi, http: bibs/2011003/20110216.htm; Anand Sivasubramaniam, Narayanan //link.springer.de/link/service/ Vijaykrishnan, Mahmut Kandemir, journals/00778/papers/2011003/20110216. and Mary Jane Irwin. Energypdf. Special issue VLDB best papers performance trade-offs for spatial ac2001. cess methods on memory-resident Aguilera:2002:VLS data. VLDB Journal: Very Large Data Bases, 11(3):179–197, November 2002. CODEN VLDBFR. ISSN [211] Vincent Aguilera, Sophie Cluet, Tova Milo, Pierangelo Veltri, and Dan 1066-8888 (print), 0949-877X (elecVodislav. Views in a large-scale XML tronic). URL http://link.springer. repository. VLDB Journal: Very Large de/link/service/journals/00778/ Data Bases, 11(3):238–255, Novemhttp: bibs/2011003/20110179.htm; ber 2002. CODEN VLDBFR. ISSN //link.springer.de/link/service/ journals/00778/papers/2011003/20110179. 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. pdf. Special issue VLDB best papers de/link/service/journals/00778/ 2001. http: bibs/2011003/20110238.htm; Ailamaki:2002:DPL //link.springer.de/link/service/ journals/00778/papers/2011003/20110238. [209] Anastassia Ailamaki, David J. DeWitt, pdf. Special issue VLDB best papers and Mark D. Hill. Data page lay2001. outs for relational databases on deep memory hierarchies. VLDB JourHunt:2002:DIL nal: Very Large Data Bases, 11(3): 198–215, November 2002. CODEN [212] Ela Hunt, Malcolm P. Atkinson, and Robert W. Irving. Database indexing VLDBFR. ISSN 1066-8888 (print), for large DNA and protein sequence 0949-877X (electronic). URL http: collections. VLDB Journal: Very Large //link.springer.de/link/service/ REFERENCES 71 and T. Westmann. Anatomy of a Data Bases, 11(3):256–271, Novemnative XML base management sysber 2002. CODEN VLDBFR. ISSN tem. VLDB Journal: Very Large 1066-8888 (print), 0949-877X (elecData Bases, 11(4):292–314, Decemtronic). URL http://link.springer. ber 2002. CODEN VLDBFR. ISSN de/link/service/journals/00778/ 1066-8888 (print), 0949-877X (elechttp: bibs/2011003/20110256.htm; tronic). URL http://link.springer. //link.springer.de/link/service/ journals/00778/papers/2011003/20110256. de/link/service/journals/00778/ bibs/2011004/20110292.htm; pdf. Special issue VLDB best papers http: 2001. //link.springer.de/link/service/ journals/00778/papers/2011004/20110292. Halevy:2002:GE pdf. [213] Alon Y. Halevy. Guest editorial. VLDB Journal: Very Large Amer-Yahia:2002:TPQ Data Bases, 11(4):273, December 2002. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (elec- [216] S. Amer-Yahia, S. Cho, L. V. S. Lakshmanan, and D. Srivastava. Tree pattronic). URL http://link.springer. tern query minimization. VLDB Jourde/link/service/journals/00778/ nal: Very Large Data Bases, 11(4): http: bibs/2011004/20110273.htm; 315–331, December 2002. CODEN //link.springer.de/link/service/ journals/00778/papers/2011004/20110273. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: pdf. //link.springer.de/link/service/ Jagadish:2002:TNX journals/00778/bibs/2011004/20110315. htm; http://link.springer.de/ [214] H. V. Jagadish, S. Al-Khalifa, A. Chaplink/service/journals/00778/papers/ man, L. V. S. Lakshmanan, A. Nier2011004/20110315.pdf. man, S. Paparizos, J. M. Patel, D. Srivastava, N. Wiwatwattana, Y. Wu, Chien:2002:ESM and C. Yu. TIMBER: a native XML database. VLDB Journal: Very Large Data Bases, 11(4):274–291, Decem- [217] S.-Y. Chien, V. J. Tsotras, and ber 2002. CODEN VLDBFR. ISSN C. Zaniolo. Efficient schemes for 1066-8888 (print), 0949-877X (elecmanaging multiversion XML docutronic). URL http://link.springer. ments. VLDB Journal: Very Large de/link/service/journals/00778/ Data Bases, 11(4):332–353, Decemhttp: bibs/2011004/20110274.htm; ber 2002. CODEN VLDBFR. ISSN //link.springer.de/link/service/ 1066-8888 (print), 0949-877X (elecjournals/00778/papers/2011004/20110274. tronic). URL http://link.springer. pdf. de/link/service/journals/00778/ http: bibs/2011004/20110332.htm; Fiebig:2002:ANX //link.springer.de/link/service/ journals/00778/papers/2011004/20110332. [215] T. Fiebig, S. Helmer, C.-C. Kanne, pdf. G. Moerkotte, J. Neumann, R. Schiele, REFERENCES 72 Chan:2002:EFX Sheth:2003:CRK [218] C.-Y. Chan, P. Felber, M. Garofalakis, [221] A. Sheth, S. Thacker, and S. Paand R. Rastogi. Efficient filtering of tel. Complex relationships and knowlXML documents with XPath expresedge discovery support in the Infosions. VLDB Journal: Very Large Quilt system. VLDB Journal: Very Data Bases, 11(4):354–379, DecemLarge Data Bases, 12(1):2–27, May ber 2002. CODEN VLDBFR. ISSN 2003. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (elec1066-8888 (print), 0949-877X (electronic). URL http://link.springer. tronic). URL http://link.springer. de/link/service/journals/00778/ de/link/service/journals/00778/ http: bibs/2011004/20110354.htm; http: bibs/3012001/30120002.htm; //link.springer.de/link/service/ //link.springer.de/link/service/ journals/00778/papers/2011004/20110354. journals/00778/papers/3012001/30120002. pdf. pdf. Ives:2002:XQE Verykios:2003:BDM [219] Zachary G. Ives, A. Y. Halevy, [222] V. S. Verykios, G. V. Moustakides, and D. S. Weld. An XML and M. G. Elfeky. A Bayesian dequery engine for network-bound cision model for cost optimal record data. VLDB Journal: Very Large matching. VLDB Journal: Very Data Bases, 11(4):380–402, DecemLarge Data Bases, 12(1):28–40, May ber 2002. CODEN VLDBFR. ISSN 2003. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (elec1066-8888 (print), 0949-877X (electronic). URL http://link.springer. tronic). URL http://link.springer. de/link/service/journals/00778/ de/link/service/journals/00778/ http: bibs/2011004/20110380.htm; http: bibs/3012001/30120028.htm; //link.springer.de/link/service/ //link.springer.de/link/service/ journals/00778/papers/2011004/20110380. journals/00778/papers/3012001/30120028. pdf. pdf. Ozsu:2003:NPA Cui:2003:LTG [220] M. Tamer Özsu. New partner- [223] Y. Cui and J. Widom. Lineage tracing for general data warehouse transship with ACM and update on the formations. VLDB Journal: Very journal. VLDB Journal: Very Large Data Bases, 12(1):41–58, May Large Data Bases, 12(1):1, May 2003. CODEN VLDBFR. ISSN 2003. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (elec1066-8888 (print), 0949-877X (electronic). URL http://link.springer. tronic). URL http://link.springer. de/link/service/journals/00778/ de/link/service/journals/00778/ http: http: bibs/3012001/30120041.htm; bibs/3012001/30120001.htm; //link.springer.de/link/service/ //link.springer.de/link/service/ journals/00778/papers/3012001/30120001. journals/00778/papers/3012001/30120041. pdf. pdf. REFERENCES 73 Medjahed:2003:BBI Abadi:2003:ANM [224] B. Medjahed, B. Benatallah, A. Bouguet- [228] Daniel J. Abadi, Don Carney, Ugur Çetintemel, Mitch Cherniack, Christaya, A. H. H. Ngu, and A. K. Eltian Convey, Sangdon Lee, Michael magarmid. Business-to-business inStonebraker, Nesime Tatbul, and Stan teractions: issues and enabling techZdonik. Aurora: a new model and nologies. VLDB Journal: Very architecture for data stream manageLarge Data Bases, 12(1):59–85, May ment. VLDB Journal: Very Large Data 2003. CODEN VLDBFR. ISSN Bases, 12(2):120–139, August 2003. 1066-8888 (print), 0949-877X (elecCODEN VLDBFR. ISSN 1066-8888 tronic). URL http://link.springer. (electronic). (print), 0949-877X de/link/service/journals/00778/ http: bibs/3012001/30120059.htm; Chandrasekaran:2003:PSS //link.springer.de/link/service/ [229] Sirish Chandrasekaran and Michael J. journals/00778/papers/3012001/30120059. Franklin. PSoup: a system for streampdf. ing queries over streaming data. VLDB Journal: Very Large Data Bases, 12 Bernstein:2003:GE (2):140–156, August 2003. CODEN [225] Philip A. Bernstein, Yannis Ioannidis, VLDBFR. ISSN 1066-8888 (print), and Raghu Ramakrishnan. Guest ed0949-877X (electronic). itorial. VLDB Journal: Very Large Agrawal:2003:WRD Data Bases, 12(2):87–88, August 2003. CODEN VLDBFR. ISSN 1066-8888 [230] Rakesh Agrawal, Peter J. Haas, and (print), 0949-877X (electronic). Jerry Kiernan. Watermarking relational data: framework, algorithms and Ramamurthy:2003:CFM analysis. VLDB Journal: Very Large Data Bases, 12(2):157–169, August [226] Ravishankar Ramamurthy, David J. 2003. CODEN VLDBFR. ISSN 1066DeWitt, and Qi Su. A case for frac8888 (print), 0949-877X (electronic). tured mirrors. VLDB Journal: Very Large Data Bases, 12(2):89–101, AuChakrabarti:2003:FAT gust 2003. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (elec- [231] Soumen Chakrabarti, Shourya Roy, and Mahesh V. Soundalgekar. Fast and tronic). accurate text classification via multiple linear discriminant projections. VLDB Chan:2003:RTE Journal: Very Large Data Bases, 12 (2):170–185, August 2003. CODEN [227] Chee-Yong Chan, Minos Garofalakis, VLDBFR. ISSN 1066-8888 (print), and Rajeev Rastogi. RE-tree: an effi0949-877X (electronic). cient index structure for regular expressions. VLDB Journal: Very Large Data Fung:2003:CDV Bases, 12(2):102–119, August 2003. CODEN VLDBFR. ISSN 1066-8888 [232] Chi-Wai Fung, Kamalakar Karlapalem, and Qing Li. Cost-driven vertical class (print), 0949-877X (electronic). REFERENCES 74 partitioning for methods in object oriented databases. VLDB Journal: Very Large Data Bases, 12(3):187–210, October 2003. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Li:2003:CCA [233] Chen Li. Computing complete answers to queries in the presence of limited access patterns. VLDB Journal: Very Large Data Bases, 12(3):211–227, October 2003. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chua:2003:IBA [234] Cecil Eng H. Chua, Roger H. L. Chiang, and Ee-Peng Lim. Instance-based attribute identification in database integration. VLDB Journal: Very Large Data Bases, 12(3):228–243, October 2003. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Helmer:2003:PSF [235] Sven Helmer and Guido Moerkotte. A performance study of four index structures for set-valued attributes of low cardinality. VLDB Journal: Very Large Data Bases, 12(3):244–261, October 2003. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Yang:2003:ICM [236] Jun Yang and Jennifer Widom. Incremental computation and maintenance of temporal aggregates. VLDB Journal: Very Large Data Bases, 12 (3):262–283, October 2003. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Atluri:2003:GE [237] Vijay Atluri, Anupam Joshi, and Yelena Yesha. Guest editorial. VLDB Journal: Very Large Data Bases, 12 (4):285, November 2003. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Maedche:2003:MMD [238] A. Maedche, B. Motik, and L. Stojanovic. Managing multiple and distributed ontologies on the Semantic Web. VLDB Journal: Very Large Data Bases, 12(4):286–302, November 2003. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Doan:2003:LMO [239] AnHai Doan, Jayant Madhavan, Robin Dhamankar, Pedro Domingos, and Alon Halevy. Learning to match ontologies on the Semantic Web. VLDB Journal: Very Large Data Bases, 12 (4):303–319, November 2003. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Halkidi:2003:TOW [240] Maria Halkidi, Benjamin Nguyen, Iraklis Varlamis, and Michalis Vazirgiannis. THESUS: Organizing Web document collections based on link semantics. VLDB Journal: Very Large Data Bases, 12(4):320–332, November 2003. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Medjahed:2003:CWS [241] Brahim Medjahed, Athman Bouguettaya, and Ahmed K. Elmagarmid. Composing Web services on the Semantic Web. VLDB Journal: Very Large REFERENCES 75 Data Bases, 12(4):333–351, November 2003. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Fileto:2003:POW [242] Renato Fileto, Ling Liu, Calton Pu, Eduardo Delgado Assad, and Claudia Bauzer Medeiros. POESIA: an ontological workflow approach for composing Web services in agriculture. VLDB Journal: Very Large Data Bases, 12(4):352–367, November 2003. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Jensen:2004:MDM [243] Christian S. Jensen, Augustas Kligys, Torben Bach Pedersen, and Igor Timko. Multidimensional data modeling for location-based services. VLDB Journal: Very Large Data Bases, 13 (1):1–21, January 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhang:2004:PMV [244] Xin Zhang, Lingli Ding, and Elke A. Rundensteiner. Parallel multisource view maintenance. VLDB Journal: Very Large Data Bases, 13(1):22–48, January 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Hristidis:2004:AAA [245] Vagelis Hristidis and Yannis Papakonstantinou. Algorithms and applications for answering ranked queries using ranked views. VLDB Journal: Very Large Data Bases, 13(1):49–70, January 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Khan:2004:REO [246] Latifur Khan, Dennis McLeod, and Eduard Hovy. Retrieval effectiveness of an ontology-based model for information selection. VLDB Journal: Very Large Data Bases, 13(1):71–85, January 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Donderler:2004:RBS [247] Mehmet Emin Dönderler, Özgür Ulusoy, and Ugur Güdükbay. Rule-based spatiotemporal query processing for video databases. VLDB Journal: Very Large Data Bases, 13(1):86–103, January 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yu:2004:QHD [248] Cui Yu, Stéphane Bressan, Beng Chin Ooi, and Kian-Lee Tan. Querying highdimensional data in single-dimensional space. VLDB Journal: Very Large Data Bases, 13(2):105–119, May 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Dori:2004:VVS [249] Dov Dori. ViSWeb — the Visual Semantic Web: unifying human and machine knowledge representations with Object-Process Methodology. VLDB Journal: Very Large Data Bases, 13 (2):120–147, May 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Fu:2004:EHA [250] Lixin Fu and Sanguthevar Rajasekaran. Evaluating holistic aggregators effi- REFERENCES 76 ciently for very large datasets. VLDB Journal: Very Large Data Bases, 13 (2):148–161, May 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Rahal:2004:ETU [251] Amira Rahal, Qiang Zhu, and PerÅke Larson. Evolutionary techniques for updating query cost models in a dynamic multidatabase environment. VLDB Journal: Very Large Data Bases, 13(2):162–176, May 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Adi:2004:ASM [252] Asaf Adi and Opher Etzion. Amit — the situation manager. VLDB Journal: Very Large Data Bases, 13(2):177–203, May 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Freytag:2004:BPV [253] Johann-Christoph Freytag, Serge Abiteboul, and Mike Carey. Best papers of VLDB 2003. VLDB Journal: Very Large Data Bases, 13(3): 205–206, September 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Ilyas:2004:STJ [254] Ihab F. Ilyas, Walid G. Aref, and Ahmed K. Elmagarmid. Supporting top-k join queries in relational databases. VLDB Journal: Very Large Data Bases, 13(3):207–221, September 2004. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Papadimitriou:2004:AUS [255] Spiros Papadimitriou, Anthony Brockwell, and Christos Faloutsos. Adaptive, unsupervised stream mining. VLDB Journal: Very Large Data Bases, 13 (3):222–239, September 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Labrinidis:2004:ETB [256] Alexandros Labrinidis and Nick Roussopoulos. Exploring the tradeoff between performance and data freshness in database-driven Web servers. VLDB Journal: Very Large Data Bases, 13 (3):240–255, September 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). He:2004:AIW [257] Hai He, Weiyi Meng, Clement Yu, and Zonghuan Wu. Automatic integration of Web search interfaces with WISEintegrator. VLDB Journal: Very Large Data Bases, 13(3):256–273, September 2004. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Velegrakis:2004:PMC [258] Yannis Velegrakis, René J. Miller, and Lucian Popa. Preserving mapping consistency under schema changes. VLDB Journal: Very Large Data Bases, 13 (3):274–293, September 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Florescu:2004:BSX [259] Daniela Florescu, Chris Hillery, Donald Kossmann, Paul Lucas, Fabio Riccardi, Till Westmann, J. Carey, and Arvind Sundararajan. The BEA streaming REFERENCES 77 XQuery processor. VLDB Journal: Very Large Data Bases, 13(3):294–315, September 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Gehrke:2004:GES [260] Johannes Gehrke and M. Hellerstein. Guest Editorial to the special issue on data stream processing. VLDB Journal: Very Large Data Bases, 13 (4):317, December 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yang:2004:FHQ [261] Huai Yang, Li Lee, and Wynne Hsu. Finding hot query patterns over an XQuery stream. VLDB Journal: Very Large Data Bases, 13(4):318–332, December 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Babcock:2004:OSD [262] Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev Motwani, and Dilys Thomas. Operator scheduling in data stream systems. VLDB Journal: Very Large Data Bases, 13(4):333–353, December 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Ganguly:2004:TSE [263] Sumit Ganguly, Minos Garofalakis, and Rajeev Rastogi. Tracking setexpression cardinalities over continuous update streams. VLDB Journal: Very Large Data Bases, 13(4): 354–369, December 2004. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Balakrishnan:2004:RA [264] Hari Balakrishnan, Magdalena Balazinska, Don Carney, Uḡur Çetintemel, Mitch Cherniack, Christian Convey, Eddie Galvez, Jon Salz, Michael Stonebraker, Nesime Tatbul, Richard Tibbetts, and Stan Zdonik. Retrospective on Aurora. VLDB Journal: Very Large Data Bases, 13(4):370–383, December 2004. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Sharaf:2004:BEE [265] A. Sharaf, Jonathan Beaver, Alexandros Labrinidis, and K. Chrysanthis. Balancing energy efficiency and quality of aggregate data in sensor networks. VLDB Journal: Very Large Data Bases, 13(4):384–403, December 2004. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Ozsu:2005:E [266] Tamer Özsu. Editorial. VLDB Journal: Very Large Data Bases, 14(1):1, March 2005. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Gao:2005:JOT [267] Dengfeng Gao, S. Jensen, T. Snodgrass, and D. Soo. Join operations in temporal databases. VLDB Journal: Very Large Data Bases, 14(1):2–29, March 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Balmin:2005:SQX [268] Andrey Balmin and Yannis Papakonstantinou. Storing and querying XML data using denormalized relational databases. VLDB Journal: Very REFERENCES 78 Large Data Bases, 14(1):30–49, March 2005. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Gal:2005:FME [269] Avigdor Gal, Ateret Anaby-Tavor, Alberto Trombetta, and Danilo Montesi. A framework for modeling and evaluating automatic semantic reconciliation. VLDB Journal: Very Large Data Bases, 14(1):50–67, March 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Halevy:2005:SML [270] Y. Halevy, G. Ives, Dan Suciu, and Igor Tatarinov. Schema mediation for largescale semantic data sharing. VLDB Journal: Very Large Data Bases, 14 (1):68–83, March 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Benatallah:2005:AWS [271] Boualem Benatallah, Mohand-Said Hacid, Alain Leger, Christophe Rey, and Farouk Toumani. On automating Web services discovery. VLDB Journal: Very Large Data Bases, 14(1):84–96, March 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Sattler:2005:CBQ [272] Kai-Uwe Sattler, Ingolf Geist, and Eike Schallehn. Concept-based querying in mediator systems. VLDB Journal: Very Large Data Bases, 14(1):97–111, March 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Tzitzikas:2005:MTB [273] Yannis Tzitzikas, Nicolas Spyratos, and Panos Constantopoulos. Mediators over taxonomy-based information sources. VLDB Journal: Very Large Data Bases, 14(1):112–136, March 2005. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Gunopulos:2005:SEM [274] Dimitrios Gunopulos, George Kollios, J. Tsotras, and Carlotta Domeniconi. Selectivity estimators for multidimensional range queries over real attributes. VLDB Journal: Very Large Data Bases, 14(2):137–154, April 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Alhajj:2005:VFC [275] Reda Alhajj, Faruk Polat, and Cem Yı́lmaz. Views as first-class citizens in object-oriented databases. VLDB Journal: Very Large Data Bases, 14 (2):155–169, April 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhang:2005:OSM [276] Donghui Zhang and J. Tsotras. Optimizing spatial Min/Max aggregations. VLDB Journal: Very Large Data Bases, 14(2):170–181, April 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Perich:2005:CJP [277] Filip Perich, Anupam Joshi, Yelena Yesha, and Tim Finin. Collaborative joins in a pervasive computing environment. VLDB Journal: Very Large Data Bases, 14(2):182–196, April 2005. REFERENCES 79 CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Josifovski:2005:QXS [278] Vanja Josifovski, Marcus Fontoura, and Attila Barta. Querying XML streams. VLDB Journal: Very Large Data Bases, 14(2):197–210, April 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Aggarwal:2005:EEA [279] C. Aggarwal and S. Yu. An effective and efficient algorithm for highdimensional outlier detection. VLDB Journal: Very Large Data Bases, 14 (2):211–221, April 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yao:2005:HBL [280] D. Yao, Cyrus Shahabi, and Per-Åke Larson. Hash-based labeling techniques for storage scaling. VLDB Journal: Very Large Data Bases, 14(2):222–237, April 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Kollios:2005:IMO [281] George Kollios, Dimitris Papadopoulos, Dimitrios Gunopulos, and J. Tsotras. Indexing mobile objects using dual transformations. VLDB Journal: Very Large Data Bases, 14(2):238–256, April 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Jaluta:2005:CCR [282] Ibrahim Jaluta, Seppo Sippu, and Eljas Soisalon-Soininen. Concurrency control and recovery for balanced B-link trees. VLDB Journal: Very Large Data Bases, 14(2):257–277, April 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Gaasterland:2005:SID [283] Terry Gaasterland, H. V. Jagadish, and Louiqa Raschid. Special issue on data management, analysis, and mining for the life sciences. VLDB Journal: Very Large Data Bases, 14(3): 279–280, September 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //www.springerlink.com/openurl. asp?genre=article&issn=0938-1287& volume=14&issue=3&spage=279. Tian:2005:PMC [284] Yuanyuan Tian, Sandeep Tata, Richard A. Hankins, and Jignesh M. Patel. Practical methods for constructing suffix trees. VLDB Journal: Very Large Data Bases, 14(3):281– 299, September 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //www.springerlink.com/openurl. asp?genre=article&issn=0938-1287& volume=14&issue=3&spage=281. Claypool:2005:SYD [285] Kajal T. Claypool and Elke A. Rundensteiner. Sync your data: update propagation for heterogeneous protein databases. VLDB Journal: Very Large Data Bases, 14(3): 300–317, September 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //www.springerlink.com/openurl. asp?genre=article&issn=0938-1287& volume=14&issue=3&spage=300. REFERENCES 80 Conery:2005:RBW Large Data Bases, 15(1):21–39, January 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [286] John S. Conery, Julian M. Catchen, and Michael Lynch. Rule-based workflow management for bioinformatics. VLDB Journal: Very Tamir:2006:CGM Large Data Bases, 14(3):318–329, September 2005. CODEN VLDBFR. [290] Raz Tamir and Yehuda Singer. On ISSN 1066-8888 (print), 0949-877X a confidence gain measure for associa(electronic). URL http://www. tion rule discovery and scoring. VLDB springerlink.com/openurl.asp?genre= Journal: Very Large Data Bases, 15 article&issn=0938-1287&volume=14& (1):40–52, January 2006. CODEN issue=3&spage=318. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Thakkar:2005:COE [287] Snehal Thakkar, José Luis Ambite, and Craig A. Knoblock. Composing, optimizing, and executing plans for bioinformatics web services. VLDB Journal: Very Large Data Bases, 14(3): 330–353, September 2005. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //www.springerlink.com/openurl. asp?genre=article&issn=0938-1287& volume=14&issue=3&spage=330. Vlachos:2006:IMT [288] Michail Vlachos, Marios Hadjieleftheriou, Dimitrios Gunopulos, and Eamonn Keogh. Indexing Multidimensional Time-Series. VLDB Journal: Very Large Data Bases, 15(1):1–20, January 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zheng:2006:GPI [289] Baihua Zheng, Jianliang Xu, WangChien Lee, and Lun Lee. Grid-partition index: a hybrid method for nearestneighbor queries in wireless locationbased services. VLDB Journal: Very Bremer:2006:IDD [291] Jan-Marco Bremer and Michael Gertz. Integrating document and data retrieval based on XML. VLDB Journal: Very Large Data Bases, 15(1):53– 83, January 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Ogras:2006:OSD [292] Y. Ogras and Hakan Ferhatosmanoglu. Online summarization of dynamic time series data. VLDB Journal: Very Large Data Bases, 15(1):84–98, January 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Goh:2006:DBM [293] Leng Goh, Yanfeng Shu, Zhiyong Huang, and Chin Ooi. Dynamic buffer management with extensible replacement policies. VLDB Journal: Very Large Data Bases, 15(2):99–120, June 2006. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). REFERENCES 81 Arasu:2006:CCQ [294] Arvind Arasu, Shivnath Babu, and Jennifer Widom. The CQL continuous query language: semantic foundations and query execution. VLDB Journal: Very Large Data Bases, 15(2):121–142, June 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Hadjieleftheriou:2006:ISA [295] Marios Hadjieleftheriou, George Kollios, J. Tsotras, and Dimitrios Gunopulos. Indexing spatiotemporal archives. VLDB Journal: Very Large Data Bases, 15(2):143–164, June 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Guting:2006:MQM [296] Hartmut Güting, Teixeira de Almeida, and Zhiming Ding. Modeling and querying moving objects in networks. VLDB Journal: Very Large Data Bases, 15(2):165–190, June 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chirkova:1999:AQU [297] Rada Chirkova, Chen Li, and Jia Li. Answering queries using materialized views with minimum size. VLDB Journal: Very Large Data Bases, 15 (3):191–210, April 1999. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Cao:1999:STD [298] Hu Cao, Ouri Wolfson, and Goce Trajcevski. Spatio-temporal data reduction with deterministic error bounds. VLDB Journal: Very Large Data Bases, 15(3):211–228, April 1999. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Benetis:1999:NRN [299] Rimantas Benetis, S. Jensen, Gytis Karçiauskas, and Simonas S̊altenis. Nearest and reverse nearest neighbor queries for moving objects. VLDB Journal: Very Large Data Bases, 15 (3):229–249, April 1999. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Pelleg:1999:DTS [300] Dan Pelleg and Andrew Moore. Dependency trees in sub-linear time and bounded memory. VLDB Journal: Very Large Data Bases, 15(3):250–262, April 1999. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Che:1999:QOX [301] Dunren Che, Karl Aberer, and Tamer Özsu. Query optimization in XML structured-document databases. VLDB Journal: Very Large Data Bases, 15(3):263–289, April 1999. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Ferrari:2006:GES [302] Elena Ferrari and Bhavani Thuraisingham. Guest editorial: special issue on privacy preserving data management. VLDB Journal: Very Large Data Bases, 15(4):291–292, November 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 82 Mukherjee:2006:PPT [303] Shibnath Mukherjee, Zhiyuan Chen, and Aryya Gangopadhyay. A privacypreserving technique for Euclidean distance-based mining algorithms using Fourier-related transforms. VLDB Journal: Very Large Data Bases, 15 (4):293–315, November 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Jiang:2006:SDF [304] Wei Jiang and Chris Clifton. A secure distributed framework for achieving kanonymity. VLDB Journal: Very Large Data Bases, 15(4):316–333, November 2006. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Blanton:2006:SRF [305] Marina Blanton and Mikhail Atallah. Succinct representation of flexible and privacy-preserving access rights. VLDB Journal: Very Large Data Bases, 15 (4):334–354, November 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Journal: Very Large Data Bases, 15 (4):370–387, November 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Xiong:2006:PLM [308] Hui Xiong, Michael Steinbach, and Vipin Kumar. Privacy leakage in multirelational databases: a semi-supervised learning perspective. VLDB Journal: Very Large Data Bases, 15(4): 388–402, November 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Haas:2006:SIB [309] Laura M. Haas, Christian S. Jensen, and Martin L. Kersten. Special issue: best papers of VLDB 2005. VLDB Journal: Very Large Data Bases, 16(1): 1–3, October 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Godfrey:2006:AAM [310] Parke Godfrey, Ryan Shipley, and Jarek Gryz. Algorithms and anal[306] Josep Domingo-Ferrer, Antoni Martı́nezyses for maximal vector computaBallesté, Josep Maria Mateo-Sanz, and tion. VLDB Journal: Very Large Francesc Sebé. Efficient multivariate Data Bases, 16(1):5–28, October 2006. data-oriented microaggregation. VLDB CODEN VLDBFR. ISSN 1066-8888 Journal: Very Large Data Bases, 15 (print), 0949-877X (electronic). (4):355–369, November 2006. CODEN Larson:2006:VMO VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [311] Per-Åke Larson and Jingren Zhou. Massacci:2006:HHD View matching for outer-join views. [307] Fabio Massacci, John Mylopoulos, and VLDB Journal: Very Large Data Nicola Zannone. Hierarchical HippoBases, 16(1):29–53, October 2006. COcratic databases with minimal discloDEN VLDBFR. ISSN 1066-8888 sure for virtual organizations. VLDB (print), 0949-877X (electronic). Domingo-Ferrer:2006:EMD REFERENCES 83 Markl:2006:CSE Haftmann:2006:FER [312] V. Markl, P. J. Haas, M. Kutsch, N. Megiddo, U. Srivastava, and T. M. Tran. Consistent selectivity estimation via maximum entropy. VLDB Journal: Very Large Data Bases, 16 (1):55–76, October 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [316] Florian Haftmann, Donald Kossmann, and Eric Lo. A framework for efficient regression tests on database applications. VLDB Journal: Very Large Data Bases, 16(1):145–164, October 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Ghoting:2006:CCF [317] Laura M. Haas, Christian S. Jensen, and Martin L. Kersten. Special issue: best papers of VLDB 2005. VLDB Journal: Very Large Data Bases, 16(1): 1–3, January 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [313] Amol Ghoting, Gregory Buehrer, Srinivasan Parthasarathy, Daehyun Kim, Anthony Nguyen, Yen-Kuang Chen, and Pradeep Dubey. Cache-conscious frequent pattern mining on modern and emerging processors. VLDB Journal: Very Large Data Bases, 16(1):77– 96, October 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lee:2006:ETS [314] Yoonkyong Lee, Mayssam Sayyadian, AnHai Doan, and Arnon S. Rosenthal. eTuner: tuning schema matching software using synthetic scenarios. VLDB Journal: Very Large Data Bases, 16 (1):97–122, October 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Burdick:2006:OUI [315] Doug Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, and Shivakumar Vaithyanathan. OLAP over uncertain and imprecise data. VLDB Journal: Very Large Data Bases, 16(1):123–144, October 2006. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Haas:2007:SIB Godfrey:2007:AAM [318] Parke Godfrey, Ryan Shipley, and Jarek Gryz. Algorithms and analyses for maximal vector computation. VLDB Journal: Very Large Data Bases, 16(1):5–28, January 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Larson:2007:VMO [319] Per-Åke Larson and Jingren Zhou. View matching for outer-join views. VLDB Journal: Very Large Data Bases, 16(1):29–53, January 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Markl:2007:CSE [320] V. Markl, P. J. Haas, M. Kutsch, N. Megiddo, U. Srivastava, and T. M. Tran. Consistent selectivity estimation via maximum entropy. VLDB Journal: Very Large Data Bases, 16 (1):55–76, January 2007. CODEN REFERENCES 84 VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Ghoting:2007:CCF [321] Amol Ghoting, Gregory Buehrer, Srinivasan Parthasarathy, Daehyun Kim, Anthony Nguyen, Yen-Kuang Chen, and Pradeep Dubey. Cache-conscious frequent pattern mining on modern and emerging processors. VLDB Journal: Very Large Data Bases, 16(1):77– 96, January 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lee:2007:ETS [322] Yoonkyong Lee, Mayssam Sayyadian, AnHai Doan, and Arnon S. Rosenthal. eTuner: tuning schema matching software using synthetic scenarios. VLDB Journal: Very Large Data Bases, 16 (1):97–122, January 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Burdick:2007:OUI [323] Doug Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, and Shivakumar Vaithyanathan. OLAP over uncertain and imprecise data. VLDB Journal: Very Large Data Bases, 16(1):123–144, January 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Haftmann:2007:FER [324] Florian Haftmann, Donald Kossmann, and Eric Lo. A framework for efficient regression tests on database applications. VLDB Journal: Very Large Data Bases, 16(1):145–164, January 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Tanin:2007:UDQ [325] Egemen Tanin, Aaron Harwood, and Hanan Samet. Using a distributed quadtree index in peer-to-peer networks. VLDB Journal: Very Large Data Bases, 16(2):165–178, April 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Viqueira:2007:SES [326] Jose R. Rios Viqueira and Nikos A. Lorentzos. SQL extension for spatiotemporal data. VLDB Journal: Very Large Data Bases, 16(2):179–200, April 2007. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Dai:2007:CDC [327] Bi-Ru Dai, Cheng-Ru Lin, and MingSyan Chen. Constrained data clustering by depth control and progressive constraint relaxation. VLDB Journal: Very Large Data Bases, 16(2):201–217, April 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Shen:2007:ADD [328] Heng Tao Shen, Xiaofang Zhou, and Aoying Zhou. An adaptive and dynamic dimensionality reduction method for high-dimensional indexing. VLDB Journal: Very Large Data Bases, 16(2):219–234, April 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). He:2007:PCC [329] Zhen He and Alonso Marquez. Path and cache conscious prefetching (PCCP). VLDB Journal: Very Large Data Bases, 16(2):235–249, April 2007. REFERENCES 85 CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yu:2007:MBS [330] Hailing Yu, Divyakant Agrawal, and Amr El Abbadi. MEMS based storage architecture for relational databases. VLDB Journal: Very Large Data Bases, 16(2):251–268, April 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yiannis:2007:CTF [331] John Yiannis and Justin Zobel. Compression techniques for fast external sorting. VLDB Journal: Very Large Data Bases, 16(2):269–291, April 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Content-Addressable Networks. VLDB Journal: Very Large Data Bases, 16 (4):463–482, October 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Traina:2007:OFA [335] Caetano Traina, Jr., Roberto F. Filho, Agma J. Traina, Marcos R. Vieira, and Christos Faloutsos. The Omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient. VLDB Journal: Very Large Data Bases, 16 (4):483–505, October 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Khan:2007:NID Jermaine:2007:PEF [336] Latifur Khan, Mamoun Awad, and Bhavani Thuraisingham. A new in[332] Christopher Jermaine, Edward Omiecintrusion detection system using support ski, and Wai Gen Yee. The partitioned vector machines and hierarchical clusexponential file for database storage tering. VLDB Journal: Very Large management. VLDB Journal: Very Data Bases, 16(4):507–521, October Large Data Bases, 16(4):417–437, Oc2007. CODEN VLDBFR. ISSN 1066tober 2007. CODEN VLDBFR. ISSN 8888 (print), 0949-877X (electronic). 1066-8888 (print), 0949-877X (electronic). Dalvi:2007:EQE Deligiannakis:2007:DCH [333] Antonios Deligiannakis, Yannis Kotidis, and Nick Roussopoulos. Dissemination of compressed historical information in sensor networks. VLDB Journal: Very Large Data Bases, 16 (4):439–461, October 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Bohm:2007:FRA [334] Klemens Böhm and Erik Buchmann. Free riding-aware forwarding in [337] Nilesh Dalvi and Dan Suciu. Efficient query evaluation on probabilistic databases. VLDB Journal: Very Large Data Bases, 16(4):523–544, October 2007. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Croft:2008:ISI [338] W. Bruce Croft and Hans-J. Schek. Introduction to the special issue on database and information retrieval integration. VLDB Journal: Very Large Data Bases, 17(1):1–3, January 2008. REFERENCES 86 CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Roelleke:2008:MRM [339] Thomas Roelleke, Hengzhi Wu, Jun Wang, and Hany Azzam. Modelling retrieval models in a probabilistic relational algebra with a new operator: the relational Bayes. VLDB Journal: Very Large Data Bases, 17(1):5–37, January 2008. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Schmitt:2008:QDQ [340] Ingo Schmitt. QQL: A DB&IR Query Language. VLDB Journal: Very Large Data Bases, 17(1):39–56, January 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lau:2008:MRM [341] Ho Lam Lau and Wilfred Ng. A multiranker model for adaptive XML searching. VLDB Journal: Very Large Data Bases, 17(1):57–80, January 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Theobald:2008:TEV [342] Martin Theobald, Holger Bast, Debapriyo Majumdar, Ralf Schenkel, and Gerhard Weikum. TopX: efficient and versatile top-k query processing for semistructured data. VLDB Journal: Very Large Data Bases, 17(1):81–115, January 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Simitsis:2008:PUK [343] Alkis Simitsis, Georgia Koutrika, and Yannis Ioannidis. Précis: from unstruc- tured keywords as queries to structured databases as answers. VLDB Journal: Very Large Data Bases, 17 (1):117–149, January 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Cornacchia:2008:FEI [344] Roberto Cornacchia, Sándor Héman, Marcin Zukowski, Arjen P. Vries, and Peter Boncz. Flexible and efficient IR using array databases. VLDB Journal: Very Large Data Bases, 17 (1):151–168, January 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lockemann:2008:MKR [345] Peter C. Lockemann. In memoriam Klaus R. Dittrich (1950—2007). VLDB Journal: Very Large Data Bases, 17 (2):169–170, March 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Alonso:2008:GEM [346] Gustavo Alonso, David Lomet, and Umesh Dayal. Guest Editors’ message. VLDB Journal: Very Large Data Bases, 17(2):171–172, March 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Gemulla:2008:MBS [347] Rainer Gemulla, Wolfgang Lehner, and Peter J. Haas. Maintaining bounded-size sample synopses of evolving datasets. VLDB Journal: Very Large Data Bases, 17(2):173–201, March 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 87 Yu:2008:XSR [348] Cong Yu and H. V. Jagadish. XML schema refinement through redundancy detection and normalization. VLDB Journal: Very Large Data Bases, 17 (2):203–223, March 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Mitra:2008:TKS [349] Soumyadeb Mitra, Marianne Winslett, Windsor W. Hsu, and Kevin ChenChuan Chang. Trustworthy keyword search for compliance storage. VLDB Journal: Very Large Data Bases, 17 (2):225–242, March 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Benjelloun:2008:DUL [350] Omar Benjelloun, Anish Das Sarma, Alon Halevy, Martin Theobald, and Jennifer Widom. Databases with uncertainty and lineage. VLDB Journal: Very Large Data Bases, 17(2):243–264, March 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Jeffery:2008:ARM [351] Shawn R. Jeffery, Michael J. Franklin, and Minos Garofalakis. An adaptive RFID middleware for supporting metaphysical data independence. VLDB Journal: Very Large Data Bases, 17 (2):265–289, March 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Parreira:2008:JAP [352] Josiane Xavier Parreira, Carlos Castillo, Debora Donato, Sebastian Michel, and Gerhard Weikum. The Juxtaposed approximate PageRank method for robust PageRank approximation in a peer-to-peer web search network. VLDB Journal: Very Large Data Bases, 17(2):291–313, March 2008. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Narayanan:2008:DAQ [353] Dushyanth Narayanan, Austin Donnelly, Richard Mortier, and Antony Rowstron. Delay aware querying with Seaweed. VLDB Journal: Very Large Data Bases, 17(2):315–331, March 2008. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Bernstein:2008:IMC [354] Philip A. Bernstein, Todd J. Green, Sergey Melnik, and Alan Nash. Implementing mapping composition. VLDB Journal: Very Large Data Bases, 17 (2):333–353, March 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Li:2008:ESF [355] Yunyao Li, Cong Yu, and H. V. Jagadish. Enabling Schema-Free XQuery with meaningful query focus. VLDB Journal: Very Large Data Bases, 17 (3):355–377, May 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yiu:2008:BTI [356] Man Lung Yiu, Yufei Tao, and Nikos Mamoulis. The Bdual-Tree: indexing moving objects by space filling curves in the dual space. VLDB Journal: Very Large Data Bases, 17(3):379–400, May REFERENCES 88 2008. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Awad:2008:PWS [357] Mamoun Awad, Latifur Khan, and Bhavani Thuraisingham. Predicting WWW surfing using multiple evidence combination. VLDB Journal: Very Large Data Bases, 17(3):401–417, May 2008. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Wang:2008:HBM [358] Hai Wang and Kenneth C. Sevcik. Histograms based on the minimum description length principle. VLDB Journal: Very Large Data Bases, 17(3):419– 442, May 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). keywords and functions. VLDB Journal: Very Large Data Bases, 17(3):489– 513, May 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wang:2008:EAM [362] Yida Wang, Ee-Peng Lim, and San-Yih Hwang. Efficient algorithms for mining maximal valid groups. VLDB Journal: Very Large Data Bases, 17(3):515–535, May 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yu:2008:DMW [363] Qi Yu, Xumin Liu, Athman Bouguettaya, and Brahim Medjahed. Deploying and managing Web services: issues, solutions, and directions. VLDB Journal: Deligiannakis:2008:BCQ Very Large Data Bases, 17(3):537–572, May 2008. CODEN VLDBFR. ISSN [359] Antonios Deligiannakis, Yannis Ko1066-8888 (print), 0949-877X (electidis, and Nick Roussopoulos. Bandwidthtronic). constrained queries in sensor networks. VLDB Journal: Very Large Li:2008:EUD Data Bases, 17(3):443–467, May 2008. CODEN VLDBFR. ISSN 1066-8888 [364] Changqing Li, Tok Wang Ling, and Min Hu. Efficient updates in dynamic (print), 0949-877X (electronic). XML data: from binary string to quaHammad:2008:QPM ternary string. VLDB Journal: Very Large Data Bases, 17(3):573–601, May [360] Moustafa A. Hammad, Walid G. Aref, 2008. CODEN VLDBFR. ISSN 1066and Ahmed K. Elmagarmid. Query 8888 (print), 0949-877X (electronic). processing of multi-way stream window joins. VLDB Journal: Very Large Data Bases, 17(3):469–488, May 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Luo:2008:FBP [361] Qiong Luo, Jeffrey F. Naughton, and Wenwei Xue. Form-based proxy caching for database-backed web sites: Tao:2007:MRK [365] Yufei Tao, Dimitris Papadias, Xiang Lian, and Xiaokui Xiao. Multidimensional reverse kNN search. VLDB Journal: Very Large Data Bases, 16(3):293– 316, July 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 89 Koch:2007:AGS CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [366] Christoph Koch and Stefanie Scherzinger. Karayannidis:2008:HCO Attribute grammars for scalable query processing on XML streams. VLDB [371] Nikos Karayannidis and Timos Sellis. Journal: Very Large Data Bases, 16 Hierarchical clustering for OLAP: the (3):317–342, July 2007. CODEN CUBE File approach. VLDB Journal: VLDBFR. ISSN 1066-8888 (print), Very Large Data Bases, 17(4):621–655, 0949-877X (electronic). July 2008. CODEN VLDBFR. ISSN Chan:2007:OES [367] Edward P. Chan and Heechul Lim. Optimization and evaluation of shortest path queries. VLDB Journal: Very Large Data Bases, 16(3):343–369, July 2007. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Lee:2007:DPI [368] Jae-Gil Lee, Kyu-Young Whang, Wook-Shin Han, and Il-Yeol Song. The dynamic predicate: integrating access control with query processing in XML databases. VLDB Journal: Very Large Data Bases, 16(3):371–387, July 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Papazoglou:2007:SOA [369] Mike P. Papazoglou and Willem-Jan Heuvel. Service oriented architectures: approaches, technologies and research issues. VLDB Journal: Very Large Data Bases, 16(3):389–415, July 2007. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Byun:2008:PBA [370] Ji-Won Byun and Ninghui Li. Purpose based access control for privacy protection in relational database systems. VLDB Journal: Very Large Data Bases, 17(4):603–619, July 2008. 1066-8888 (print), 0949-877X (electronic). Plattner:2008:EDS [372] Christian Plattner, Gustavo Alonso, and M. Tamer Özsu. Extending DBMSs with satellite databases. VLDB Journal: Very Large Data Bases, 17(4):657–682, July 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Hsieh:2008:DEF [373] Ming-Jyh Hsieh, Wei-Guang Teng, Ming-Syan Chen, and Philip S. Yu. DAWN: an efficient framework of DCT for data with error estimation. VLDB Journal: Very Large Data Bases, 17 (4):683–702, July 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Atzori:2008:APP [374] Maurizio Atzori, Francesco Bonchi, Fosca Giannotti, and Dino Pedreschi. Anonymity preserving pattern discovery. VLDB Journal: Very Large Data Bases, 17(4):703–727, July 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Morfonios:2008:SDC [375] Konstantinos Morfonios and Yannis Ioannidis. Supporting the data cube REFERENCES 90 lifecycle: the power of ROLAP. VLDB Journal: Very Large Data Bases, 17 (4):729–764, July 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Sharifzadeh:2008:OSR [376] Mehdi Sharifzadeh, Mohammad Kolahdouzan, and Cyrus Shahabi. The optimal sequenced route query. VLDB Journal: Very Large Data Bases, 17 (4):765–787, July 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Friedman:2008:PAD [377] Arik Friedman, Ran Wolff, and Assaf Schuster. Providing k-anonymity in data mining. VLDB Journal: Very Large Data Bases, 17(4):789–804, July 2008. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Harder:2008:VCC [378] Theo Härder and Andreas Bühmann. Value complete, column complete, predicate complete. VLDB Journal: Very Large Data Bases, 17(4):805–826, July 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Ou:2008:EAI [379] Jian-Chih Ou, Chang-Hung Lee, and Ming-Syan Chen. Efficient algorithms for incremental Web log mining with dynamic thresholds. VLDB Journal: Very Large Data Bases, 17(4):827–845, July 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Alagic:2008:GJP [380] Suad Alagić and Mark Royer. Genericity in Java: persistent and database systems implications. VLDB Journal: Very Large Data Bases, 17(4):847–878, July 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Vaidya:2008:PPN [381] Jaideep Vaidya, Murat Kantarcıoğlu, and Chris Clifton. Privacy-preserving Naı̈ve Bayes classification. VLDB Journal: Very Large Data Bases, 17(4):879– 898, July 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Fu:2008:STW [382] Ada Wai-Chee Fu, Eamonn Keogh, Leo Yung Lau, Chotirat Ann Ratanamahatana, and Raymond Chi-Wing Wong. Scaling and time warping in time series querying. VLDB Journal: Very Large Data Bases, 17(4):899–921, July 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Mouratidis:2008:TBP [383] Kyriakos Mouratidis, Dimitris Papadias, and Spiros Papadimitriou. Treebased partition querying: a methodology for computing medoids in large spatial datasets. VLDB Journal: Very Large Data Bases, 17(4):923–945, July 2008. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Yu:2008:DMP [384] Jeffrey Xu Yu, Zhiheng Li, and Guimei Liu. A data mining proxy approach for efficient frequent itemset REFERENCES 91 mining. VLDB Journal: Very Large Data Bases, 17(4):947–970, July 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Mokbel:2008:SSL [385] Mohamed F. Mokbel and Walid G. Aref. SOLE: scalable on-line execution of continuous queries on spatiotemporal data streams. VLDB Journal: Very Large Data Bases, 17(5):971–995, August 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Pol:2008:MVL [386] Abhijit Pol, Christopher Jermaine, and Subramanian Arumugam. Maintaining very large random samples using the geometric file. VLDB Journal: Very Large Data Bases, 17(5):997–1018, August 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Abiteboul:2008:AXP [387] Serge Abiteboul, Omar Benjelloun, and Tova Milo. The Active XML project: an overview. VLDB Journal: Very Large Data Bases, 17(5):1019–1040, August 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Buccafurri:2008:EHT [388] Francesco Buccafurri, Gianluca Lax, Domenico Saccà, Luigi Pontieri, and Domenico Rosaci. Enhancing histograms by tree-like bucket indices. VLDB Journal: Very Large Data Bases, 17(5):1041–1061, August 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Kamra:2008:DAA [389] Ashish Kamra, Evimaria Terzi, and Elisa Bertino. Detecting anomalous access patterns in relational databases. VLDB Journal: Very Large Data Bases, 17(5):1063–1077, August 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Guha:2008:WSH [390] Sudipto Guha, Hyoungmin Park, and Kyuseok Shim. Wavelet synopsis for hierarchical range queries with workloads. VLDB Journal: Very Large Data Bases, 17(5):1079–1099, August 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Deng:2008:MRS [391] Ke Deng, Xiaofang Zhou, Heng Tao Shen, Qing Liu, Kai Xu, and Xuemin Lin. A multi-resolution surface distance model for k-NN query processing. VLDB Journal: Very Large Data Bases, 17(5):1101–1119, August 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chuang:2008:PLR [392] Kun-Ta Chuang, Jiun-Long Huang, and Ming-Syan Chen. Power-law relationship and self-similarity in the itemset support distribution: analysis and applications. VLDB Journal: Very Large Data Bases, 17(5): 1121–1141, August 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Padmanabhan:2008:SDR [393] Prasanna Padmanabhan, Le Gruenwald, Anita Vallur, and Mohammed REFERENCES 92 Atiquzzaman. A survey of data replication techniques for mobile ad hoc network databases. VLDB Journal: Very Large Data Bases, 17(5):1143–1164, August 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhong:2008:GPT [394] Sheng Zhong and Zhiqiang Yang. Guided perturbation: towards private and accurate mining. VLDB Journal: Very Large Data Bases, 17(5): 1165–1177, August 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Rizzolo:2008:TXM [395] Flavio Rizzolo and Alejandro A. Vaisman. Temporal XML: modeling, indexing, and query processing. VLDB Journal: Very Large Data Bases, 17 (5):1179–1212, August 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Jin:2008:SES [396] Liang Jin, Chen Li, and Rares Vernica. SEPIA: estimating selectivities of approximate string predicates in large databases. VLDB Journal: Very Large Data Bases, 17(5):1213–1229, August 2008. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). 2008. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Tao:2008:PDW [398] Yufei Tao and Xiaokui Xiao. Primal or dual: which promises faster spatiotemporal search? VLDB Journal: Very Large Data Bases, 17(5): 1253–1270, August 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Tao:2008:ETC [399] Yufei Tao and Xiaokui Xiao. Efficient temporal counting with bounded error. VLDB Journal: Very Large Data Bases, 17(5):1271–1292, August 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Islam:2008:ACB [400] Aminul Islam, Diana Inkpen, and Iluju Kiringa. Applications of corpusbased semantic similarity and word segmentation to database schema matching. VLDB Journal: Very Large Data Bases, 17(5):1293–1320, August 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chuang:2008:MTK [401] Kun-Ta Chuang, Jiun-Long Huang, and Ming-Syan Chen. Mining top-k frequent patterns in the presence of the memory constraint. VLDB Journal: Very Large Data Bases, 17(5): Venkateswaran:2008:RBI 1321–1344, August 2008. CODEN VLDBFR. ISSN 1066-8888 (print), [397] Jayendra Venkateswaran, Tamer Kahveci, (electronic). 0949-877X Christopher Jermaine, and Deepak Lachwani. Reference-based indexing Catarci:2008:GES for metric spaces with costly distance measures. VLDB Journal: Very Large [402] Tiziana Catarci and René J. Miller. Guest editorial: special issue on metaData Bases, 17(5):1231–1251, August REFERENCES 93 data management. VLDB Journal: Very Large Data Bases, 17(6): 1345–1346, November 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). ing integration of metadata. VLDB Journal: Very Large Data Bases, 17(6): 1407–1444, November 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Atzeni:2008:MIS Wang:2008:AXB [403] Paolo Atzeni, Paolo Cappellari, Riccardo Torlone, Philip A. Bernstein, and Giorgio Gianforme. Modelindependent schema translation. VLDB Journal: Very Large Data Bases, 17(6): 1347–1370, November 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [407] Fusheng Wang, Carlo Zaniolo, and Xin Zhou. ArchIS: an XML-based approach to transaction-time temporal database systems. VLDB Journal: Very Large Data Bases, 17(6): 1445–1463, November 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Cudre-Mauroux:2008:PMM Zhou:2008:DSD [404] Philippe Cudré-Mauroux, Adriana Budura, Manfred Hauswirth, and Karl Aberer. PicShark: mitigating metadata scarcity through large-scale P2P collaboration. VLDB Journal: Very Large Data Bases, 17(6):1371–1384, November 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [408] Yongluan Zhou, Beng Chin Ooi, and Kian-Lee Tan. Disseminating streaming data in a dynamic environment: an adaptive and cost-based approach. VLDB Journal: Very Large Data Bases, 17(6):1465–1483, November 2008. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Cruz:2008:LFS Kim:2008:SOF [405] Isabel F. Cruz and Huiyong Xiao. A layered framework supporting personal information integration and application design for the semantic desktop. VLDB Journal: Very Large Data Bases, 17(6):1385–1406, November 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [409] Min-Soo Kim, Kyu-Young Whang, Jae-Gil Lee, and Min-Jae Lee. Structural optimization of a full-text ngram index using relational normalization. VLDB Journal: Very Large Data Bases, 17(6):1485–1507, November 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Candan:2008:SSE Guha:2008:STO [406] K. Selçuk Candan, Huiping Cao, Yan Qi, and Maria Luisa Sapino. System support for exploration and expert feedback in resolving conflicts dur- [410] Sudipto Guha. On the space–time of optimal, approximate and streaming algorithms for synopsis construction problems. VLDB Journal: Very Large REFERENCES 94 Data Bases, 17(6):1509–1535, November 2008. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lakhal:2009:FFE [411] Neila Ben Lakhal, Takashi Kobayashi, and Haruo Yokota. FENECIA: failure endurable nested-transaction based execution of composite Web services with incorporated state analysis. VLDB Journal: Very Large Data Bases, 18 (1):1–56, January 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Sharifzadeh:2009:AVC [412] Mehdi Sharifzadeh and Cyrus Shahabi. Approximate Voronoi cell computation on spatial data streams. VLDB Journal: Very Large Data Bases, 18 (1):57–75, January 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Vlachos:2009:OPV [413] Michail Vlachos, Aris Anagnostopoulos, Olivier Verscheure, and Philip S. Yu. Online pairing of VoIP conversations. VLDB Journal: Very Large Data Bases, 18(1):77–98, January 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yao:2009:LMK [414] Yuxia Yao, Xueyan Tang, and EePeng Lim. Localized monitoring of kNN queries in wireless sensor networks. VLDB Journal: Very Large Data Bases, 18(1):99–117, January 2009. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Paton:2009:AQP [415] Norman W. Paton, Jorge BuenabadChavez, Mengsong Chen, Vijayshankar Raman, Garret Swart, Inderpal Narang, Daniel M. Yellin, and Alvaro A. Fernandes. Autonomic query parallelization using non-dedicated computers: an evaluation of adaptivity options. VLDB Journal: Very Large Data Bases, 18(1):119–140, January 2009. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Park:2009:ESR [416] Laurence A. Park and Kotagiri Ramamohanarao. Efficient storage and retrieval of probabilistic latent semantic information for information retrieval. VLDB Journal: Very Large Data Bases, 18(1):141–155, January 2009. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Askitis:2009:BTD [417] Nikolas Askitis and Justin Zobel. Btries for disk-based string management. VLDB Journal: Very Large Data Bases, 18(1):157–179, January 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Joshi:2009:SBE [418] Shantanu Joshi and Christopher Jermaine. Sampling-based estimators for subset-based queries. VLDB Journal: Very Large Data Bases, 18(1):181–202, January 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Sacharidis:2009:HCW [419] Dimitris Sacharidis, Antonios Deligiannakis, and Timos Sellis. Hierarchically REFERENCES 95 compressed wavelet synopses. VLDB Journal: Very Large Data Bases, 18 (1):203–231, January 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). egy switching algorithm. VLDB Journal: Very Large Data Bases, 18(1):303– 327, January 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Theodoratos:2009:CPS Shen:2009:SII [420] Dimitri Theodoratos, Pawel Placek, [424] Heng Tao Shen, Shouxu Jiang, KianTheodore Dalamagas, Stefanos Souldatos, Lee Tan, Zi Huang, and Xiaofang and Timos Sellis. Containment of Zhou. Speed up interactive image repartially specified tree-pattern queries trieval. VLDB Journal: Very Large in the presence of dimension graphs. Data Bases, 18(1):329–343, January VLDB Journal: Very Large Data 2009. CODEN VLDBFR. ISSN 1066Bases, 18(1):233–254, January 2009. 8888 (print), 0949-877X (electronic). CODEN VLDBFR. ISSN 1066-8888 Wang:2009:SFS (print), 0949-877X (electronic). Benjelloun:2009:SGA [421] Omar Benjelloun, Hector GarciaMolina, David Menestrina, Qi Su, Steven Euijong Whang, and Jennifer Widom. Swoosh: a generic approach to entity resolution. VLDB Journal: Very Large Data Bases, 18(1):255–276, January 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Ratprasartporn:2009:CBL [422] Nattakarn Ratprasartporn, Jonathan Po, Ali Cakmak, Sulieman BaniAhmad, and Gultekin Ozsoyoglu. Context-based literature digital collection search. VLDB Journal: Very Large Data Bases, 18(1):277–301, January 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chiu:2009:EFS [423] Ding-Ying Chiu, Yi-Hung Wu, and Arbee L. Chen. Efficient frequent sequence mining by a dynamic strat- [425] Shiyuan Wang, Quang Hieu Vu, Beng Chin Ooi, Anthony K. Tung, and Lizhen Xu. Skyframe: a framework for skyline query processing in peer-topeer systems. VLDB Journal: Very Large Data Bases, 18(1):345–362, January 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Mouratidis:2009:PMD [426] Kyriakos Mouratidis, Dimitris Sacharidis, and Hweehwa Pang. Partially materialized digest scheme: an efficient verification method for outsourced databases. VLDB Journal: Very Large Data Bases, 18(1):363–381, January 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Garofalakis:2009:SIB [427] Minos Garofalakis, Johannes Gehrke, and Divesh Srivastava. Special issue: best papers of VLDB 2007. VLDB Journal: Very Large Data Bases, 18 (2):383–384, April 2009. CODEN REFERENCES 96 VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Abadi:2009:SSV [428] Daniel J. Abadi, Adam Marcus, Samuel R. Madden, and Kate Hollenbach. SW-Store: a vertically partitioned DBMS for Semantic Web data management. VLDB Journal: Very Large Data Bases, 18(2):385–406, April 2009. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Arai:2009:AMT [429] Benjamin Arai, Gautam Das, Dimitrios Gunopulos, and Nick Koudas. Anytime measures for top-k algorithms on exact and fuzzy data sets. VLDB Journal: Very Large Data Bases, 18 (2):407–427, April 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chen:2009:AKD [430] Bee-Chung Chen, Kristen Lefevre, and Raghu Ramakrishnan. Adversarialknowledge dimensions in data privacy. VLDB Journal: Very Large Data Bases, 18(2):429–467, April 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Dong:2009:DIU [431] Xin Luna Dong, Alon Halevy, and Cong Yu. Data integration with uncertainty. VLDB Journal: Very Large Data Bases, 18(2):469–500, April 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Gedik:2009:CPS [432] Buğra Gedik, Rajesh R. Bordawekar, and Philip S. Yu. CellJoin: a par- allel stream join operator for the Cell processor. VLDB Journal: Very Large Data Bases, 18(2):501–519, April 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Schnaitter:2009:DER [433] Karl Schnaitter, Joshua Spiegel, and Neoklis Polyzotis. Depth estimation for ranking query optimization. VLDB Journal: Very Large Data Bases, 18 (2):521–542, April 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Shao:2009:EKS [434] Feng Shao, Lin Guo, Chavdar Botev, Anand Bhaskar, Muthiah Chettiar, Fan Yang, and Jayavel Shanmugasundaram. Efficient keyword search over virtual XML views. VLDB Journal: Very Large Data Bases, 18(2):543–570, April 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wu:2009:GEV [435] Mingxi Wu and Chris Jermaine. Guessing the extreme values in a data set: a Bayesian method and its applications. VLDB Journal: Very Large Data Bases, 18(2):571–597, April 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Hill:2009:ROJ [436] Gerhard Hill and Andrew Ross. Reducing outer joins. VLDB Journal: Very Large Data Bases, 18(3):599–610, June 2009. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). REFERENCES 97 Keogh:2009:SEI [437] Eamonn Keogh, Li Wei, Xiaopeng Xi, Michail Vlachos, Sang-Hee Lee, and Pavlos Protopapas. Supporting exact indexing of arbitrarily rotated shapes and periodic time series under Euclidean and warping distance measures. VLDB Journal: Very Large Data Bases, 18(3):611–630, June 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yang:2009:AIO [438] Yin Yang, Stavros Papadopoulos, Dimitris Papadias, and George Kollios. Authenticated indexing for outsourced spatial databases. VLDB Journal: Very Large Data Bases, 18(3):631–648, June 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Quiane-Ruiz:2009:SAQ [439] Jorge-Arnulfo Quiané-Ruiz, Philippe Lamarre, and Patrick Valduriez. A self-adaptable query allocation framework for distributed information systems. VLDB Journal: Very Large Data Bases, 18(3):649–674, June 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Deng:2009:IOQ [440] Ke Deng, Xiaofang Zhou, Heng Tao Shen, Shazia Sadiq, and Xue Li. Instance optimal query processing in spatial networks. VLDB Journal: Very Large Data Bases, 18(3):675–693, June 2009. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Yiu:2009:MDT [441] Man Lung Yiu and Nikos Mamoulis. Multi-dimensional top-k dominating queries. VLDB Journal: Very Large Data Bases, 18(3):695–718, June 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Silva:2009:RTS [442] Yasin N. Silva, Xiaopeng Xiong, and Walid G. Aref. The RUM-tree: supporting frequent updates in R-trees using memos. VLDB Journal: Very Large Data Bases, 18(3):719–738, June 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Kriakov:2009:STM [443] Vassil Kriakov, George Kollios, and Alex Delis. Self-tuning management of update-intensive multidimensional data in clusters of workstations. VLDB Journal: Very Large Data Bases, 18 (3):739–764, June 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Cohen:2009:EQS [444] Sara Cohen. Equivalence of queries that are sensitive to multiplicities. VLDB Journal: Very Large Data Bases, 18(3):765–785, June 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lian:2009:EPP [445] Xiang Lian and Lei Chen. Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data. VLDB Journal: Very Large Data Bases, 18(3):787–808, June 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 98 Hua:2009:TTQ [446] Ming Hua, Jian Pei, Ada W. Fu, Xuemin Lin, and Ho-Fung Leung. Top-k typicality queries and efficient query answering methods on large databases. VLDB Journal: Very Large Data Bases, 18(3):809–835, June 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Bawa:2009:PPI [447] Mayank Bawa, Roberto J. Bayardo, Jr., Rakesh Agrawal, and Jaideep Vaidya. Privacy-preserving indexing of documents on the network. VLDB Journal: Very Large Data Bases, 18 (4):837–856, August 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Fan:2009:QTX [448] Wenfei Fan, Jeffrey Xu Yu, Jianzhong Li, Bolin Ding, and Lu Qin. Query translation from XPath to SQL in the presence of recursive DTDs. VLDB Journal: Very Large Data Bases, 18 (4):857–883, August 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Malik:2009:RRA [449] Zaki Malik and Athman Bouguettaya. RATEWeb: Reputation Assessment for Trust Establishment among Web services. VLDB Journal: Very Large Data Bases, 18(4):885–911, August 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wang:2009:CRE [450] Fusheng Wang, Shaorong Liu, and Peiya Liu. Complex RFID event processing. VLDB Journal: Very Large Data Bases, 18(4):913–931, August 2009. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). DuMouza:2009:LSI [451] Cédric Du Mouza, Witold Litwin, and Philippe Rigaux. Large-scale indexing of spatial data in distributed repositories: the SD-rtree. VLDB Journal: Very Large Data Bases, 18(4):933–958, August 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zheng:2009:DSI [452] Baihua Zheng, Wang-Chien Lee, Ken C. Lee, Dik Lun Lee, and Min Shao. A distributed spatial index for error-prone wireless data broadcast. VLDB Journal: Very Large Data Bases, 18(4):959–986, August 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Haas:2009:SIU [453] Peter J. Haas and Dan Suciu. Special issue on uncertain and probabilistic databases. VLDB Journal: Very Large Data Bases, 18(5):987–988, October 2009. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Sarma:2009:RUD [454] Anish Das Sarma, Omar Benjelloun, Alon Halevy, Shubha Nabar, and Jennifer Widom. Representing uncertain data: models, properties, and algorithms. VLDB Journal: Very Large Data Bases, 18(5):989–1019, October 2009. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). REFERENCES 99 Antova:2009:WBE [455] Lyublena Antova, Christoph Koch, 6 and Dan Olteanu. 10(10 ) worlds and beyond: efficient representation and processing of incomplete information. VLDB Journal: Very Large Data Bases, 18(5):1021–1040, October 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Abiteboul:2009:EPX [456] Serge Abiteboul, Benny Kimelfeld, Yehoshua Sagiv, and Pierre Senellart. On the expressiveness of probabilistic XML models. VLDB Journal: Very Large Data Bases, 18(5): 1041–1064, October 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Sen:2009:PME [457] Prithviraj Sen, Amol Deshpande, and Lise Getoor. PrDB: managing and exploiting rich correlations in probabilistic databases. VLDB Journal: Very Large Data Bases, 18(5):1065–1090, October 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Re:2009:THQ [458] Christopher Ré and Dan Suciu. The trichotomy of HAVING queries on a probabilistic database. VLDB Journal: Very Large Data Bases, 18(5): 1091–1116, October 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Kimelfeld:2009:QEP [459] Benny Kimelfeld, Yuri Kosharovsky, and Yehoshua Sagiv. Query evalua- tion over probabilistic XML. VLDB Journal: Very Large Data Bases, 18 (5):1117–1140, October 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Hassanzadeh:2009:CPD [460] Oktie Hassanzadeh and Renée J. Miller. Creating probabilistic databases from duplicated data. VLDB Journal: Very Large Data Bases, 18(5): 1141–1166, October 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wolf:2009:QPI [461] Garrett Wolf, Aravind Kalavagattu, Hemal Khatri, Raju Balakrishnan, Bhaumik Chokshi, Jianchun Fan, Yi Chen, and Subbarao Kambhampati. Query processing over incomplete autonomous databases: query rewriting using learned data dependencies. VLDB Journal: Very Large Data Bases, 18(5):1167–1190, October 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Keulen:2009:QEK [462] Maurice Keulen and Ander Keijzer. Qualitative effects of knowledge rules and user feedback in probabilistic data integration. VLDB Journal: Very Large Data Bases, 18(5):1191–1217, October 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chen:2009:SPS [463] Jinchuan Chen, Reynold Cheng, Mohamed Mokbel, and Chi-Yin Chow. Scalable processing of snapshot and continuous nearest-neighbor queries REFERENCES 100 over one-dimensional uncertain data. VLDB Journal: Very Large Data Bases, 18(5):1219–1240, October 2009. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chen:2010:TFD [464] Keke Chen and Ling Liu. HE-Tree: a framework for detecting changes in clustering structure for categorical data streams. VLDB Journal: Very Large Data Bases, 18(6):1241–1260, December 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Whang:2010:GER [465] Steven Euijong Whang, Omar Benjelloun, and Hector Garcia-Molina. Generic entity resolution with negative rules. VLDB Journal: Very Large Data Bases, 18(6):1261–1277, December 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). ISSN 1066-8888 (print), 0949-877X (electronic). Duntgen:2010:BBM [468] Christian Düntgen, Thomas Behr, and Ralf Hartmut Güting. BerlinMOD: a benchmark for moving object databases. VLDB Journal: Very Large Data Bases, 18(6):1335–1368, December 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Mandreoli:2010:PHS [469] Federica Mandreoli, Riccardo Martoglia, and Pavel Zezula. Principles of Holism for sequential twig pattern matching. VLDB Journal: Very Large Data Bases, 18(6):1369–1392, December 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Buneman:2010:SIB Ntarmos:2010:SSI [466] Nikos Ntarmos, Peter Triantafillou, and Gerhard Weikum. Statistical structures for Internet-scale data management. VLDB Journal: Very Large Data Bases, 18(6):1279–1312, December 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Bramandia:2010:OUR [467] Ramadhana Bramandia, Jiefeng Cheng, Byron Choi, and Jeffrey Xu Yu. Optimizing updates of recursive XML views of relations. VLDB Journal: Very Large Data Bases, 18(6):1313–1333, December 2010. CODEN VLDBFR. [470] Peter Buneman, Volker Markl, Beng Chin Ooi, and Kenneth Ross. Special issue: best papers of VLDB 2008. VLDB Journal: Very Large Data Bases, 19 (1):1–2, February 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Cormode:2010:MFF [471] Graham Cormode and Marios Hadjieleftheriou. Methods for finding frequent items in data streams. VLDB Journal: Very Large Data Bases, 19 (1):3–20, February 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 101 Bruno:2010:CPD [472] Nicolas Bruno and Surajit Chaudhuri. Constrained physical design tuning. VLDB Journal: Very Large Data Bases, 19(1):21–44, February 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lizorkin:2010:AEO [473] Dmitry Lizorkin, Pavel Velikhov, Maxim Grinev, and Denis Turdakov. Accuracy estimate and optimization techniques for SimRank computation. VLDB Journal: Very Large Data Bases, 19(1):45–66, February 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Nath:2010:OMV [474] Suman Nath and Phillip B. Gibbons. Online maintenance of very large random samples on flash storage. VLDB Journal: Very Large Data Bases, 19 (1):67–90, February 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Neumann:2010:RES [475] Thomas Neumann and Gerhard Weikum. The RDF-3X engine for scalable management of RDF data. VLDB Journal: Very Large Data Bases, 19 (1):91–113, February 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Cormode:2010:ABG [476] Graham Cormode, Divesh Srivastava, Ting Yu, and Qing Zhang. Anonymizing bipartite graph data using safe groupings. VLDB Journal: Very Large Data Bases, 19(1):115–139, February 2010. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). U:2010:CSA [477] Leong Hou U., Kyriakos Mouratidis, and Nikos Mamoulis. Continuous spatial assignment of moving users. VLDB Journal: Very Large Data Bases, 19 (2):141–160, April 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Papadopoulos:2010:CAR [478] Stavros Papadopoulos, Yin Yang, and Dimitris Papadias. Continuous authentication on relational streams. VLDB Journal: Very Large Data Bases, 19 (2):161–180, April 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhang:2010:UMS [479] Zhenjie Zhang, Hua Lu, Beng Chin Ooi, and Anthony K. Tung. Understanding the meaning of a shifted sky: a general framework on extending skyline query. VLDB Journal: Very Large Data Bases, 19(2):181–201, April 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lo:2010:FTD [480] Eric Lo, Carsten Binnig, Donald Kossmann, M. Tamer Özsu, and Wing-Kai Hon. A framework for testing DBMS features. VLDB Journal: Very Large Data Bases, 19(2):203–230, April 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Bonifati:2010:SMQ [481] Angela Bonifati, Elaine Chang, Terence Ho, Laks V. Lakshmanan, Rachel REFERENCES 102 Pottinger, and Yongik Chung. Schema mapping and query translation in heterogeneous P2P XML databases. VLDB Journal: Very Large Data Bases, 19(2):231–256, April 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Morfonios:2010:RCL [482] Konstantinos Morfonios and Yannis Ioannidis. Revisiting the cube lifecycle in the presence of hierarchies. VLDB Journal: Very Large Data Bases, 19 (2):257–282, April 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhang:2010:TBP [483] Wenjie Zhang, Xuemin Lin, Ying Zhang, Jian Pei, and Wei Wang. Threshold-based probabilistic top-k dominating queries. VLDB Journal: Very Large Data Bases, 19(2):283–305, April 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Nutanong:2010:AEV [484] Sarana Nutanong, Rui Zhang, Egemen Tanin, and Lars Kulik. Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries. VLDB Journal: Very Large Data Bases, 19(3):307–332, June 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lee:2010:ZSE [485] Ken C. Lee, Wang-Chien Lee, Baihua Zheng, Huajing Li, and Yuan Tian. Z-SKY: an efficient skyline query processing framework based on Z-order. VLDB Journal: Very Large Data Bases, 19(3):333–362, June 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yiu:2010:ESS [486] Man Lung Yiu, Gabriel Ghinita, Christian S. Jensen, and Panos Kalnis. Enabling search services on outsourced private spatial data. VLDB Journal: Very Large Data Bases, 19(3):363–384, June 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Hintoglu:2010:SMP [487] Ayça Azgin Hintoglu and Yücel Saygın. Suppressing microdata to prevent classification based inference. VLDB Journal: Very Large Data Bases, 19(3):385– 410, June 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Jin:2010:SWT [488] Cheqing Jin, Ke Yi, Lei Chen, Jeffrey Xu Yu, and Xuemin Lin. Slidingwindow top-k queries on uncertain streams. VLDB Journal: Very Large Data Bases, 19(3):411–435, June 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Pang:2010:EPE [489] Hweehwa Pang, Xuhua Ding, and Baihua Zheng. Efficient processing of exact top-k queries over disk-resident sorted lists. VLDB Journal: Very Large Data Bases, 19(3):437–456, June 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 103 Murugesan:2010:EPP Zhang:2010:SMA [490] Mummoorthy Murugesan, Wei Jiang, Chris Clifton, Luo Si, and Jaideep Vaidya. Efficient privacy-preserving similar document detection. VLDB Journal: Very Large Data Bases, 19 (4):457–475, August 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [494] Rui Zhang, Nick Koudas, Beng Chin Ooi, Divesh Srivastava, and Pu Zhou. Streaming multiple aggregations using phantoms. VLDB Journal: Very Large Data Bases, 19(4):557–583, August 2010. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Soliman:2010:SRQ [495] Hoyoung Jeung, Man Lung Yiu, Xiaofang Zhou, and Christian S. Jensen. Path prediction and predictive range querying in road network databases. VLDB Journal: Very Large Data Bases, 19(4):585–602, August 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [491] Mohamed A. Soliman, Ihab F. Ilyas, and Shalev Ben-David. Supporting ranking queries on uncertain and incomplete data. VLDB Journal: Very Large Data Bases, 19(4):477–501, August 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lee:2010:SCE [492] Ki-Hoon Lee, Kyu-Young Whang, Wook-Shin Han, and Min-Soo Kim. Structural consistency: enabling XML keyword search to eliminate spurious results consistently. VLDB Journal: Very Large Data Bases, 19(4):503–529, August 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lucchese:2010:RPT [493] Claudio Lucchese, Michail Vlachos, Deepak Rajan, and Philip S. Yu. Rights protection of trajectory datasets with nearest-neighbor preservation. VLDB Journal: Very Large Data Bases, 19(4):531–556, August 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Jeung:2010:PPP Ali:2010:MAA [496] Mohammed Eunus Ali, Egemen Tanin, Rui Zhang, and Lars Kulik. A motionaware approach for efficient evaluation of continuous queries on 3D object databases. VLDB Journal: Very Large Data Bases, 19(5):603–632, October 2010. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Askitis:2010:ESC [497] Nikolas Askitis and Ranjan Sinha. Engineering scalable, cache and space efficient tries for strings. VLDB Journal: Very Large Data Bases, 19(5):633– 660, October 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wu:2010:EEG [498] Xiaoying Wu, Dimitri Theodoratos, and Calisto Zuzarte. Efficient evaluation of generalized tree-pattern queries REFERENCES 104 on XML streams. VLDB Journal: Very Large Data Bases, 19(5):661–686, October 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). weighting for search and recommendation. VLDB Journal: Very Large Data Bases, 19(6):761–775, December 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Guting:2010:ENN Squicciarini:2010:PPS [499] Ralf Hartmut Güting, Thomas Behr, and Jianqiu Xu. Efficient k-nearest neighbor search on moving object trajectories. VLDB Journal: Very Large Data Bases, 19(5):687–714, October 2010. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). [504] Anna C. Squicciarini, Mohamed Shehab, and Joshua Wede. Privacy policies for shared content in social network sites. VLDB Journal: Very Large Data Bases, 19(6):777–796, December 2010. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Li:2010:TQT Hay:2010:RSR [500] Feifei Li, Ke Yi, and Wangchao Le. Top-k queries on temporal data. VLDB Journal: Very Large Data Bases, 19 (5):715–733, October 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [505] Michael Hay, Gerome Miklau, David Jensen, Don Towsley, and Chao Li. Resisting structural re-identification in anonymized social networks. VLDB Journal: Very Large Data Bases, 19 (6):797–823, December 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Duda:2010:PBI [501] Cristian Duda, Donald Kossmann, and Chong Zhou. Predicate-based indexing for desktop search. VLDB Journal: Very Large Data Bases, 19(5):735– 758, October 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Bohm:2010:F [502] Klemens Böhm and Laks V. Lakshmanan. Foreword. VLDB Journal: Very Large Data Bases, 19(6): 759–760, December 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Carmel:2010:SBW [503] David Carmel, Haggai Roitman, and Elad Yom-Tov. Social bookmark Gruhl:2010:MSI [506] Daniel Gruhl, Meena Nagarajan, Jan Pieper, Christine Robson, and Amit Sheth. Multimodal social intelligence in a real-time dashboard system. VLDB Journal: Very Large Data Bases, 19 (6):825–848, December 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Benz:2010:SBP [507] Dominik Benz, Andreas Hotho, Robert Jäschke, Beate Krause, Folke Mitzlaff, Christoph Schmitz, and Gerd Stumme. The social bookmark and publication management system bibsonomy. VLDB Journal: Very Large Data Bases, 19 (6):849–875, December 2010. CODEN REFERENCES 105 VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Roy:2010:SEG [508] Senjuti Basu Roy, Sihem Amer-Yahia, Ashish Chawla, Gautam Das, and Cong Yu. Space efficiency in group recommendation. VLDB Journal: Very Large Data Bases, 19(6):877–900, December 2010. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Li:2011:PBK [509] Guoliang Li, Jianhua Feng, Xiaofang Zhou, and Jianyong Wang. Providing built-in keyword search capabilities in RDBMS. VLDB Journal: Very Large Data Bases, 20(1):1–19, February 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Cai:2011:SKD [510] Deng Cai, Xiaofei He, and Jiawei Han. Speed up kernel discriminant analysis. VLDB Journal: Very Large Data Bases, 20(1):21–33, February 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Qin:2011:SKS [511] Lu Qin, Jeffrey Xu Yu, and Lijun Chang. Scalable keyword search on large data streams. VLDB Journal: Very Large Data Bases, 20(1):35–57, February 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Cao:2011:SSA [512] Jianneng Cao, Panagiotis Karras, Panos Kalnis, and Kian-Lee Tan. SABRE: a Sensitive Attribute Bucketization and REdistribution framework for t-closeness. VLDB Journal: Very Large Data Bases, 20(1):59–81, February 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Terrovitis:2011:LGR [513] Manolis Terrovitis, Nikos Mamoulis, and Panos Kalnis. Local and global recoding methods for anonymizing setvalued data. VLDB Journal: Very Large Data Bases, 20(1):83–106, February 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lian:2011:PIR [514] Xiang Lian and Lei Chen. Probabilistic inverse ranking queries in uncertain databases. VLDB Journal: Very Large Data Bases, 20(1):107–127, February 2011. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Hua:2011:RQU [515] Ming Hua, Jian Pei, and Xuemin Lin. Ranking queries on uncertain data. VLDB Journal: Very Large Data Bases, 20(1):129–153, February 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Abiteboul:2011:SIB [516] Serge Abiteboul, Volker Markl, Tova Milo, and Jignesh Patel. Special issue: best papers of VLDB 2009. VLDB Journal: Very Large Data Bases, 20 (2):155–156, April 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 106 Mindolin:2011:PEP Gottlob:2011:NOS [517] Denis Mindolin and Jan Chomicki. Preference elicitation in prioritized skyline queries. VLDB Journal: Very Large Data Bases, 20(2):157–182, April 2011. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). [522] Georg Gottlob, Reinhard Pichler, and Vadim Savenkov. Normalization and optimization of schema mappings. VLDB Journal: Very Large Data Bases, 20(2):277–302, April 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Denev:2011:SFD [518] Dimitar Denev, Arturas Mazeika, Marc Spaniol, and Gerhard Weikum. The SHARC framework for data quality in Web archiving. VLDB Journal: Very Large Data Bases, 20(2):183–207, April 2011. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Elmeleegy:2011:HRT [519] Hazem Elmeleegy, Jayant Madhavan, and Alon Halevy. Harvesting relational tables from lists on the Web. VLDB Journal: Very Large Data Bases, 20 (2):209–226, April 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Candea:2011:PPH [520] George Candea, Neoklis Polyzotis, and Radek Vingralek. Predictable performance and high query concurrency for data analytics. VLDB Journal: Very Large Data Bases, 20(2):227–248, April 2011. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Li:2011:UAR [521] Jian Li, Barna Saha, and Amol Deshpande. A unified approach to ranking in probabilistic databases. VLDB Journal: Very Large Data Bases, 20 (2):249–275, April 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Cho:2011:LRM [523] Chung-Wen Cho, Yi-Hung Wu, ShowJane Yen, Ying Zheng, and Arbee L. Chen. On-line rule matching for event prediction. VLDB Journal: Very Large Data Bases, 20(3):303–334, June 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Liu:2011:MLD [524] Jun Liu, Lu Jiang, Zhaohui Wu, Qinghua Zheng, and Yanan Qian. Mining learning-dependency between knowledge units from text. VLDB Journal: Very Large Data Bases, 20 (3):335–345, June 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wang:2011:LBM [525] Rui Wang, Betty Salzberg, and David Lomet. Log-based middleware server recovery with transaction support. VLDB Journal: Very Large Data Bases, 20(3):347–370, June 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Gao:2011:CVN [526] Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, and Xiaofa Guo. Continuous visible nearest neighbor query processing in spatial databases. VLDB REFERENCES 107 Journal: Very Large Data Bases, 20 (3):371–396, June 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Luo:2011:QRI [527] Bo Luo, Dongwon Lee, Wang-Chien Lee, and Peng Liu. QFilter: rewriting insecure XML queries to secure ones using non-deterministic finite automata. VLDB Journal: Very Large Data Bases, 20(3):397–415, June 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Motahari-Nezhad:2011:ECP [528] Hamid Reza Motahari-Nezhad, Regis Saint-Paul, Fabio Casati, and Boualem Benatallah. Event correlation for process discovery from web service interaction logs. VLDB Journal: Very Large Data Bases, 20(3):417–444, June 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chakrabarti:2011:IDQ [529] Soumen Chakrabarti, Amit Pathak, and Manish Gupta. Index design and query processing for graph conductance search. VLDB Journal: Very Large Data Bases, 20(3):445–470, June 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chen:2011:PAD [530] Shaoping Chen, Yi-Cheng Tu, and Yuni Xia. Performance analysis of a dual-tree algorithm for computing spatial distance histograms. VLDB Journal: Very Large Data Bases, 20 (4):471–494, August 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Fan:2011:DCR [531] Wenfei Fan, Hong Gao, Xibei Jia, Jianzhong Li, and Shuai Ma. Dynamic constraints for record matching. VLDB Journal: Very Large Data Bases, 20 (4):495–520, August 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Cheng:2011:FGQ [532] James Cheng, Yiping Ke, Ada WaiChee Fu, and Jeffrey Xu Yu. Fast graph query processing with a low-cost index. VLDB Journal: Very Large Data Bases, 20(4):521–539, August 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Mascetti:2011:PGS [533] Sergio Mascetti, Dario Freni, Claudio Bettini, X. Sean Wang, and Sushil Jajodia. Privacy in geo-social networks: proximity notification with untrusted service providers and curious buddies. VLDB Journal: Very Large Data Bases, 20(4):541–566, August 2011. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Mohammed:2011:AMG [534] Noman Mohammed, Benjamin C. Fung, and Mourad Debbabi. Anonymity meets game theory: secure data integration with malicious participants. VLDB Journal: Very Large Data Bases, 20(4):567–588, August 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Ahmad:2011:IAS [535] Mumtaz Ahmad, Ashraf Aboulnaga, Shivnath Babu, and Kamesh Munagala. Interaction-aware scheduling of REFERENCES 108 report-generation workloads. VLDB Journal: Very Large Data Bases, 20 (4):589–615, August 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Li:2011:EFF [536] Guoliang Li, Shengyue Ji, Chen Li, and Jianhua Feng. Efficient fuzzy full-text type-ahead search. VLDB Journal: Very Large Data Bases, 20 (4):617–640, August 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Guting:2011:SID [537] Ralf Hartmut Güting and Nikos Mamoulis. Special issue on data management for mobile services. VLDB Journal: Very Large Data Bases, 20 (5):641–642, October 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Popa:2011:INT [538] Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, Dominique Barth, and Sandrine Vial. Indexing in-network trajectory flows. VLDB Journal: Very Large Data Bases, 20(5):643–669, October 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lange:2011:ERT [539] Ralph Lange, Frank Dürr, and Kurt Rothermel. Efficient real-time trajectory tracking. VLDB Journal: Very Large Data Bases, 20(5):671–694, October 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Giannotti:2011:UCH [540] Fosca Giannotti, Mirco Nanni, Dino Pedreschi, Fabio Pinelli, Chiara Renso, Salvatore Rinzivillo, and Roberto Trasarti. Unveiling the complexity of human mobility by querying and mining massive trajectory data. VLDB Journal: Very Large Data Bases, 20 (5):695–719, October 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Timko:2011:SSA [541] Igor Timko, Michael Böhlen, and Johann Gamper. Sequenced spatiotemporal aggregation for coarse query granularities. VLDB Journal: Very Large Data Bases, 20(5):721–741, October 2011. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Guo:2011:DBS [542] Xi Guo, Baihua Zheng, Yoshiharu Ishikawa, and Yunjun Gao. Directionbased surrounder queries for mobile recommendations. VLDB Journal: Very Large Data Bases, 20(5):743–766, October 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Trajcevski:2011:RCN [543] Goce Trajcevski, Roberto Tamassia, Isabel F. Cruz, Peter Scheuermann, David Hartglass, and Christopher Zamierowski. Ranking continuous nearest neighbors for uncertain trajectories. VLDB Journal: Very Large Data Bases, 20(5):767–791, October 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 109 Rao:2011:STE [544] Weixiong Rao, Lei Chen, and Ada Wai-Chee Fu. STAIRS: Towards efficient full-text filtering and dissemination in DHT environments. VLDB Journal: Very Large Data Bases, 20 (6):793–817, December 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lian:2011:STS [545] Xiang Lian and Lei Chen. Shooting top-k stars in uncertain databases. VLDB Journal: Very Large Data Bases, 20(6):819–840, December 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Perez-Sorrosal:2011:ESC [546] Francisco Perez-Sorrosal, Marta PatiñoMartinez, Ricardo Jimenez-Peris, and Bettina Kemme. Elastic SI-Cache: consistent and scalable caching in multitier architectures. VLDB Journal: Very Large Data Bases, 20(6):841–865, December 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Moga:2011:USC [547] Alexandru Moga, Irina Botan, and Nesime Tatbul. UpStream: storagecentric load management for streaming applications with update semantics. VLDB Journal: Very Large Data Bases, 20(6):867–892, December 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wong:2011:MBR [548] Raymond Chi-Wing Wong, M. Tamer Özsu, Ada Wai-Chee Fu, Philip S. Yu, Lian Liu, and Yubao Liu. Maximizing bichromatic reverse nearest neighbor for Lp-norm in two- and threedimensional spaces. VLDB Journal: Very Large Data Bases, 20(6):893–919, December 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Tiakas:2011:PPS [549] Eleftherios Tiakas, Apostolos N. Papadopoulos, and Yannis Manolopoulos. Progressive processing of subspace dominating queries. VLDB Journal: Very Large Data Bases, 20(6): 921–948, December 2011. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Mueller:2012:SNF [550] Rene Mueller, Jens Teubner, and Gustavo Alonso. Sorting networks on FPGAs. VLDB Journal: Very Large Data Bases, 21(1):1–23, February 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Georgoulas:2012:DSE [551] Konstantinos Georgoulas and Yannis Kotidis. Distributed similarity estimation using derived dimensions. VLDB Journal: Very Large Data Bases, 21 (1):25–50, February 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Deutch:2012:TIT [552] Daniel Deutch and Tova Milo. Type inference and type checking for queries over execution traces. VLDB Journal: Very Large Data Bases, 21(1):51– 68, February 2012. CODEN VLDBFR. REFERENCES 110 ISSN 1066-8888 (print), 0949-877X (electronic). Cheema:2012:CRN [553] Muhammad Aamir Cheema, Wenjie Zhang, Xuemin Lin, Ying Zhang, and Xuefei Li. Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks. VLDB Journal: Very Large Data Bases, 21(1):69– 95, February 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zou:2012:APM [554] Lei Zou, Lei Chen, M. Tamer Özsu, and Dongyan Zhao. Answering pattern match queries in large graph databases via graph embedding. VLDB Journal: Very Large Data Bases, 21 (1):97–120, February 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Hartmann:2012:DES [555] Sven Hartmann, Markus Kirchberg, and Sebastian Link. Design by example for SQL table definitions with functional dependencies. VLDB Journal: Very Large Data Bases, 21(1): 121–144, February 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Guravannavar:2012:WSO [556] Ravindra Guravannavar, S. Sudarshan, Ajit A. Diwan, and Ch. Sobhan Babu. Which sort orders are interesting? VLDB Journal: Very Large Data Bases, 21(1):145–165, February 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Atzeni:2012:SIB [557] Paolo Atzeni, Elisa Bertino, Masaru Kitsuregawa, and Kian-Lee Tan. Special issue: best papers of VLDB 2010. VLDB Journal: Very Large Data Bases, 21(2):167–168, April 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Bu:2012:HAL [558] Yingyi Bu, Bill Howe, Magdalena Balazinska, and Michael D. Ernst. The HaLoop approach to large-scale iterative data analysis. VLDB Journal: Very Large Data Bases, 21(2):169–190, April 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Alexe:2012:MCI [559] Bogdan Alexe, Mauricio Hernández, Lucian Popa, and Wang-Chiew Tan. MapMerge: correlating independent schema mappings. VLDB Journal: Very Large Data Bases, 21(2):191–211, April 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Fan:2012:TCF [560] Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, and Wenyuan Yu. Towards certain fixes with editing rules and master data. VLDB Journal: Very Large Data Bases, 21(2):213–238, April 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Johnson:2012:SWA [561] Ryan Johnson, Ippokratis Pandis, Radu Stoica, Manos Athanassoulis, and Anastasia Ailamaki. Scalability of REFERENCES 111 write-ahead logging on multicore and multisocket hardware. VLDB Journal: Very Large Data Bases, 21(2):239–263, April 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chen:2012:AUP [562] Su Chen, Beng Chin Ooi, and Zhenjie Zhang. An adaptive updating protocol for reducing moving object database workload. VLDB Journal: Very Large Data Bases, 21(2):265–286, April 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Fusco:2012:RTC [563] Francesco Fusco, Michail Vlachos, and Marc Ph. Stoecklin. Real-time creation of bitmap indexes on streaming network data. VLDB Journal: Very Large Data Bases, 21(3):287–307, June 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Gordevicus:2012:PTA [564] Juozas Gordevičus, Johann Gamper, and Michael Böhlen. Parsimonious temporal aggregation. VLDB Journal: Very Large Data Bases, 21(3):309–332, June 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Hore:2012:SMR [565] Bijit Hore, Sharad Mehrotra, Mustafa Canim, and Murat Kantarcioglu. Secure multidimensional range queries over outsourced data. VLDB Journal: Very Large Data Bases, 21(3):333–358, June 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Hose:2012:SSP [566] Katja Hose and Akrivi Vlachou. A survey of skyline processing in highly distributed environments. VLDB Journal: Very Large Data Bases, 21(3):359–384, June 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Gong:2012:EMU [567] Jian Gong, Reynold Cheng, and David W. Cheung. Efficient management of uncertainty in XML schema matching. VLDB Journal: Very Large Data Bases, 21(3):385–409, June 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Cao:2012:SSA [568] Yu Cao, Ramadhana Bramandia, Chee-Yong Chan, and Kian-Lee Tan. Sort-sharing-aware query processing. VLDB Journal: Very Large Data Bases, 21(3):411–436, June 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Feng:2012:TJT [569] Jianhua Feng, Jiannan Wang, and Guoliang Li. Trie-join: a trie-based method for efficient string similarity joins. VLDB Journal: Very Large Data Bases, 21(4):437–461, August 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Augsten:2012:WGA [570] Nikolaus Augsten, Michael Böhlen, Curtis Dyreson, and Johann Gamper. Windowed pq-grams for approximate joins of data-centric XML. VLDB Journal: Very Large Data Bases, 21 REFERENCES 112 (4):463–488, August 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). 1066-8888 (print), 0949-877X (electronic). Lehner:2012:SSL Zhou:2012:ESM [571] Xiangmin Zhou, Xiaofang Zhou, Lei Chen, and Athman Bouguettaya. Efficient subsequence matching over large video databases. VLDB Journal: Very Large Data Bases, 21(4):489–508, August 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yildirim:2012:GSI [572] Hilmi Yildirim, Vineet Chaoji, and Mohammed J. Zaki. GRAIL: a scalable index for reachability queries in very large graphs. VLDB Journal: Very Large Data Bases, 21(4):509–534, August 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [575] Wolfgang Lehner and Michael J. Franklin. Special section on large-scale analytics. VLDB Journal: Very Large Data Bases, 21(5):587–588, October 2012. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Wolf:2012:OSM [576] Joel Wolf, Andrey Balmin, Deepak Rajan, Kirsten Hildrum, Rohit Khandekar, Sujay Parekh, Kun-Lung Wu, and Rares Vernica. On the optimization of schedules for MapReduce workloads in the presence of shared scans. VLDB Journal: Very Large Data Bases, 21(5):589–609, October 2012. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Zhou:2012:SPD Xu:2012:EES [573] Jia Xu, Zhenjie Zhang, Anthony K. Tung, and Ge Yu. Efficient and effective similarity search over probabilistic data based on Earth Mover’s Distance. VLDB Journal: Very Large Data Bases, 21(4):535–559, August 2012. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). [577] Jingren Zhou, Nicolas Bruno, MingChuan Wu, Per-Ake Larson, Ronnie Chaiken, and Darren Shakib. SCOPE: parallel databases meet MapReduce. VLDB Journal: Very Large Data Bases, 21(5):611–636, October 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Kang:2012:GEA Zhang:2012:HOA [574] Rui Zhang, Jianzhong Qi, Dan Lin, Wei Wang, and Raymond Chi-Wing Wong. A highly optimized algorithm for continuous intersection join queries over moving objects. VLDB Journal: Very Large Data Bases, 21(4):561–586, August 2012. CODEN VLDBFR. ISSN [578] U. Kang, Hanghang Tong, Jimeng Sun, Ching-Yung Lin, and Christos Faloutsos. gbase: an efficient analysis platform for large graphs. VLDB Journal: Very Large Data Bases, 21 (5):637–650, October 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 113 Tran:2012:CMP [579] Thanh T. Tran, Liping Peng, Yanlei Diao, Andrew Mcgregor, and Anna Liu. CLARO: modeling and processing uncertain data streams. VLDB Journal: Very Large Data Bases, 21 (5):651–676, October 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Helmer:2012:MSS [580] Sven Helmer, Nikolaus Augsten, and Michael Böhlen. Measuring structural similarity of semistructured data based on information-theoretic approaches. VLDB Journal: Very Large Data Bases, 21(5):677–702, October 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Cheema:2012:EPS [581] Muhammad Aamir Cheema, Wenjie Zhang, Xuemin Lin, and Ying Zhang. Efficiently processing snapshot and continuous reverse k nearest neighbors queries. VLDB Journal: Very Large Data Bases, 21(5):703–728, October 2012. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Zheng:2012:SQP [582] Kai Zheng, Xiaofang Zhou, Pui Cheong Fung, and Kexin Xie. Spatial query processing for fuzzy objects. VLDB Journal: Very Large Data Bases, 21 (5):729–751, October 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Li:2012:MFS [583] Jianzhong Li, Zhaonian Zou, and Hong Gao. Mining frequent subgraphs over uncertain graph databases under probabilistic semantics. VLDB Journal: Very Large Data Bases, 21(6):753–777, December 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Vergoulis:2012:ARS [584] Thanasis Vergoulis, Theodore Dalamagas, Dimitris Sacharidis, and Timos Sellis. Approximate regional sequence matching for genomic databases. VLDB Journal: Very Large Data Bases, 21(6):779–795, December 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wu:2012:FES [585] Dingming Wu, Gao Cong, and Christian S. Jensen. A framework for efficient spatial web object retrieval. VLDB Journal: Very Large Data Bases, 21(6):797–822, December 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Arenas:2012:QLB [586] Marcelo Arenas, Jorge Pérez, Juan Reutter, and Cristian Riveros. Query language-based inverses of schema mappings: semantics, computation, and closure properties. VLDB Journal: Very Large Data Bases, 21(6): 823–842, December 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Bravo:2012:CRX [587] Loreto Bravo, James Cheney, Irini Fundulaki, and Ricardo Segovia. Consistency and repair for XML writeaccess control policies. VLDB Journal: Very Large Data Bases, 21(6): REFERENCES 114 843–867, December 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chang:2012:EDD [588] Lijun Chang, Jeffrey Xu Yu, Lu Qin, Hong Cheng, and Miao Qiao. The exact distance to destination in undirected world. VLDB Journal: Very Large Data Bases, 21(6):869–888, December 2012. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Soh:2012:AEE [589] Kheng Hong Soh, Ba Quan Truong, and Sourav S. Bhowmick. ANDES: efficient evaluation of NOT-twig queries in relational databases. VLDB Journal: Very Large Data Bases, 21(6): 889–914, December 2012. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lehner:2013:SIB [590] Wolfgang Lehner and Sunita Sarawagi. Special issue on best papers of VLDB 2011. VLDB Journal: Very Large Data Bases, 22(1):1–2, February 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Tzoumas:2013:EAG [591] Kostas Tzoumas, Amol Deshpande, and Christian S. Jensen. Efficiently adapting graphical models for selectivity estimation. VLDB Journal: Very Large Data Bases, 22(1):3–27, February 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Minhas:2013:RTH [592] Umar Farooq Minhas, Shriram Rajagopalan, Brendan Cully, Ashraf Aboulnaga, Kenneth Salem, and Andrew Warfield. RemusDB: transparent high availability for database systems. VLDB Journal: Very Large Data Bases, 22(1):29–45, February 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Furche:2013:OLS [593] Tim Furche, Georg Gottlob, Giovanni Grasso, Christian Schallhart, and Andrew Sellers. OXPath: a language for scalable data extraction, automation, and crawling on the deep web. VLDB Journal: Very Large Data Bases, 22 (1):47–72, February 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Curino:2013:ADS [594] Carlo Curino, Hyun Jin Moon, Alin Deutsch, and Carlo Zaniolo. Automating the database schema evolution process. VLDB Journal: Very Large Data Bases, 22(1):73–98, February 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Ramesh:2013:KSF [595] Aditya Ramesh, S. Sudarshan, Purva Joshi, and Manisha Naik Gaonkar. Keyword search on form results. VLDB Journal: Very Large Data Bases, 22 (1):99–123, February 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Dieng:2013:MFC [596] Cheikh Tidiane Dieng, Tao-Yuan Jen, Dominique Laurent, and Nicolas REFERENCES 115 Spyratos. Mining frequent conjunctive queries using functional and inclusion dependencies. VLDB Journal: Very Large Data Bases, 22(2):125–150, April 2013. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Tozun:2013:SDB [597] Pinar Tözün, Ippokratis Pandis, Ryan Johnson, and Anastasia Ailamaki. Scalable and dynamically balanced shared-everything OLTP with physiological partitioning. VLDB Journal: Very Large Data Bases, 22(2):151–175, April 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wu:2013:SXS [598] Xiaoying Wu and Dimitri Theodoratos. A survey on XML streaming evaluation techniques. VLDB Journal: Very Large Data Bases, 22(2):177–202, April 2013. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Lu:2013:ADU [599] Wentian Lu, Gerome Miklau, and Neil Immerman. Auditing a database under retention policies. VLDB Journal: Very Large Data Bases, 22(2):203–228, April 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yuan:2013:LLB [600] Dayu Yuan and Prasenjit Mitra. Lindex: a lattice-based index for graph databases. VLDB Journal: Very Large Data Bases, 22(2):229–252, April 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Song:2013:CDH [601] Shaoxu Song, Lei Chen, and Philip S. Yu. Comparable dependencies over heterogeneous data. VLDB Journal: Very Large Data Bases, 22(2):253–274, April 2013. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Qiao:2013:CWC [602] Miao Qiao, Hong Cheng, Lu Qin, Jeffrey Xu Yu, Philip S. Yu, and Lijun Chang. Computing weight constraint reachability in large networks. VLDB Journal: Very Large Data Bases, 22 (3):275–294, June 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Toyoda:2013:PDD [603] Machiko Toyoda, Yasushi Sakurai, and Yoshiharu Ishikawa. Pattern discovery in data streams under the time warping distance. VLDB Journal: Very Large Data Bases, 22(3):295–318, June 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Xie:2013:UDV [604] Xike Xie, Reynold Cheng, Man Lung Yiu, Liwen Sun, and Jinchuan Chen. UV-diagram: a Voronoi diagram for uncertain spatial databases. VLDB Journal: Very Large Data Bases, 22 (3):319–344, June 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhu:2013:HEQ [605] Yuanyuan Zhu, Lu Qin, Jeffrey Xu Yu, Yiping Ke, and Xuemin Lin. High efficiency and quality: large graphs matching. VLDB Journal: Very Large REFERENCES 116 Data Bases, 22(3):345–368, June 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Baca:2013:OEG [606] Radim Baca, Michal Krátký, Tok Wang Ling, and Jiaheng Lu. Optimal and efficient generalized twig pattern processing: a combination of preorder and postorder filterings. VLDB Journal: Very Large Data Bases, 22(3):369–393, June 2013. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Silva:2013:SQT [607] Yasin N. Silva, Walid G. Aref, PerAke Larson, Spencer S. Pearson, and Mohamed H. Ali. Similarity queries: their conceptual evaluation, transformations, and processing. VLDB Journal: Very Large Data Bases, 22(3):395– 420, June 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Dindar:2013:MES [608] Nihal Dindar, Nesime Tatbul, Renée J. Miller, Laura M. Haas, and Irina Botan. Modeling the execution semantics of stream processing engines with SECRET. VLDB Journal: Very Large Data Bases, 22(4):421–446, August 2013. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Elghandour:2013:RXP [609] Iman Elghandour, Ashraf Aboulnaga, Daniel C. Zilio, and Calisto Zuzarte. Recommending XML physical designs for XML databases. VLDB Journal: Very Large Data Bases, 22(4):447–470, August 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Mazuran:2013:EPD [610] Mirjana Mazuran, Edoardo Serra, and Carlo Zaniolo. Extending the power of datalog recursion. VLDB Journal: Very Large Data Bases, 22(4):471–493, August 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Galpin:2013:QAO [611] Ixent Galpin, Alvaro A. Fernandes, and Norman W. Paton. QoS-aware optimization of sensor network queries. VLDB Journal: Very Large Data Bases, 22(4):495–517, August 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Deutch:2013:TQW [612] Daniel Deutch, Tova Milo, and Neoklis Polyzotis. Top-k queries over Web applications. VLDB Journal: Very Large Data Bases, 22(4):519–542, August 2013. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Gao:2013:OSD [613] Jun Gao, Jeffrey Xu Yu, Ruoming Jin, Jiashuai Zhou, Tengjiao Wang, and Dongqing Yang. Outsourcing shortest distance computing with privacy protection. VLDB Journal: Very Large Data Bases, 22(4):543–559, August 2013. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Kalashnikov:2013:SEF [614] Dmitri V. Kalashnikov. Super-EGO: fast multi-dimensional similarity join. VLDB Journal: Very Large Data REFERENCES 117 Bases, 22(4):561–585, August 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Brambilla:2013:SIS 1066-8888 (print), 0949-877X (electronic). Demartini:2013:LSL [615] Marco Brambilla, Stefano Ceri, and Alon Halevy. Special issue on structured and crowd-sourced data on the Web. VLDB Journal: Very Large Data Bases, 22(5):587–588, October 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [619] Gianluca Demartini, Djellel Eddine Difallah, and Philippe Cudré-Mauroux. Large-scale linked data integration using probabilistic reasoning and crowdsourcing. VLDB Journal: Very Large Data Bases, 22(5):665–687, October 2013. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Goasdoue:2013:GTT Sagi:2013:SMP [616] François Goasdoué, Konstantinos Karanasos, Yannis Katsis, Julien Leblay, Ioana Manolescu, and Stamatis Zampetakis. Growing triples on trees: an XML–RDF hybrid model for annotated documents. VLDB Journal: Very Large Data Bases, 22(5):589–613, October 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [620] Tomer Sagi and Avigdor Gal. Schema matching prediction with applications to data source discovery and dynamic ensembling. VLDB Journal: Very Large Data Bases, 22(5):689–710, October 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Furche:2013:OKA [621] Jongwuk Lee, Hyunsouk Cho, JinWoo Park, Young-Rok Cha, SeungWon Hwang, Zaiqing Nie, and JiRong Wen. Hybrid entity clustering using crowds and data. VLDB Journal: Very Large Data Bases, 22 (5):711–726, October 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [617] Tim Furche, Georg Gottlob, Giovanni Grasso, Xiaonan Guo, Giorgio Orsi, and Christian Schallhart. The ontological key: automatically understanding and integrating forms to access the deep Web. VLDB Journal: Very Large Data Bases, 22(5):615–640, October 2013. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Bozzon:2013:ESF [618] Alessandro Bozzon, Marco Brambilla, Stefano Ceri, and Davide Mazza. Exploratory search framework for Web data sources. VLDB Journal: Very Large Data Bases, 22(5):641–663, October 2013. CODEN VLDBFR. ISSN Lee:2013:HEC Zhao:2013:EPG [622] Xiang Zhao, Chuan Xiao, Xuemin Lin, Wei Wang, and Yoshiharu Ishikawa. Efficient processing of graph similarity queries with edit distance constraints. VLDB Journal: Very Large Data Bases, 22(6):727–752, December 2013. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). REFERENCES 118 Gemulla:2013:NUI [623] Rainer Gemulla, Peter J. Haas, and Wolfgang Lehner. Non-uniformity issues and workarounds in bounded-size sampling. VLDB Journal: Very Large Data Bases, 22(6):753–772, December 2013. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Whang:2013:JER [624] Steven Euijong Whang and Hector Garcia-Molina. Joint entity resolution on multiple datasets. VLDB Journal: Very Large Data Bases, 22(6): 773–795, December 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Xu:2013:DPH [625] Jia Xu, Zhenjie Zhang, Xiaokui Xiao, Yin Yang, Ge Yu, and Marianne Winslett. Differentially private histogram publication. VLDB Journal: Very Large Data Bases, 22(6):797–822, December 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Fink:2013:AAP [626] Robert Fink, Jiewen Huang, and Dan Olteanu. Anytime approximation in probabilistic databases. VLDB Journal: Very Large Data Bases, 22(6): 823–848, December 2013. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Drosou:2013:YER [627] Marina Drosou and Evaggelia Pitoura. YmalDB: exploring relational databases via result-driven recommendations. VLDB Journal: Very Large Data Bases, 22(6):849–874, December 2013. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Johnson:2014:EUC [628] Ryan Johnson, Ippokratis Pandis, and Anastasia Ailamaki. Eliminating unscalable communication in transaction processing. VLDB Journal: Very Large Data Bases, 23(1):1–23, February 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhou:2014:EQP [629] Junfeng Zhou, Zhifeng Bao, Wei Wang, Jinjia Zhao, and Xiaofeng Meng. Efficient query processing for XML keyword queries based on the IDList index. VLDB Journal: Very Large Data Bases, 23(1):25–50, February 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Slavov:2014:GBA [630] Vasil Slavov and Praveen Rao. A gossip-based approach for Internetscale cardinality estimation of XPath queries over distributed semistructured data. VLDB Journal: Very Large Data Bases, 23(1):51–76, February 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Whang:2014:IER [631] Steven Euijong Whang and Hector Garcia-Molina. Incremental entity resolution on rules and data. VLDB Journal: Very Large Data Bases, 23 (1):77–102, February 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 119 Beskales:2014:SRC Angel:2014:DSM [632] George Beskales, Ihab F. Ilyas, Lukasz Golab, and Artur Galiullin. Sampling from repairs of conditional functional dependency violations. VLDB Journal: Very Large Data Bases, 23 (1):103–128, February 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [636] Albert Angel, Nick Koudas, Nikos Sarkas, Divesh Srivastava, Michael Svendsen, and Srikanta Tirthapura. Dense subgraph maintenance under streaming edge weight updates for real-time story identification. VLDB Journal: Very Large Data Bases, 23 (2):175–199, April 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-013-0340-z. Lee:2014:TEM [633] Jongwuk Lee and Seung-Won Hwang. Toward efficient multidimensional subspace skyline computation. VLDB Journal: Very Large Data Bases, 23 (1):129–145, February 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zellag:2014:CAM [634] Kamal Zellag and Bettina Kemme. Consistency anomalies in multi-tier architectures: automatic detection and prevention. VLDB Journal: Very Large Data Bases, 23(1):147–172, February 2014. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Ozsoyoglu:2014:SIB [635] Z. Meral Özsoyoğlu, Uğur Çetintemel, Nilesh Dalvi, Hank Korth, and Anthony Tung. Special issue on best papers of VLDB 2012. VLDB Journal: Very Large Data Bases, 23(2):173–174, April 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-0140356-z; http://link.springer. com/content/pdf/10.1007/s00778014-0356-z.pdf. Das:2014:EFE [637] Mahashweta Das, Saravanan Thirumuruganathan, Sihem Amer-Yahia, Gautam Das, and Cong Yu. An expressive framework and efficient algorithms for the analysis of collaborative tagging. VLDB Journal: Very Large Data Bases, 23(2):201–226, April 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-0130341-y. Cheng:2014:EPH [638] James Cheng, Zechao Shang, Hong Cheng, Haixun Wang, and Jeffrey Xu Yu. Efficient processing of k-hop reachability queries. VLDB Journal: Very Large Data Bases, 23(2):227–252, April 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-0130346-6. Koch:2014:DHO [639] Christoph Koch, Yanif Ahmad, Oliver Kennedy, Milos Nikolic, Andres Nötzli, REFERENCES 120 Daniel Lupei, and Amir Shaikhha. DBToaster: higher-order delta processing for dynamic, frequently fresh views. VLDB Journal: Very Large Data Bases, 23(2):253–278, April 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-0130348-4. Bailis:2014:QEC [640] Peter Bailis, Shivaram Venkataraman, Michael J. Franklin, Joseph M. Hellerstein, and Ion Stoica. Quantifying eventual consistency with PBS. VLDB Journal: Very Large Data Bases, 23 (2):279–302, April 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-013-0330-1. Graefe:2014:TSA [641] Goetz Graefe, Felix Halim, Stratos Idreos, Harumi Kuno, Stefan Manegold, and Bernhard Seeger. Transactional support for adaptive indexing. VLDB Journal: Very Large Data Bases, 23(2):303–328, April 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-0130345-7. Zhang:2014:TCE [642] Ning Zhang, Junichi Tatemura, Jignesh M. Patel, and Hakan Hacigumus. Toward cost-effective storage provisioning for DBMSs. VLDB Journal: Very Large Data Bases, 23(2):329–354, April 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-0130334-x. Doulkeridis:2014:SLS [643] Christos Doulkeridis and Kjetil Nørvåg. A survey of large-scale analytical query processing in MapReduce. VLDB Journal: Very Large Data Bases, 23(3):355– 380, June 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhou:2014:EDT [644] Xiangmin Zhou and Lei Chen. Event detection over Twitter social media streams. VLDB Journal: Very Large Data Bases, 23(3):381–400, June 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Hung:2014:QTB [645] Ho Hoang Hung, Sourav S. Bhowmick, Ba Quan Truong, Byron Choi, and Shuigeng Zhou. QUBLE: towards blending interactive visual subgraph search queries on large networks. VLDB Journal: Very Large Data Bases, 23(3):401–426, June 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Teodoro:2014:ASS [646] George Teodoro, Eduardo Valle, Nathan Mariano, Ricardo Torres, Wagner Meira, Jr., and Joel H. Saltz. Approximate similarity search for online multimedia services on distributed CPU–GPU platforms. VLDB Journal: Very Large Data Bases, 23(3):427–448, June 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 121 Shang:2014:PTM [647] Shuo Shang, Ruogu Ding, Kai Zheng, Christian S. Jensen, Panos Kalnis, and Xiaofang Zhou. Personalized trajectory matching in spatial networks. VLDB Journal: Very Large Data Bases, 23 (3):449–468, June 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zou:2014:GGB [652] Lei Zou, M. Tamer Özsu, Lei Chen, Xuchuan Shen, Ruizhe Huang, and Dongyan Zhao. gStore: a graphbased SPARQL query engine. VLDB Journal: Very Large Data Bases, 23 (4):565–590, August 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Richter:2014:TZO [648] Stefan Richter, Jorge-Arnulfo QuianéRuiz, Stefan Schuh, and Jens Dittrich. Towards zero-overhead static and adaptive indexing in Hadoop. VLDB Journal: Very Large Data Bases, 23 (3):469–494, June 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Meier:2014:BR [649] Michael Meier. The backchase revisited. VLDB Journal: Very Large Data Bases, 23(3):495–516, June 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Gedik:2014:PFS [650] Bugra Gedik. Partitioning functions for stateful data parallelism in stream processing. VLDB Journal: Very Large Data Bases, 23(4):517–539, August 2014. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Koh:2014:FKM [651] Jia-Ling Koh, Chen-Yi Lin, and Arbee L. Chen. Finding kk most favorite products based on reverse toptt queries. VLDB Journal: Very Large Data Bases, 23(4):541–564, August 2014. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Tao:2014:ILW [653] Yufei Tao, Yi Yang, Xiaocheng Hu, Cheng Sheng, and Shuigeng Zhou. Instance-level worst-case query bounds on R-trees. VLDB Journal: Very Large Data Bases, 23(4):591–607, August 2014. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Cicek:2014:ELD [654] A. Ercument Cicek, Mehmet Ercan Nergiz, and Yucel Saygin. Ensuring location diversity in privacypreserving spatio-temporal data publishing. VLDB Journal: Very Large Data Bases, 23(4):609–625, August 2014. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Unterbrunner:2014:HAE [655] Philipp Unterbrunner, Gustavo Alonso, and Donald Kossmann. High availability, elasticity, and strong consistency for massively parallel scans over relational data. VLDB Journal: Very Large Data Bases, 23(4):627–652, August 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 122 Chen:2014:CND [656] Rui Chen, Benjamin C. Fung, Philip S. Yu, and Bipin C. Desai. Correlated network data publication via differential privacy. VLDB Journal: Very Large Data Bases, 23(4):653–676, August 2014. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Xiang:2014:AED [657] Yang Xiang. Answering exact distance queries on real-world graphs with bounded performance guarantees. VLDB Journal: Very Large Data Bases, 23(5):677–695, October 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yao:2014:DMO [658] Bin Yao, Xiaokui Xiao, Feifei Li, and Yifan Wu. Dynamic monitoring of optimal locations in road network databases. VLDB Journal: Very Large Data Bases, 23(5):697–720, October 2014. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Tran:2014:QRE [659] Quoc Trung Tran, Chee-Yong Chan, and Srinivasan Parthasarathy. Query reverse engineering. VLDB Journal: Very Large Data Bases, 23(5):721–746, October 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Martinenghi:2014:TBR [660] Davide Martinenghi and Riccardo Torlone. Taxonomy-based relaxation of query answering in relational databases. VLDB Journal: Very Large Data Bases, 23(5):747–769, October 2014. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Soria-Comas:2014:EDU [661] Jordi Soria-Comas, Josep DomingoFerrer, David Sánchez, and Sergio Martı́nez. Enhancing data utility in differential privacy via microaggregationbased k-anonymity. VLDB Journal: Very Large Data Bases, 23(5):771–794, October 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Magnani:2014:TBP [662] Matteo Magnani, Ira Assent, and Michael L. Mortensen. Taking the Big Picture: representative skylines based on significance and diversity. VLDB Journal: Very Large Data Bases, 23 (5):795–815, October 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Sidlauskas:2014:PEM [663] Darius Šidlauskas, Simonas Šaltenis, and Christian S. Jensen. Processing of extreme moving-object update and query workloads in main memory. VLDB Journal: Very Large Data Bases, 23(5):817–841, October 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Aboulnaga:2014:SSD [664] Ashraf Aboulnaga, Beng Chin Ooi, and Patrick Valduriez. Special section on data-intensive cloud infrastructure. VLDB Journal: Very Large Data Bases, 23(6):843, December 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 123 Kumar:2014:SWA Alexandrov:2014:SPB [665] K. Ashwin Kumar, Abdul Quamar, Amol Deshpande, and Samir Khuller. SWORD: workload-aware data placement and replica selection for cloud data management systems. VLDB Journal: Very Large Data Bases, 23 (6):845–870, December 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [669] Alexander Alexandrov, Rico Bergmann, Stephan Ewen, Johann-Christoph Freytag, Fabian Hueske, Arvid Heise, Odej Kao, Marcus Leich, Ulf Leser, Volker Markl, Felix Naumann, Mathias Peters, Astrid Rheinländer, Matthias J. Sax, Sebastian Schelter, Mareike Höger, Kostas Tzoumas, and Daniel Warneke. The Stratosphere platform for big data analytics. VLDB Journal: Very Large Data Bases, 23(6): 939–964, December 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Sahli:2014:ASP [666] Majed Sahli, Essam Mansour, and Panos Kalnis. ACME: a scalable parallel system for extracting frequent patterns from a very long sequence. VLDB Journal: Very Large Data Bases, 23 (6):871–893, December 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lo:2014:MGD [667] Eric Lo, Nick Cheng, Wilfred W. Lin, Wing-Kai Hon, and Byron Choi. MyBenchmark: generating databases for query workloads. VLDB Journal: Very Large Data Bases, 23(6):895–913, December 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Xie:2014:MEB [668] Qing Xie, Chaoyi Pang, Xiaofang Zhou, Xiangliang Zhang, and Ke Deng. Maximum error-bounded Piecewise Linear Representation for online stream approximation. VLDB Journal: Very Large Data Bases, 23(6): 915–937, December 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Ward:2014:RTC [670] Phillip G. Ward, Zhen He, Rui Zhang, and Jianzhong Qi. Real-time continuous intersection joins over large sets of moving objects using graphic processing units. VLDB Journal: Very Large Data Bases, 23(6):965–985, December 2014. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Binnig:2014:DSI [671] Carsten Binnig, Stefan Hildenbrand, Franz Färber, Donald Kossmann, Juchang Lee, and Norman May. Distributed snapshot isolation: global transactions pay globally, local transactions pay locally. VLDB Journal: Very Large Data Bases, 23(6):987–1011, December 2014. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Vlachos:2015:CMF [672] Michail Vlachos, Nikolaos M. Freris, and Anastasios Kyrillidis. Compressive mining: fast and optimal data mining in the compressed domain. VLDB REFERENCES 124 Journal: Very Large Data Bases, 24 (1):1–24, February 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Sistla:2015:CNN [673] A. Prasad Sistla, Ouri Wolfson, and Bo Xu. Continuous nearest-neighbor queries with location uncertainty. VLDB Journal: Very Large Data Bases, 24(1):25–50, February 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Gur:2015:SFA [674] Izzeddin Gür, Mehmet Güvercin, and Hakan Ferhatosmanoglu. Scaling forecasting algorithms using clustered modeling. VLDB Journal: Very Large Data Bases, 24(1):51–65, February 2015. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Kaoudi:2015:RCS [675] Zoi Kaoudi and Ioana Manolescu. RDF in the clouds: a survey. VLDB Journal: Very Large Data Bases, 24 (1):67–91, February 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Su:2015:CTD [676] Han Su, Kai Zheng, Jiamin Huang, Haozhou Wang, and Xiaofang Zhou. Calibrating trajectory data for spatiotemporal similarity analysis. VLDB Journal: Very Large Data Bases, 24 (1):93–116, February 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Li:2015:CAI [677] Hui Li, Sourav S. Bhowmick, Aixin Sun, and Jiangtao Cui. Conformityaware influence maximization in online social networks. VLDB Journal: Very Large Data Bases, 24(1): 117–141, February 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Deng:2015:UFA [678] Dong Deng, Guoliang Li, Jianhua Feng, Yi Duan, and Zhiguo Gong. A unified framework for approximate dictionarybased entity extraction. VLDB Journal: Very Large Data Bases, 24(1): 143–167, February 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Hung:2015:CAC [679] Chih-Chieh Hung, Wen-Chih Peng, and Wang-Chien Lee. Clustering and aggregating clues of trajectories for mining trajectory patterns and routes. VLDB Journal: Very Large Data Bases, 24(2):169–192, April 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Eichinger:2015:TSC [680] Frank Eichinger, Pavel Efros, Stamatis Karnouskos, and Klemens Böhm. A time-series compression technique and its application to the smart grid. VLDB Journal: Very Large Data Bases, 24 (2):193–218, April 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Xue:2015:SDS [681] Andy Yuan Xue, Jianzhong Qi, Xing Xie, Rui Zhang, Jin Huang, and Yuan REFERENCES 125 Li. Solving the data sparsity problem in destination prediction. VLDB Journal: Very Large Data Bases, 24 (2):219–243, April 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhang:2015:ECS [682] Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin, Lijun Chang, and Xuemin Lin. I/O efficient: computing SCCs in massive graphs. VLDB Journal: Very Large Data Bases, 24(2):245–270, April 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yuan:2015:GSS [683] Ye Yuan, Guoren Wang, Lei Chen, and Haixun Wang. Graph similarity search on large uncertain graph databases. VLDB Journal: Very Large Data Bases, 24(2):271–296, April 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yang:2015:TPC [684] Bin Yang, Chenjuan Guo, Yu Ma, and Christian S. Jensen. Toward personalized, context-aware routing. VLDB Journal: Very Large Data Bases, 24 (2):297–318, April 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Huang:2015:TKS [685] Xin Huang, Hong Cheng, Rong-Hua Li, Lu Qin, and Jeffrey Xu Yu. TopK structural diversity search in large networks. VLDB Journal: Very Large Data Bases, 24(3):319–343, June 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Papapetrou:2015:SDS [686] Odysseas Papapetrou, Minos Garofalakis, and Antonios Deligiannakis. Sketching distributed sliding-window data streams. VLDB Journal: Very Large Data Bases, 24(3):345–368, June 2015. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Yuan:2015:EDS [687] Ye Yuan, Guoren Wang, Jeffery Yu Xu, and Lei Chen. Efficient distributed subgraph similarity matching. VLDB Journal: Very Large Data Bases, 24 (3):369–394, June 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Mirylenka:2015:CHH [688] Katsiaryna Mirylenka, Graham Cormode, Themis Palpanas, and Divesh Srivastava. Conditional heavy hitters: detecting interesting correlations in data streams. VLDB Journal: Very Large Data Bases, 24(3):395–414, June 2015. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Gao:2015:ECP [689] Yunjun Gao, Lu Chen, Xinhan Li, Bin Yao, and Gang Chen. Efficient kkclosest pair queries in general metric spaces. VLDB Journal: Very Large Data Bases, 24(3):415–439, June 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Aksoy:2015:RPE [690] Cem Aksoy, Aggeliki Dimitriou, and Dimitri Theodoratos. Reasoning with patterns to effectively answer XML keyword queries. VLDB Journal: Very REFERENCES 126 Large Data Bases, 24(3):441–465, June 2015. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). August 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Roy:2015:TAO Abedjan:2015:PRD [691] Senjuti Basu Roy, Ioanna Lykourentzou, Saravanan Thirumuruganathan, Sihem Amer-Yahia, and Gautam Das. Task assignment optimization in knowledge-intensive crowdsourcing. VLDB Journal: Very Large Data Bases, 24(4):467–491, August 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [695] Ziawasch Abedjan, Lukasz Golab, and Felix Naumann. Profiling relational data: a survey. VLDB Journal: Very Large Data Bases, 24(4):557–581, August 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Deutch:2015:PBA Bao:2015:GFR [692] Zhifeng Bao, Yong Zeng, Tok Wang Ling, Dongxiang Zhang, Guoliang Li, and H. V. Jagadish. A general framework to resolve the MisMatch problem in XML keyword search. VLDB Journal: Very Large Data Bases, 24 (4):493–518, August 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [696] Daniel Deutch, Yuval Moskovitch, and Val Tannen. Provenance-based analysis of data-centric processes. VLDB Journal: Very Large Data Bases, 24 (4):583–607, August 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Bohlen:2015:SIB [697] Michael H. Böhlen and Christoph Koch. Special issue on best papers [693] Alexios Kotsifakos, Isak Karlsson, of VLDB 2013. VLDB Journal: Very Panagiotis Papapetrou, Vassilis AthitLarge Data Bases, 24(5):609–610, Ocsos, and Dimitrios Gunopulos. Embeddingtober 2015. CODEN VLDBFR. ISSN based subsequence matching with gaps 1066-8888 (print), 0949-877X (elec— range — tolerances: a Query-Bytronic). Humming application. VLDB Journal: Very Large Data Bases, 24(4):519–536, Yan:2015:ALK August 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (elec- [698] Zhepeng Yan, Nan Zheng, Zachary G. tronic). Ives, Partha Pratim Talukdar, and Cong Yu. Active learning in keyword Skovsgaard:2015:FTR search-based data integration. VLDB [694] Anders Skovsgaard and Christian S. Journal: Very Large Data Bases, 24 Jensen. Finding top-k relevant groups (5):611–631, October 2015. CODEN of spatial web objects. VLDB Journal: VLDBFR. ISSN 1066-8888 (print), Very Large Data Bases, 24(4):537–555, 0949-877X (electronic). Kotsifakos:2015:EBS REFERENCES 127 Zou:2015:CDA [699] Tao Zou, Ronan Bras, Marcos Vaz Salles, Alan Demers, and Johannes Gehrke. ClouDiA: a deployment advisor for public clouds. VLDB Journal: Very Large Data Bases, 24(5):633– 653, October 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhu:2015:SAP [700] Fanwei Zhu, Yuan Fang, Kevin ChenChuan Chang, and Jing Ying. Scheduled approximation for Personalized PageRank with Utility-based Hub Selection. VLDB Journal: Very Large Data Bases, 24(5):655–679, October 2015. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Ren:2015:VLM [701] Kun Ren, Alexander Thomson, and Daniel J. Abadi. VLL: a lock manager redesign for main memory database systems. VLDB Journal: Very Large Data Bases, 24(5):681–705, October 2015. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Galarraga:2015:FRM [702] Luis Galárraga, Christina Teflioudi, Katja Hose, and Fabian M. Suchanek. Fast rule mining in ontological knowledge bases with AMIE++. VLDB Journal: Very Large Data Bases, 24 (6):707–730, December 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chandra:2015:DGT [703] Bikash Chandra, Bhupesh Chawda, Biplab Kar, K. V. Reddy, Shetal Shah, and S. Sudarshan. Data generation for testing and grading SQL queries. VLDB Journal: Very Large Data Bases, 24(6):731–755, December 2015. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Li:2015:MMO [704] Chao Li, Gerome Miklau, Michael Hay, Andrew Mcgregor, and Vibhor Rastogi. The matrix mechanism: optimizing linear counting queries under differential privacy. VLDB Journal: Very Large Data Bases, 24(6):757–781, December 2015. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Armenatzoglou:2015:GSR [705] Nikos Armenatzoglou, Ritesh Ahuja, and Dimitris Papadias. Geo-Social Ranking: functions and query processing. VLDB Journal: Very Large Data Bases, 24(6):783–799, December 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Santini:2015:QSU [706] Simone Santini. Querying streams using regular expressions: some semantics, decidability, and efficiency issues. VLDB Journal: Very Large Data Bases, 24(6):801–821, December 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wang:2015:ATE [707] Xiang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin, and Wei Wang. AP-Tree: efficiently support locationaware Publish/Subscribe. VLDB Journal: Very Large Data Bases, 24(6): 823–848, December 2015. CODEN REFERENCES 128 VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Basik:2015:STS [708] Fuat Basık, Buğra Gedik, Hakan Ferhatosmanoğlu, and Mert Emin Kalender. S33 -TM: scalable streaming short text matching. VLDB Journal: Very Large Data Bases, 24(6):849–866, December 2015. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Jagadish:2016:SIB [709] H. V. Jagadish and Aoying Zhou. Special issue on best papers of VLDB 2014. VLDB Journal: Very Large Data Bases, 25(1):1–2, February 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Jiang:2016:EES [710] Dawei Jiang, Sai Wu, Gang Chen, Beng Chin Ooi, Kian-Lee Tan, and Jun Xu. epiC: an extensible and scalable system for processing Big Data. VLDB Journal: Very Large Data Bases, 25 (1):3–26, February 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Schuhknecht:2016:EEA [711] Felix Martin Schuhknecht, Alekh Jindal, and Jens Dittrich. An experimental evaluation and analysis of database cracking. VLDB Journal: Very Large Data Bases, 25(1):27–52, February 2016. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Jugel:2016:VAV [712] Uwe Jugel, Zbigniew Jerzak, Gregor Hackenbroich, and Volker Markl. VDDA: automatic visualization-driven data aggregation in relational databases. VLDB Journal: Very Large Data Bases, 25(1):53–77, February 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wang:2016:EDL [713] Wei Wang, Xiaoyan Yang, Beng Chin Ooi, Dongxiang Zhang, and Yueting Zhuang. Effective deep learningbased multi-modal retrieval. VLDB Journal: Very Large Data Bases, 25 (1):79–101, February 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Funke:2016:KPC [714] Stefan Funke, André Nusser, and Sabine Storandt. On k-Path Covers and their applications. VLDB Journal: Very Large Data Bases, 25 (1):103–123, February 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Quamar:2016:NNC [715] Abdul Quamar, Amol Deshpande, and Jimmy Lin. NScale: neighborhoodcentric large-scale graph analytics in the cloud. VLDB Journal: Very Large Data Bases, 25(2):125–150, April 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Soule:2016:RAS [716] Robert Soulé and Bugra Gedik. RailwayDB: adaptive storage of interaction graphs. VLDB Journal: Very Large Data Bases, 25(2):151–169, April 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 129 Yuan:2016:DTK [717] Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, and Wenjie Zhang. Diversified top-k clique search. VLDB Journal: Very Large Data Bases, 25 (2):171–196, April 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Pham:2016:ACW [718] Thao N. Pham, Panos K. Chrysanthis, and Alexandros Labrinidis. Avoiding class warfare: managing continuous queries with differentiated classes of service. VLDB Journal: Very Large Data Bases, 25(2):197–221, April 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Langer:2016:EOD [719] Philipp Langer and Felix Naumann. Efficient order dependency detection. VLDB Journal: Very Large Data Bases, 25(2):223–241, April 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Peng:2016:PSQ [720] Peng Peng, Lei Zou, M. Tamer Özsu, Lei Chen, and Dongyan Zhao. Processing SPARQL queries over distributed RDF graphs. VLDB Journal: Very Large Data Bases, 25(2):243–268, April 2016. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Gao:2016:TCP [721] Jun Gao, Chang Zhou, and Jeffrey Xu Yu. Toward continuous pattern detection over evolving large graph with snapshot isolation. VLDB Journal: Very Large Data Bases, 25(2):269–290, April 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Baumann:2016:BDC [722] Stephan Baumann, Peter Boncz, and Kai-Uwe Sattler. Bitwise dimensional co-clustering for analytical workloads. VLDB Journal: Very Large Data Bases, 25(3):291–316, June 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Li:2016:EAF [723] Feifei Li, Ke Yi, Yufei Tao, Bin Yao, Yang Li, Dong Xie, and Min Wang. Exact and approximate flexible aggregate similarity search. VLDB Journal: Very Large Data Bases, 25(3):317–338, June 2016. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Guzun:2016:HQO [724] Gheorghi Guzun and Guadalupe Canahuate. Hybrid query optimization for hard-to-compress bit-vectors. VLDB Journal: Very Large Data Bases, 25(3):339–354, June 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Harbi:2016:ASQ [725] Razen Harbi, Ibrahim Abdelaziz, Panos Kalnis, Nikos Mamoulis, Yasser Ebrahim, and Majed Sahli. Accelerating SPARQL queries by exploiting hash-based locality and adaptive partitioning. VLDB Journal: Very Large Data Bases, 25(3):355–380, June 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 130 Bonifati:2016:MEO [726] Angela Bonifati, Werner Nutt, Riccardo Torlone, and Jan Van Den Bussche. Mapping-equivalence and oidequivalence of single-function objectcreating conjunctive queries. VLDB Journal: Very Large Data Bases, 25 (3):381–397, June 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lu:2016:DCE [727] Yue Lu, Yuguan Li, and Mohamed Y. Eltabakh. Decorating the cloud: enabling annotation management in MapReduce. VLDB Journal: Very Large Data Bases, 25(3):399–424, June 2016. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Sariyuce:2016:IKC [728] Ahmet Erdem Sariyüce, Bugra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, and Ümit V. Çatalyürek. Incremental k-core decomposition: algorithms and evaluation. VLDB Journal: Very Large Data Bases, 25(3):425–447, June 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Luo:2016:QDS [729] Ge Luo, Lu Wang, Ke Yi, and Graham Cormode. Quantiles over data streams: experimental comparisons, new analyses, and further improvements. VLDB Journal: Very Large Data Bases, 25 (4):449–472, August 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Xie:2016:EEI [730] Xike Xie, Benjin Mei, Jinchuan Chen, Xiaoyong Du, and Christian S. Jensen. Elite: an elastic infrastructure for big spatiotemporal trajectories. VLDB Journal: Very Large Data Bases, 25 (4):473–493, August 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Kanza:2016:ESF [731] Yaron Kanza and Hadas Yaari. External sorting on flash storage: reducing cell wearing and increasing efficiency by avoiding intermediate writes. VLDB Journal: Very Large Data Bases, 25 (4):495–518, August 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Jeon:2016:MBS [732] Inah Jeon, Evangelos E. Papalexakis, Christos Faloutsos, Lee Sael, and U. Kang. Mining billion-scale tensors: algorithms and discoveries. VLDB Journal: Very Large Data Bases, 25 (4):519–544, August 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Islam:2016:KYC [733] Md. Saiful Islam and Chengfei Liu. Know your customer: computing kmost promising products for targeted marketing. VLDB Journal: Very Large Data Bases, 25(4):545–570, August 2016. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Kohler:2016:PCK [734] Henning Köhler, Uwe Leck, Sebastian Link, and Xiaofang Zhou. Possible and certain keys for SQL. VLDB Journal: Very Large Data Bases, 25 (4):571–596, August 2016. CODEN REFERENCES 131 VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Mottin:2016:HPA [735] Davide Mottin, Alice Marascu, Senjuti Basu Roy, Gautam Das, Themis Palpanas, and Yannis Velegrakis. A holistic and principled approach for the empty-answer problem. VLDB Journal: Very Large Data Bases, 25 (4):597–622, August 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Boncz:2016:SIM [736] Peter Boncz, Wolfgang Lehner, and Thomas Neumann. Special issue: Modern hardware. VLDB Journal: Very Large Data Bases, 25(5):623–624, October 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Porobic:2016:CIH [737] Danica Porobic, Ippokratis Pandis, Miguel Branco, Pinar Tözün, and Anastasia Ailamaki. Characterization of the impact of hardware islands on OLTP. VLDB Journal: Very Large Data Bases, 25(5):625–650, October 2016. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Sadoghi:2016:ESO [738] Mohammad Sadoghi, Kenneth A. Ross, Mustafa Canim, and Bishwaranjan Bhattacharjee. Exploiting SSDs in operational multiversion databases. VLDB Journal: Very Large Data Bases, 25(5):651–672, October 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Kang:2016:FCE [739] Woon-Hak Kang, Sang-Won Lee, and Bongki Moon. Flash as cache extension for online transactional workloads. VLDB Journal: Very Large Data Bases, 25(5):673–694, October 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Jin:2016:RWO [740] Peiquan Jin, Chengcheng Yang, Christian S. Jensen, Puyuan Yang, and Lihua Yue. Read/write-optimized tree indexing for solid-state drives. VLDB Journal: Very Large Data Bases, 25 (5):695–717, October 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Sitaridi:2016:GAS [741] Evangelia A. Sitaridi and Kenneth A. Ross. GPU-accelerated string matching for database applications. VLDB Journal: Very Large Data Bases, 25 (5):719–740, October 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Mottin:2016:EQN [742] Davide Mottin, Matteo Lissandrini, Yannis Velegrakis, and Themis Palpanas. Exemplar queries: a new way of searching. VLDB Journal: Very Large Data Bases, 25(6):741–765, December 2016. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Li:2016:EDL [743] Yuhong Li, Leong Hou U., Man Lung Yiu, and Zhiguo Gong. Efficient discovery of longest-lasting correlation REFERENCES 132 in sequence databases. VLDB Journal: Very Large Data Bases, 25(6): 767–790, December 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Fakas:2016:DPS [744] Georgios J. Fakas, Zhi Cai, and Nikos Mamoulis. Diverse and proportional size-l object summaries using pairwise relevance. VLDB Journal: Very Large Data Bases, 25(6):791–816, December 2016. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). BOgh:2016:SPW [745] Kenneth S. BØgh, Sean Chester, and Ira Assent. SkyAlign: a portable, workefficient skyline algorithm for multicore and GPU architectures. VLDB Journal: Very Large Data Bases, 25 (6):817–841, December 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zoumpatianos:2016:AAD [746] Kostas Zoumpatianos, Stratos Idreos, and Themis Palpanas. ADS: the adaptive data series index. VLDB Journal: Very Large Data Bases, 25(6): 843–866, December 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Liu:2016:AWW [747] Qing Liu, Yunjun Gao, Gang Chen, Baihua Zheng, and Linlin Zhou. Answering why-not and why questions on reverse top-k queries. VLDB Journal: Very Large Data Bases, 25(6): 867–892, December 2016. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chen:2016:SSL [748] Yang Chen, Daisy Zhe Wang, and Sean Goldberg. ScaLeKB: scalable learning and inference over large knowledge bases. VLDB Journal: Very Large Data Bases, 25(6):893–918, December 2016. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Li:2017:SIB [749] Chen Li and Volker Markl. Special issue on best papers of VLDB 2015. VLDB Journal: Very Large Data Bases, 26(1):1–2, February 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). See erratum [750]. Li:2017:ESI [750] Chen Li and Volker Markl. Erratum to: Special issue on best papers of VLDB 2015. VLDB Journal: Very Large Data Bases, 26(1):3, February 2017. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). See [749]. Gatterbauer:2017:DPA [751] Wolfgang Gatterbauer and Dan Suciu. Dissociation and propagation for approximate lifted inference with standard relational database management systems. VLDB Journal: Very Large Data Bases, 26(1):5–30, February 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Li:2017:RBR [752] Jiexing Li, Jeffrey F. Naughton, and Rimma V. Nehme. Resource bricolage and resource selection for parallel database systems. VLDB Journal: REFERENCES 133 Very Large Data Bases, 26(1):31–54, February 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). (1):125–150, February 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yang:2017:RKN Finis:2017:OIS [753] Jan Finis, Robert Brunel, Alfons Kemper, Thomas Neumann, Norman May, and Franz Faerber. Order Indexes: supporting highly dynamic hierarchical data in relational main-memory database systems. VLDB Journal: Very Large Data Bases, 26(1):55–80, February 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Sa:2017:IKB [754] Christopher Sa, Alex Ratner, Christopher Ré, Jaeho Shin, Feiran Wang, Sen Wu, and Ce Zhang. Incremental knowledge base construction using DeepDive. VLDB Journal: Very Large Data Bases, 26(1):81–105, February 2017. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Trummer:2017:MOP [757] Shiyu Yang, Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang, and Wenjie Zhang. Reverse k nearest neighbors queries and spatial reverse top-k queries. VLDB Journal: Very Large Data Bases, 26(2):151–176, April 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Li:2017:DBQ [758] Kun Li, Xiaofeng Zhou, Daisy Zhe Wang, Christan Grant, Alin Dobra, and Christopher Dudley. In-database batch and query-time inference over probabilistic graphical models using UDA — GIST. VLDB Journal: Very Large Data Bases, 26(2):177–201, April 2017. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Xie:2017:PTP [755] Immanuel Trummer and Christoph Koch. Multi-objective parametric query optimization. VLDB Journal: Very Large Data Bases, 26(1):107–124, February 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [759] Miao Xie, Sourav S. Bhowmick, Gao Cong, and Qing Wang. PANDA: toward partial topology-based search on large networks in a single machine. VLDB Journal: Very Large Data Bases, 26(2):203–228, April 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Khayyat:2017:FSI Yang:2017:SPM [756] Zuhair Khayyat, William Lucia, Meghna Singh, Mourad Ouzzani, Paolo Papotti, Jorge-Arnulfo Quiané-Ruiz, Nan Tang, and Panos Kalnis. Fast and scalable inequality joins. VLDB Journal: Very Large Data Bases, 26 [760] Mohan Yang, Alexander Shkapsky, and Carlo Zaniolo. Scaling up the performance of more powerful Datalog systems on multicore machines. VLDB Journal: Very Large Data Bases, 26 (2):229–248, April 2017. CODEN REFERENCES 134 VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yu:2017:UFS [761] Minghe Yu, Jin Wang, Guoliang Li, Yong Zhang, Dong Deng, and Jianhua Feng. A unified framework for string similarity search with edit-distance constraint. VLDB Journal: Very Large Data Bases, 26(2):249–274, April 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yuan:2017:EEG [762] Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, and Wenjie Zhang. I/O efficient ECC graph decomposition via graph reduction. VLDB Journal: Very Large Data Bases, 26(2):275–300, April 2017. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Wang:2017:TKS [763] Xiang Wang, Wenjie Zhang, Ying Zhang, Xuemin Lin, and Zengfeng Huang. Top-k spatial-keyword publish/ subscribe over sliding window. VLDB Journal: Very Large Data Bases, 26 (3):301–326, June 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Gao:2017:PBH [764] Jun Gao, Yuqiong Liu, Chang Zhou, and Jeffrey Xu Yu. Path-based holistic detection plan for multiple patterns in distributed graph frameworks. VLDB Journal: Very Large Data Bases, 26 (3):327–345, June 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yi:2017:AVQ [765] Peipei Yi, Byron Choi, Sourav S. Bhowmick, and Jianliang Xu. AutoG: a visual query autocompletion framework for graph databases. VLDB Journal: Very Large Data Bases, 26 (3):347–372, June 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Aljubayrin:2017:FLC [766] Saad Aljubayrin, Jianzhong Qi, Christian S. Jensen, Rui Zhang, Zhen He, and Yuan Li. Finding lowest-cost paths in settings with safe and preferred zones. VLDB Journal: Very Large Data Bases, 26(3):373–397, June 2017. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Zhang:2017:DSP [767] Dongxiang Zhang, Dingyu Yang, Yuan Wang, Kian-Lee Tan, Jian Cao, and Heng Tao Shen. Distributed shortest path query processing on dynamic road networks. VLDB Journal: Very Large Data Bases, 26(3):399–419, June 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lai:2017:SSE [768] Longbin Lai, Lu Qin, Xuemin Lin, and Lijun Chang. Scalable subgraph enumeration in MapReduce: a costoriented approach. VLDB Journal: Very Large Data Bases, 26(3):421–446, June 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Cafagna:2017:DIP [769] Francesco Cafagna and Michael H. Böhlen. Disjoint interval partition- REFERENCES 135 ing. VLDB Journal: Very Large Data Bases, 26(3):447–466, June 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Bases, 26(4):537–562, August 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). See erratum [825]. Gao:2017:EFR Zhu:2017:EAT [770] Yunjun Gao, Xiaoye Miao, Gang Chen, Baihua Zheng, Deng Cai, and Huiyong Cui. On efficiently finding reverse k-nearest neighbors over uncertain graphs. VLDB Journal: Very Large Data Bases, 26(4):467–492, August 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [774] Qiankun Zhu, Hong Cheng, and Xin Huang. I/O-efficient algorithms for top-k nearest keyword search in massive graphs. VLDB Journal: Very Large Data Bases, 26(4):563–583, August 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Tao:2017:SSW [771] Yufei Tao, Xiaocheng Hu, and Miao Qiao. Stream sampling over windows with worst-case optimality and `overlap independence. VLDB Journal: Very Large Data Bases, 26(4):493–510, August 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chen:2017:IMU [775] Lu Chen, Yunjun Gao, Aoxiao Zhong, Christian S. Jensen, Gang Chen, and Baihua Zheng. Indexing metric uncertain data for range queries and range joins. VLDB Journal: Very Large Data Bases, 26(4):585–610, August 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Nguyen:2017:ADC Song:2017:GRU [772] Quoc Viet Nguyen, Chi Thang Duong, Thanh Tam Nguyen, Matthias Weidlich, Karl Aberer, Hongzhi Yin, and Xiaofang Zhou. Argument discovery via crowdsourcing. VLDB Journal: Very Large Data Bases, 26(4):511–535, August 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [776] Shaoxu Song, Boge Liu, Hong Cheng, Jeffrey Xu Yu, and Lei Chen. Graph repairing under neighborhood constraints. VLDB Journal: Very Large Data Bases, 26(5):611–635, October 2017. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Wang:2017:EMA [777] Xiangmin Zhou, Lei Chen, Yanchun Zhang, Dong Qin, Longbing Cao, Guangyan Huang, and Chen Wang. Enhancing online video recommendation using social user interactions. VLDB Journal: Very Large Data Bases, 26(5):637–656, October 2017. [773] Tianzheng Wang, Ryan Johnson, Alan Fekete, and Ippokratis Pandis. Efficiently making (almost) any concurrency control mechanism serializable. VLDB Journal: Very Large Data Zhou:2017:EOV REFERENCES 136 CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Attasena:2017:SSC [778] Varunya Attasena, Jérôme Darmont, and Nouria Harbi. Secret sharing for cloud data security: a survey. VLDB Journal: Very Large Data Bases, 26 (5):657–681, October 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Huang:2017:QAL [779] Qiang Huang, Jianlin Feng, Qiong Fang, Wilfred Ng, and Wei Wang. Query-aware locality-sensitive hashing scheme for lp norm. VLDB Journal: Very Large Data Bases, 26(5):683– 708, October 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhu:2017:GSG [780] Qijun Zhu, Haibo Hu, Cheng Xu, Jianliang Xu, and Wang-Chien Lee. Geo-social group queries with minimum acquaintance constraints. VLDB Journal: Very Large Data Bases, 26 (5):709–727, October 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhang:2017:DMK [781] Kai Zhang, Kaibo Wang, Yuan Yuan, Lei Guo, Rubao Li, Xiaodong Zhang, Bingsheng He, Jiayu Hu, and Bei Hua. A distributed in-memory keyvalue store system on heterogeneous CPU–GPU cluster. VLDB Journal: Very Large Data Bases, 26(5):729–750, October 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Li:2017:FIC [782] Rong-Hua Li, Lu Qin, Jeffrey Xu Yu, and Rui Mao. Finding influential communities in massive networks. VLDB Journal: Very Large Data Bases, 26 (6):751–776, December 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Ali:2017:CDP [783] Syed Muhammad Ali and Robert Wrembel. From conceptual design to performance optimization of ETL workflows: current state of research and open problems. VLDB Journal: Very Large Data Bases, 26(6): 777–801, December 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Fang:2017:EEA [784] Yixiang Fang, Reynold Cheng, Yankai Chen, Siqiang Luo, and Jiafeng Hu. Effective and efficient attributed community search. VLDB Journal: Very Large Data Bases, 26(6):803–828, December 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lu:2017:MES [785] Wei Lu, Jiajia Hou, Ying Yan, Meihui Zhang, Xiaoyong Du, and Thomas Moscibroda. MSQL: efficient similarity search in metric spaces using SQL. VLDB Journal: Very Large Data Bases, 26(6):829–854, December 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Hung:2017:AVG [786] Nguyen Quoc Hung, Duong Chi Thang, Nguyen Thanh Tam, Matthias Wei- REFERENCES 137 dlich, Karl Aberer, Hongzhi Yin, and Xiaofang Zhou. Answer validation for generic crowdsourcing tasks with minimal efforts. VLDB Journal: Very Large Data Bases, 26(6):855–880, December 2017. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Herschel:2017:SPW [787] Melanie Herschel, Ralf Diestelkämper, and Houssem Ben Lahmar. A survey on provenance: What for? What form? What from? VLDB Journal: Very Large Data Bases, 26(6): 881–906, December 2017. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wei:2018:RQI [788] Hao Wei, Jeffrey Xu Yu, Can Lu, and Ruoming Jin. Reachability querying: an independent permutation labeling approach. VLDB Journal: Very Large Data Bases, 27(1):1–26, February 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lin:2018:OAS [789] Chunbin Lin, Jiaheng Lu, Zhewei Wei, Jianguo Wang, and Xiaokui Xiao. Optimal algorithms for selecting top-k combinations of attributes: theory and applications. VLDB Journal: Very Large Data Bases, 27(1):27–52, February 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhao:2018:ESS [790] Xiang Zhao, Chuan Xiao, Xuemin Lin, Wenjie Zhang, and Yang Wang. Efficient structure similarity searches: a partition-based approach. VLDB Journal: Very Large Data Bases, 27 (1):53–78, February 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yu:2018:DSS [791] Weiren Yu, Xuemin Lin, Wenjie Zhang, and Julie A. Mccann. Dynamical SimRank search on time-varying networks. VLDB Journal: Very Large Data Bases, 27(1):79–104, February 2018. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Sagi:2018:NBE [792] Tomer Sagi and Avigdor Gal. Nonbinary evaluation measures for big data integration. VLDB Journal: Very Large Data Bases, 27(1):105–126, February 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wu:2018:SOR [793] Yubao Wu, Xiang Zhang, Yuchen Bian, Zhipeng Cai, Xiang Lian, Xueting Liao, and Fengpan Zhao. Second-order random walk-based proximity measures in graph analysis: formulations and algorithms. VLDB Journal: Very Large Data Bases, 27(1):127–152, February 2018. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Yang:2018:PPC [794] Bin Yang, Jian Dai, Chenjuan Guo, Christian S. Jensen, and Jilin Hu. PACE: a PAth-CEntric paradigm for stochastic path finding. VLDB Journal: Very Large Data Bases, 27(2):153– 178, April 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 138 Hu:2018:RAP [795] Jilin Hu, Bin Yang, Chenjuan Guo, and Christian S. Jensen. Risk-aware path selection with time-varying, uncertain travel costs: a time series approach. VLDB Journal: Very Large Data Bases, 27(2):179–200, April 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Su:2018:PDP [796] Dong Su, Jianneng Cao, Ninghui Li, and Min Lyu. PrivPfC: differentially private data publication for classification. VLDB Journal: Very Large Data Bases, 27(2):201–223, April 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhang:2018:AKS [797] Dongxiang Zhang, Yuchen Li, Xin Cao, Jie Shao, and Heng Tao Shen. Augmented keyword search on spatial entity databases. VLDB Journal: Very Large Data Bases, 27(2):225–244, April 2018. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Deutch:2018:EPT [798] Daniel Deutch, Amir Gilad, and Yuval Moskovitch. Efficient provenance tracking for datalog using topk queries. VLDB Journal: Very Large Data Bases, 27(2):245–269, April 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhou:2018:ARQ [799] Junfeng Zhou, Jeffrey Xu Yu, Na Li, Hao Wei, Ziyang Chen, and Xian Tang. Accelerating reachability query ~ processing based on DAG reduction. VLDB Journal: Very Large Data Bases, 27(2):271–296, April 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Belesiotis:2018:STU [800] Alexandros Belesiotis, Dimitrios Skoutas, Christodoulos Efstathiades, Vassilis Kaffes, and Dieter Pfoser. Spatiotextual user matching and clustering based on set similarity joins. VLDB Journal: Very Large Data Bases, 27 (3):297–320, June 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Li:2018:GSG [801] Lei Li, Kai Zheng, Sibo Wang, Wen Hua, and Xiaofang Zhou. Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory. VLDB Journal: Very Large Data Bases, 27(3):321–345, June 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yao:2018:SDT [802] Chang Yao, Meihui Zhang, Qian Lin, Beng Chin Ooi, and Jiatao Xu. Scaling distributed transaction processing and recovery based on dependency logging. VLDB Journal: Very Large Data Bases, 27(3):347–368, June 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chodpathumwan:2018:CEC [803] Yodsawalai Chodpathumwan, Ali Vakilian, Arash Termehchy, and Amir Nayyeri. Cost-effective conceptual design using taxonomies. VLDB Journal: Very Large Data Bases, 27(3):369–394, REFERENCES 139 June 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Shang:2018:PTS join. VLDB Journal: Very Large Data Bases, 27(4):471–495, August 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Hao:2018:DRU [804] Shuo Shang, Lisi Chen, Zhewei Wei, Christian S. Jensen, Kai Zheng, and Panos Kalnis. Parallel trajectory similarity joins in spatial networks. VLDB Journal: Very Large Data Bases, 27 (3):395–420, June 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [808] Shuang Hao, Nan Tang, Guoliang Li, Jian Li, and Jianhua Feng. Distilling relations using knowledge bases. VLDB Journal: Very Large Data Bases, 27 (4):497–519, August 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lee:2018:PRA Borovica-Gajic:2018:SSR [805] Juchang Lee, Wook-Shin Han, Hyoung Jun Na, Chang Gyoo Park, Kyu Hwan Kim, Deok Hoe Kim, Joo Yeon Lee, Sang Kyun Cha, and Seunghyun Moon. Parallel replication across formats for scaling out mixed OLTP/OLAP workloads in main-memory databases. VLDB Journal: Very Large Data Bases, 27(3):421– 444, June 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [809] Renata Borovica-Gajic, Stratos Idreos, Anastasia Ailamaki, Marcin Zukowski, and Campbell Fraser. Smooth Scan: robust access path selection without cardinality estimation. VLDB Journal: Very Large Data Bases, 27(4):521–545, August 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Choudhury:2018:FOL [806] Farhana Murtaza Choudhury, J. Shane Culpepper, Zhifeng Bao, and Timos Sellis. Finding the optimal location and keywords in obstructed and unobstructed space. VLDB Journal: Very Large Data Bases, 27(4):445–470, August 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Yang:2018:ESC [807] Jianye Yang, Wenjie Zhang, Shiyu Yang, Ying Zhang, Xuemin Lin, and Long Yuan. Efficient set containment Herrmann:2018:MSV [810] Kai Herrmann, Hannes Voigt, Torben Bach Pedersen, and Wolfgang Lehner. Multi-schema-version data management: data independence in the twenty-first century. VLDB Journal: Very Large Data Bases, 27(4):547–571, August 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Szlichta:2018:ECD [811] Jaroslaw Szlichta, Parke Godfrey, Lukasz Golab, Mehdi Kargar, and Divesh Srivastava. Effective and complete discovery of bidirectional order dependencies via set-based axioms. VLDB Journal: Very Large Data Bases, 27 REFERENCES 140 (4):573–591, August 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Chaudhuri:2018:SIB [812] Surajit Chaudhuri and Jayant R. Haritsa. Special issue on best papers of VLDB 2016. VLDB Journal: Very Large Data Bases, 27(5):593–594, October 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Interlandi:2018:ADP CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Makreshanski:2018:MQJ [816] Darko Makreshanski, Georgios Giannikis, Gustavo Alonso, and Donald Kossmann. Many-query join: efficient shared execution of relational joins on modern hardware. VLDB Journal: Very Large Data Bases, 27 (5):669–692, October 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Brucato:2018:PQE [813] Matteo Interlandi, Ari Ekmekji, Kshitij Shah, Muhammad Ali Gulzar, Sai Deep Tetali, Miryung Kim, Todd Millstein, and Tyson Condie. Adding data provenance support to Apache Spark. VLDB Journal: Very Large Data Bases, 27 (5):595–615, October 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [817] Matteo Brucato, Azza Abouzied, and Alexandra Meliou. Package queries: efficient and scalable computation of high-order constraints. VLDB Journal: Very Large Data Bases, 27(5):693– 718, October 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Eich:2018:EGQ Elgohary:2018:CLA [814] Marius Eich, Pit Fender, and Guido Moerkotte. Efficient generation of query plans containing group-by, join, and groupjoin. VLDB Journal: Very Large Data Bases, 27(5):617–641, October 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). [818] Ahmed Elgohary, Matthias Boehm, Peter J. Haas, Frederick R. Reiss, and Berthold Reinwald. Compressed linear algebra for large-scale machine learning. VLDB Journal: Very Large Data Bases, 27(5):719–744, October 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Leis:2018:QOT Chai:2018:POB [815] Viktor Leis, Bernhard Radke, Andrey Gubichev, Atanas Mirchev, Peter Boncz, Alfons Kemper, and Thomas Neumann. Query optimization through the looking glass, and what we found running the Join Order Benchmark. VLDB Journal: Very Large Data Bases, 27(5):643–668, October 2018. [819] Chengliang Chai, Guoliang Li, Jian Li, Dong Deng, and Jianhua Feng. A partial-order-based framework for costeffective crowdsourced entity resolution. VLDB Journal: Very Large Data Bases, 27(6):745–770, December 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). REFERENCES 141 Roblot:2018:PCC [820] Tania Roblot, Miika Hannula, and Sebastian Link. Probabilistic cardinality constraints. VLDB Journal: Very Large Data Bases, 27(6):771–795, December 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Bress:2018:GCC [821] Sebastian Breß, Bastian Köcher, Henning Funke, Steffen Zeuch, Tilmann Rabl, and Volker Markl. Generating custom code for efficient query execution on heterogeneous processors. VLDB Journal: Very Large Data Bases, 27(6):797–822, December 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zoumpatianos:2018:GDS [822] Kostas Zoumpatianos, Yin Lou, Ioana Ileana, Themis Palpanas, and Johannes Gehrke. Generating data series query workloads. VLDB Journal: Very Large Data Bases, 27(6):823–846, December 2018. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). To:2018:SSM [823] Quoc-Cuong To, Juan Soto, and Volker Markl. A survey of state management in big data processing systems. VLDB Journal: Very Large Data Bases, 27 (6):847–872, December 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Liu:2018:ACE [824] Yuchen Liu, Hai Liu, Dongqing Xiao, and Mohamed Y. Eltabakh. Adaptive correlation exploitation in big data query optimization. VLDB Journal: Very Large Data Bases, 27(6):873–898, December 2018. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wang:2018:EEM [825] Tianzheng Wang, Ryan Johnson, Alan Fekete, and Ippokratis Pandis. Erratum to: Efficiently making (almost) any concurrency control mechanism serializable. VLDB Journal: Very Large Data Bases, 27(6):899–900, December 2018. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). See [773]. Rahman:2019:OGF [826] Habibur Rahman, Senjuti Basu Roy, Saravanan Thirumuruganathan, Sihem Amer-Yahia, and Gautam Das. Optimized group formation for solving collaborative tasks. VLDB Journal: Very Large Data Bases, 28(1):1–23, February 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wu:2019:VFS [827] Zhiqiang Wu and Kenli Li. VBTree: forward secure conjunctive queries over encrypted data for cloud computing. VLDB Journal: Very Large Data Bases, 28(1):25–46, February 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Lee:2019:PFP [828] Seokki Lee, Bertram Ludäscher, and Boris Glavic. PUG: a framework and practical implementation for why and why-not provenance. VLDB Journal: Very Large Data Bases, 28(1):47–71, REFERENCES 142 February 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wang:2019:SSS [829] Wenlu Wang, Ji Zhang, Min-Te Sun, and Wei-Shinn Ku. A scalable spatial skyline evaluation system utilizing parallel independent region groups. VLDB Journal: Very Large Data Bases, 28 (1):73–98, February 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wang:2019:APS [830] Yue Wang, Lei Chen, Yulin Che, and Qiong Luo. Accelerating pairwise SimRank estimation over static and dynamic graphs. VLDB Journal: Very Large Data Bases, 28(1):99–122, February 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Zhao:2019:EMC [831] Kaiqi Zhao, Gao Cong, Jin-Yao Chin, and Rong Wen. Exploring market competition over topics in spatio-temporal document collections. VLDB Journal: Very Large Data Bases, 28(1): 123–145, February 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Picado:2019:LSE [832] Jose Picado, Arash Termehchy, Alan Fern, and Parisa Ataei. Logical scalability and efficiency of relational learning algorithms. VLDB Journal: Very Large Data Bases, 28(2):147–171, April 2019. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Aluc:2019:BSC [833] Günes Aluç, M. Tamer Özsu, and Khuzaima Daudjee. Building selfclustering RDF databases using Tunable-LSH. VLDB Journal: Very Large Data Bases, 28(2):173–195, April 2019. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Zhou:2019:RTC [834] Xiangmin Zhou, Dong Qin, Lei Chen, and Yanchun Zhang. Real-time context-aware social media recommendation. VLDB Journal: Very Large Data Bases, 28(2):197–219, April 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Ntaflos:2019:UAB [835] Lefteris Ntaflos, George Trimponias, and Dimitris Papadias. A unified agent-based framework for constrained graph partitioning. VLDB Journal: Very Large Data Bases, 28(2):221–241, April 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Omidvar-Tehrani:2019:UGA [836] Behrooz Omidvar-Tehrani, Sihem Amer-Yahia, and Ria Mae Borromeo. User group analytics: hypothesis generation and exploratory analysis of user data. VLDB Journal: Very Large Data Bases, 28(2):243–266, April 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Wang:2019:LSR [837] Xubo Wang, Lu Qin, Xuemin Lin, Ying Zhang, and Lijun Chang. Leveraging set relations in exact and dynamic set REFERENCES 143 similarity join. VLDB Journal: Very Large Data Bases, 28(2):267–292, April 2019. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Amer-Yahia:2019:TID [838] Sihem Amer-Yahia, Lei Chen, and Renée J. Miller. Thematic issue on data management for graphs. VLDB Journal: Very Large Data Bases, 28 (3):293–294, June 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Cebiric:2019:SSG [839] Šejla Cebirić, François Goasdoué, Haridimos Kondylakis, Dimitris Kotzinos, Ioana Manolescu, Georgia Troullinou, and Mussab Zneika. Summarizing semantic graphs: a survey. VLDB Journal: Very Large Data Bases, 28 (3):295–327, June 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Demirci:2019:CAP [840] Gunduz Vehbi Demirci, Hakan Ferhatosmanoglu, and Cevdet Aykanat. Cascade-aware partitioning of large graph databases. VLDB Journal: Very Large Data Bases, 28(3):329–350, June 2019. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Das:2019:IMM [841] Apurba Das, Michael Svendsen, and Srikanta Tirthapura. Incremental maintenance of maximal cliques in a dynamic graph. VLDB Journal: Very Large Data Bases, 28(3):351–375, June 2019. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Wen:2019:ESG [842] Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, and Xuemin Lin. Efficient structural graph clustering: an indexbased approach. VLDB Journal: Very Large Data Bases, 28(3):377–399, June 2019. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Yu:2019:SES [843] Weiren Yu, Xuemin Lin, Wenjie Zhang, Jian Pei, and Julie A. Mccann. SimRank*: effective and scalable pairwise similarity search based on graph topology. VLDB Journal: Very Large Data Bases, 28(3):401–426, June 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). Valdes:2019:FEM [844] Fabio Valdés and Ralf Hartmut Güting. A framework for efficient multi-attribute movement data analysis. VLDB Journal: Very Large Data Bases, 28(4):427–449, August 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-0180525-6. Psaropoulos:2019:ICS [845] Georgios Psaropoulos, Thomas Legler, Norman May, and Anastasia Ailamaki. Interleaving with coroutines: a systematic and practical approach to hide memory latency in index joins. VLDB Journal: Very Large Data Bases, 28 (4):451–471, August 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-018-0533-6. REFERENCES 144 Bronselaer:2019:CRT [846] Antoon Bronselaer, Christophe Billiet, Robin De Mol, Joachim Nielandt, and Guy De Tré. Compact representations of temporal databases. VLDB Journal: Very Large Data Bases, 28 (4):473–496, August 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-018-0535-4. Baazizi:2019:PSI [847] Mohamed-Amine Baazizi, Dario Colazzo, Giorgio Ghelli, and Carlo Sartiani. Parametric schema inference for massive JSON datasets. VLDB Journal: Very Large Data Bases, 28 (4):497–521, August 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-018-0532-7. Li:2019:SCG [848] Yuan Li, Ahmed Eldawy, Jie Xue, Nadezda Knorozova, Mohamed F. Mokbel, and Ravi Janardan. Scalable computational geometry in MapReduce. VLDB Journal: Very Large Data Bases, 28(4):523–548, August 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-0180534-5. Park:2019:FSM [849] Namyong Park, Sejoon Oh, and U Kang. Fast and scalable method for distributed Boolean tensor factorization. VLDB Journal: Very Large Data Bases, 28(4):549–574, August 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900538-z. Frazzetto:2019:PAS [850] Davide Frazzetto, Thomas Dyhre Nielsen, Torben Bach Pedersen, and Laurynas Šikšnys. Prescriptive analytics: a survey of emerging trends and technologies. VLDB Journal: Very Large Data Bases, 28(4):575–595, August 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900539-y. Zhu:2019:FDC [851] Rong Zhu, Zhaonian Zou, and Jianzhong Li. Fast diversified coherent core search on multi-layer graphs. VLDB Journal: Very Large Data Bases, 28(4):597–622, August 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900542-3. AlHasanHaldar:2019:LPL [852] Nur Al Hasan Haldar, Jianxin Li, Mark Reynolds, Timos Sellis, and Jeffrey Xu Yu. Location prediction in large-scale social networks: an in-depth benchmarking study. VLDB Journal: Very Large Data Bases, 28(5):623–648, October 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900553-0. REFERENCES 145 Fang:2019:EPM [853] Yixiang Fang, Yun Li, Reynold Cheng, Nikos Mamoulis, and Gao Cong. Evaluating pattern matching queries for spatial databases. VLDB Journal: Very Large Data Bases, 28(5):649–673, October 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900550-3. Kim:2019:ETD [854] Jinhyun Kim, Jun-Ki Min, and Kyuseok Shim. Efficient twodimensional Haar+ synopsis construction for the maximum absolute error measure. VLDB Journal: Very Large Data Bases, 28(5):675–701, October 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900551-2. Theocharidis:2019:SEM [855] Konstantinos Theocharidis, John Liagouris, Nikos Mamoulis, Panagiotis Bouros, and Manolis Terrovitis. SRX: efficient management of spatial RDF data. VLDB Journal: Very Large Data Bases, 28(5):703–733, October 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900554-z. Yang:2019:FAS [856] Tong Yang, Jie Jiang, Yang Zhou, Long He, Jinyang Li, Bin Cui, Steve Uhlig, and Xiaoming Li. Fast and accurate stream processing by filter- ing the cold. VLDB Journal: Very Large Data Bases, 28(5):735–763, October 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900560-1. Li:2019:ESW [857] Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, and Xuemin Lin. Eccentricities on small-world networks. VLDB Journal: Very Large Data Bases, 28(5):765–792, October 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900566-9. Affolter:2019:CSR [858] Katrin Affolter, Kurt Stockinger, and Abraham Bernstein. A comparative survey of recent natural language interfaces for databases. VLDB Journal: Very Large Data Bases, 28(5): 793–819, October 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00567-8; http: //link.springer.com/content/pdf/ 10.1007/s00778-019-00567-8.pdf. Cheng:2019:PCD [859] Zhinan Cheng, Qun Huang, and Patrick P. C. Lee. On the performance and convergence of distributed stream processing via approximate fault tolerance. VLDB Journal: Very Large Data Bases, 28(5):821–846, October 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. REFERENCES 146 com/article/10.1007/s00778-01900565-w. Kondylakis:2019:CSS [860] Haridimos Kondylakis, Niv Dayan, Kostas Zoumpatianos, and Themis Palpanas. Coconut: sortable summarizations for scalable indexes over static and streaming data series. VLDB Journal: Very Large Data Bases, 28(6): 847–869, December 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00573-w. Zhang:2019:EDR [861] Tianming Zhang, Yunjun Gao, Lu Chen, Wei Guo, Shiliang Pu, Baihua Zheng, and Christian S. Jensen. Efficient distributed reachability querying of massive temporal graphs. VLDB Journal: Very Large Data Bases, 28(6): 871–896, December 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00572-x. Lin:2019:OPT [862] Xuelian Lin, Jiahao Jiang, Shuai Ma, Yimeng Zuo, and Chunming Hu. One-pass trajectory simplification using the synchronous Euclidean distance. VLDB Journal: Very Large Data Bases, 28(6):897–921, December 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900575-8. Wang:2019:PAS [863] Runhui Wang, Sibo Wang, and Xiaofang Zhou. Parallelizing approximate single-source personalized PageRank queries on shared memory. VLDB Journal: Very Large Data Bases, 28 (6):923–940, December 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00576-7. Langdale:2019:PGJ [864] Geoff Langdale and Daniel Lemire. Parsing gigabytes of JSON per second. VLDB Journal: Very Large Data Bases, 28(6):941–960, December 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900578-5. Ren:2019:SQI [865] Weilong Ren, Xiang Lian, and Kambiz Ghazinour. Skyline queries over incomplete data streams. VLDB Journal: Very Large Data Bases, 28(6): 961–985, December 2019. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00577-6. Zhang:2019:ECD [866] Fan Zhang, Xuemin Lin, Ying Zhang, Lu Qin, and Wenjie Zhang. Efficient community discovery with user engagement and similarity. VLDB Journal: Very Large Data Bases, 28(6): 987–1012, December 2019. CODEN VLDBFR. ISSN 1066-8888 (print), REFERENCES 147 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00579-4. Chen:2020:VSS [867] Lei Chen and Sihem Amer-Yahia. VLDB SI survey editorial. VLDB Journal: Very Large Data Bases, 29(1):1–2, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00598-1; http: //link.springer.com/content/pdf/ 10.1007/s00778-019-00598-1.pdf. Su:2020:STD [868] Han Su, Shuncheng Liu, Bolong Zheng, Xiaofang Zhou, and Kai Zheng. A survey of trajectory distance measures and performance evaluation. VLDB Journal: Very Large Data Bases, 29 (1):3–32, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00574-9. Fang:2020:MDA [869] Jian Fang, Yvo T. B. Mulder, Jan Hidders, Jinho Lee, and H. Peter Hofstee. In-memory database acceleration on FPGAs: a survey. VLDB Journal: Very Large Data Bases, 29 (1):33–59, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00581-w; http: //link.springer.com/content/pdf/ 10.1007/s00778-019-00581-w.pdf. Malliaros:2020:CDN [870] Fragkiskos D. Malliaros, Christos Giatsidis, Apostolos N. Papadopoulos, and Michalis Vazirgiannis. The core decomposition of networks: theory, algorithms and applications. VLDB Journal: Very Large Data Bases, 29 (1):61–92, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00587-4. Qin:2020:MDV [871] Xuedi Qin, Yuyu Luo, Nan Tang, and Guoliang Li. Making data visualization more efficient and effective: a survey. VLDB Journal: Very Large Data Bases, 29(1):93–117, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900588-3. Rahman:2020:EID [872] Protiva Rahman, Lilong Jiang, and Arnab Nandi. Evaluating interactive data systems. VLDB Journal: Very Large Data Bases, 29(1):119–146, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900589-2. Xie:2020:ESR [873] Min Xie, Raymond Chi-Wing Wong, and Ashwin Lall. An experimental survey of regret minimization query and variants: bridging the best worlds between top-k query and skyline query. VLDB Journal: Very REFERENCES 148 Large Data Bases, 29(1):147–175, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900570-z. Magdy:2020:MDM [874] Amr Magdy, Laila Abdelhafeez, Yunfan Kang, Eric Ong, and Mohamed F. Mokbel. Microblogs data management: a survey. VLDB Journal: Very Large Data Bases, 29(1):177–216, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900569-6. Tong:2020:SCS com/content/pdf/10.1007/s00778019-00564-x.pdf. Fevgas:2020:IFS [877] Athanasios Fevgas, Leonidas Akritidis, Panayiotis Bozanis, and Yannis Manolopoulos. Indexing in flash storage devices: a survey on challenges, current approaches, and future trends. VLDB Journal: Very Large Data Bases, 29(1):273–311, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900559-8. Giatrakos:2020:CER [875] Yongxin Tong, Zimu Zhou, Yuxiang Zeng, Lei Chen, and Cyrus Shahabi. Spatial crowdsourcing: a survey. VLDB Journal: Very Large Data Bases, 29(1):217–250, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900568-7. [878] Nikos Giatrakos, Elias Alevizos, Alexander Artikis, Antonios Deligiannakis, and Minos Garofalakis. Complex event recognition in the Big Data era: a survey. VLDB Journal: Very Large Data Bases, 29(1):313–352, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900557-w. Chapman:2020:DSS Fang:2020:SCS [876] Adriane Chapman, Elena Simperl, Laura Koesten, George Konstantinidis, Luis-Daniel Ibáñez, Emilia Kacprzak, and Paul Groth. Dataset search: a survey. VLDB Journal: Very Large Data Bases, 29(1):251–272, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900564-x; http://link.springer. [879] Yixiang Fang, Xin Huang, Lu Qin, Ying Zhang, Wenjie Zhang, Reynold Cheng, and Xuemin Lin. A survey of community search over big graphs. VLDB Journal: Very Large Data Bases, 29(1):353–392, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900556-x. See correction [914]. REFERENCES 149 Luo:2020:LBS [880] Chen Luo and Michael J. Carey. LSM-based storage techniques: a survey. VLDB Journal: Very Large Data Bases, 29(1):393–418, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900555-y. Blumenthal:2020:CHG [881] David B. Blumenthal, Nicolas Boria, Johann Gamper, Sébastien Bougleux, and Luc Brun. Comparing heuristics for graph edit distance computation. VLDB Journal: Very Large Data Bases, 29(1):419–458, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900544-1. Chen:2020:EMM [882] Xinhong Chen and Qing Li. Event modeling and mining: a long journey toward explainable events. VLDB Journal: Very Large Data Bases, 29 (1):459–482, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00545-0. Boncz:2020:SIB [883] Peter Boncz and Kenneth Salem. Special issue on best papers of VLDB 2017. VLDB Journal: Very Large Data Bases, 29(1):483–484, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900600-w; http://link.springer. com/content/pdf/10.1007/s00778019-00600-w.pdf. Deutch:2020:ENL [884] Daniel Deutch, Nave Frost, and Amir Gilad. Explaining natural language query results. VLDB Journal: Very Large Data Bases, 29(1):485–508, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900584-7. Huang:2020:VOD [885] Silu Huang, Liqi Xu, Jialin Liu, Aaron J. Elmore, and Aditya Parameswaran. OrpheusDB: bolt-on versioning for relational databases (extended version). VLDB Journal: Very Large Data Bases, 29(1):509–538, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900594-5. Orr:2020:EPA [886] Laurel Orr, Magdalena Balazinska, and Dan Suciu. EntropyDB: a probabilistic approach to approximate query processing. VLDB Journal: Very Large Data Bases, 29(1):539–567, January 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900582-9. Amer-Yahia:2020:VSE [887] Sihem Amer-Yahia and Jian Pei. VLDB SI 2018 editorial. VLDB REFERENCES 150 Journal: Very Large Data Bases, 29 (2–3):593–594, May 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00599-0; http: //link.springer.com/content/pdf/ 10.1007/s00778-019-00599-0.pdf. Sahu:2020:ULG [888] Siddhartha Sahu, Amine Mhedhbi, Semih Salihoglu, Jimmy Lin, and M. Tamer Özsu. The ubiquity of large graphs and surprising challenges of graph processing: extended survey. VLDB Journal: Very Large Data Bases, 29(2–3):595–618, May 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900548-x. Idris:2020:GDY [889] Muhammad Idris, Martı́n Ugarte, Stijn Vansummeren, Hannes Voigt, and Wolfgang Lehner. General dynamic Yannakakis: conjunctive queries with theta joins under updates. VLDB Journal: Very Large Data Bases, 29 (2–3):619–653, May 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00590-9. Bonifati:2020:ASL [890] Angela Bonifati, Wim Martens, and Thomas Timm. An analytical study of large SPARQL query logs. VLDB Journal: Very Large Data Bases, 29 (2–3):655–679, May 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00558-9. Asudeh:2020:SAS [891] Abolfazl Asudeh, Jees Augustine, Azade Nazi, Saravanan Thirumuruganathan, Nan Zhang, Gautam Das, and Divesh Srivastava. Scalable algorithms for signal reconstruction by leveraging similarity joins. VLDB Journal: Very Large Data Bases, 29 (2–3):681–707, May 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00562-z. Ratner:2020:SRT [892] Alexander Ratner, Stephen H. Bach, Henry Ehrenberg, Jason Fries, Sen Wu, and Christopher Ré. Snorkel: rapid training data creation with weak supervision. VLDB Journal: Very Large Data Bases, 29(2–3):709–730, May 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900552-1; http://link.springer. com/content/pdf/10.1007/s00778019-00552-1.pdf. Breslow:2020:MFF [893] Alex D. Breslow and Nuwan S. Jayasena. Morton filters: fast, compressed sparse cuckoo filters. VLDB Journal: Very Large Data Bases, 29 (2–3):731–754, May 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00561-0. REFERENCES 151 Salem:2020:SIB Pohl:2020:JHB [894] Kenneth Salem. Special issue on best papers of DaMoN 2018. VLDB Journal: Very Large Data Bases, 29(2–3):755, May 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00597-2; http: //link.springer.com/content/pdf/ 10.1007/s00778-019-00597-2.pdf. [897] Constantin Pohl, Kai-Uwe Sattler, and Goetz Graefe. Joins on high-bandwidth memory: a new level in the memory hierarchy. VLDB Journal: Very Large Data Bases, 29(2–3):797–817, May 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900546-z. Pedersen:2020:FSR Lang:2020:MMY [895] Harald Lang, Linnea Passing, Andreas Kipf, Peter Boncz, Thomas Neumann, and Alfons Kemper. Make the most out of your SIMD investments: counter control flow divergence in compiled query pipelines. VLDB Journal: Very Large Data Bases, 29 (2–3):757–774, May 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http: //link.springer.com/article/10. 1007/s00778-019-00547-y; http: //link.springer.com/content/pdf/ 10.1007/s00778-019-00547-y.pdf. Zarubin:2020:ECN [896] Mikhail Zarubin, Thomas Kissinger, Dirk Habich, Thomas Willhalm, and Wolfgang Lehner. Efficient compute node-local replication mechanisms for NVRAM-centric data structures. VLDB Journal: Very Large Data Bases, 29(2–3):775–795, May 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL http://link.springer. com/article/10.1007/s00778-01900549-w. [898] Simon Aagaard Pedersen, Bin Yang, and Christian S. Jensen. Fast stochastic routing under time-varying uncertainty. VLDB Journal: Very Large Data Bases, 29(4):819–839, July 2020. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-019-005856. Xu:2020:EPM [899] Hongfei Xu, Yu Gu, and Rui Zhang. Efficient processing of moving collective spatial keyword queries. VLDB Journal: Very Large Data Bases, 29 (4):841–865, July 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-019-00583-8. Geerts:2020:CDL [900] Floris Geerts, Giansalvatore Mecca, and Donatello Santoro. Cleaning data with Llunatic. VLDB Journal: Very Large Data Bases, 29 (4):867–892, July 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: REFERENCES 152 //link.springer.com/article/10. 1007/s00778-019-00586-5. Wu:2020:TRS [901] Dingming Wu, Hao Zhou, and Nikos Mamoulis. Top-k relevant semantic place retrieval on spatiotemporal RDF data. VLDB Journal: Very Large Data Bases, 29 (4):893–917, July 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-019-00591-8. Qin:2020:EQA [902] Jianbin Qin, Chuan Xiao, and Kunihiko Sadakane. Efficient query autocompletion with edit distancebased error tolerance. VLDB Journal: Very Large Data Bases, 29 (4):919–943, July 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-019-00595-4. Jiang:2020:SCS [903] Jiawei Jiang, Fangcheng Fu, and Bin Cui. SKCompress: compressing sparse and nonuniform gradient in distributed machine learning. VLDB Journal: Very Large Data Bases, 29 (5):945–972, September 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-019-00596-3. Wang:2020:FEF [904] Chaohui Wang, Miao Xie, and Shuigeng Zhou. FERRARI: an efficient framework for visual exploratory subgraph search in graph databases. VLDB Journal: Very Large Data Bases, 29(5):973–998, September 2020. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-020-006010. Chang:2020:EMC [905] Lijun Chang. Efficient maximum clique computation and enumeration over large sparse graphs. VLDB Journal: Very Large Data Bases, 29(5): 999–1022, September 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00602-z. Chondrogiannis:2020:FSP [906] Theodoros Chondrogiannis, Panagiotis Bouros, and David B. Blumenthal. Finding k-shortest paths with limited overlap. VLDB Journal: Very Large Data Bases, 29(5):1023– 1047, September 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00604-x. Zou:2020:ADS [907] Jia Zou, Arun Iyengar, and Chris Jermaine. Architecture of a distributed storage that combines file system, memory and computation in a single layer. VLDB Journal: Very Large Data Bases, 29(5):1049– 1073, September 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00605-w. REFERENCES 153 Liu:2020:ECC [908] Boge Liu, Long Yuan, and Jingren Zhou. Efficient (α, β)-core computation in bipartite graphs. VLDB Journal: Very Large Data Bases, 29(5): 1075–1099, September 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00606-9. Chen:2020:TTP [909] Lisi Chen, Shuo Shang, and Ling Shao. Top-k term publish/subscribe for geotextual data streams. VLDB Journal: Very Large Data Bases, 29(5): 1101–1128, September 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00607-8. Yang:2020:TFA [910] Fan Yang, Faisal M. Almutairi, and Vladimir Zadorozhny. TurboLift: fast accuracy lifting for historical data recovery. VLDB Journal: Very Large Data Bases, 29(5): 1129–1148, September 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00609-6. See correction [1105]. Guo:2020:CAP [911] Chenjuan Guo, Bin Yang, and Lu Chen. Context-aware, preferencebased vehicle routing. VLDB Journal: Very Large Data Bases, 29(5): 1149–1170, September 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00608-7. Cai:2020:DSK [912] Zhi Cai, Georgios Kalamatianos, and Dimitris Papadias. Diversified spatial keyword search on RDF data. VLDB Journal: Very Large Data Bases, 29(5): 1171–1189, September 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00610-z. Goasdoue:2020:RGS [913] François Goasdoué, Pawel Guzewicz, and Ioana Manolescu. RDF graph summarization for first-sight structure discovery. VLDB Journal: Very Large Data Bases, 29(5):1191– 1218, September 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00611-y. Fang:2020:CSC [914] Yixiang Fang, Xin Huang, and Xuemin Lin. Correction: A survey of community search over big graphs. VLDB Journal: Very Large Data Bases, 29 (5):1219, September 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-019-00592-7. See [879]. Aboulnaga:2020:SIB [915] Ashraf Aboulnaga. Special issue on the best papers of DaMoN 2019. VLDB Journal: Very Large Data Bases, 29 (6):1221, November 2020. CODEN REFERENCES 154 VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00629-2. vanRenen:2020:BBP [916] Alexander van Renen, Lukas Vogel, and Alfons Kemper. Building blocks for persistent memory. VLDB Journal: Very Large Data Bases, 29(6): 1223–1241, November 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00622-9. Polychroniou:2020:VSV [917] Orestis Polychroniou and Kenneth A. Ross. VIP: a SIMD vectorized analytical query engine. VLDB Journal: Very Large Data Bases, 29(6): 1243–1261, November 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00621-w. Lasch:2020:FSS [918] Robert Lasch, Ismail Oukid, and Kai-Uwe Sattler. Faster & strong: string dictionary compression using sampling and fast vectorized decompression. VLDB Journal: Very Large Data Bases, 29(6):1263– 1285, November 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00620-x. Kruse:2020:RDJ [919] Sebastian Kruse, Zoi Kaoudi, and Jorge-Arnulfo Quiané-Ruiz. RHEEMix in the data jungle: a cost-based optimizer for cross-platform systems. VLDB Journal: Very Large Data Bases, 29(6):1287–1310, November 2020. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-020-00612x. Yang:2020:GBF [920] Jingru Yang, Ju Fan, and Xiaoyong Du. A game-based framework for crowdsourced data labeling. VLDB Journal: Very Large Data Bases, 29(6): 1311–1336, November 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00613-w. Jacobs:2020:BBB [921] Steven Jacobs, Xikui Wang, and Md Yusuf Sarwar Uddin. BAD to the bone: Big Active Data at its core. VLDB Journal: Very Large Data Bases, 29(6):1337– 1364, November 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00616-7. Sun:2020:TSI [922] Tao Sun, Hongbo Liu, and Xindong Wu. Time series indexing by dynamic covering with crossrange constraints. VLDB Journal: Very Large Data Bases, 29(6):1365– 1384, November 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00614-9. REFERENCES 155 Huang:2020:EAA [923] Keke Huang, Jing Tang, and Andrew Lim. Efficient approximation algorithms for adaptive influence maximization. VLDB Journal: Very Large Data Bases, 29(6): 1385–1406, November 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00615-8. Li:2020:FSC [924] Rong-Hua Li, Lu Qin, and Zibin Zheng. Finding skyline communities in multi-valued networks. VLDB Journal: Very Large Data Bases, 29(6): 1407–1432, November 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00618-5. Ahmad:2020:AWM [925] Hiba Abu Ahmad and Hongzhi Wang. Automatic weighted matching rectifying rule discovery for data repairing. VLDB Journal: Very Large Data Bases, 29(6):1433– 1447, November 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00617-6. Linardi:2020:SDS [926] Michele Linardi and Themis Palpanas. Scalable data series subsequence matching with ULISSE. VLDB Journal: Very Large Data Bases, 29(6): 1449–1474, November 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00619-4. Song:2020:IPA [927] Liangjun Song, Junhao Gan, and Timos Sellis. Incremental preference adjustment: a graph-theoretical approach. VLDB Journal: Very Large Data Bases, 29(6):1475–1500, November 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https://link. springer.com/article/10.1007/s00778020-00623-8. Lee:2020:TLA [928] Dongjin Lee, Kijung Shin, and Christos Faloutsos. Temporal locality-aware sampling for accurate triangle counting in real graph streams. VLDB Journal: Very Large Data Bases, 29(6): 1501–1525, November 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00624-7. Omidvar-Tehrani:2020:CAE [929] Behrooz Omidvar-Tehrani, Sihem Amer-Yahia, and Laks V. S. Lakshmanan. Cohort analytics: efficiency and applicability. VLDB Journal: Very Large Data Bases, 29(6): 1527–1550, November 2020. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00625-6. Ozcan:2021:GES [930] Fatma Özcan and Lei Chen. Guest editorial: Special issue on VLDB REFERENCES 156 2019. VLDB Journal: Very Large Data Bases, 30(1):1–2, January 2021. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-020-006309. Ruan:2021:LFG [931] Pingcheng Ruan, Tien Tuan Anh Dinh, and Beng Chin Ooi. LineageChain: a fine-grained, secure and efficient data provenance system for blockchains. VLDB Journal: Very Large Data Bases, 30 (1):3–24, January 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00646-1. Wu:2021:ATC [932] Chenggang Wu, Vikram Sreekanti, and Joseph M. Hellerstein. Autoscaling tiered cloud storage in Anna. VLDB Journal: Very Large Data Bases, 30 (1):25–43, January 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00632-7. Abuzaid:2021:DRI [933] Firas Abuzaid, Peter Kraft, and Matei Zaharia. DIFF: a relational interface for large-scale data explanation. VLDB Journal: Very Large Data Bases, 30 (1):45–70, January 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00633-6. Whittaker:2021:ICC [934] Michael Whittaker and Joseph M. Hellerstein. Interactive checks for coordination avoidance. VLDB Journal: Very Large Data Bases, 30 (1):71–92, January 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00628-3. Fan:2021:GBV [935] Hua Fan and Wojciech Golab. Gossipbased visibility control for highperformance geo-distributed transactions. VLDB Journal: Very Large Data Bases, 30(1):93–114, January 2021. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-020-006265. Li:2021:QSD [936] Yuliang Li, Aaron Feng, and WangChiew Tan. Querying subjective data. VLDB Journal: Very Large Data Bases, 30(1):115–140, January 2021. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-020-006345. Dong:2021:CTS [937] Yuyang Dong, Chuan Xiao, and Hiroyuki Kitagawa. Continuous topk spatial-keyword search on dynamic objects. VLDB Journal: Very Large Data Bases, 30(2): 141–161, March 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: REFERENCES 157 //link.springer.com/article/10. 1007/s00778-020-00627-4. Zhang:2021:TTA [938] Feng Zhang, Jidong Zhai, and Xiaoyong Du. TADOC: Text analytics directly on compression. VLDB Journal: Very Large Data Bases, 30 (2):163–188, March 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00636-3. Li:2021:CTQ [939] Yan Li, Hao Wang, and Zhiguo Gong. Crowdsourced top-k queries by pairwise preference judgments with confidence and budget control. VLDB Journal: Very Large Data Bases, 30 (2):189–213, March 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00631-8. Liu:2021:LET [940] Wanqi Liu, Hanchen Wang, and Xuemin Lin. EI-LSH: an earlytermination driven I/O efficient incremental c-approximate nearest neighbor search. VLDB Journal: Very Large Data Bases, 30 (2):215–235, March 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00635-4. VLDB Journal: Very Large Data Bases, 30(2):237–258, March 2021. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-020-006452. Zhang:2021:SAN [942] Yongqi Zhang, Quanming Yao, and Lei Chen. Simple and automated negative sampling for knowledge graph embedding. VLDB Journal: Very Large Data Bases, 30 (2):259–285, March 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00640-7. Fang:2021:DHE [943] Ziquan Fang, Lu Chen, and Christian S. Jensen. Dragoon: a hybrid and efficient big trajectory management system for offline and online analytics. VLDB Journal: Very Large Data Bases, 30 (2):287–310, March 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00652-x. Paul:2021:SER [944] Debjyoti Paul, Feifei Li, and Jeff M. Phillips. Semantic embedding for regions of interest. VLDB Journal: Very Large Data Bases, 30 (3):311–331, May 2021. CODEN Yu:2021:GCC VLDBFR. ISSN 1066-8888 (print), [941] Jia Yu and Mohamed Sarwat. GeoSparkViz: 0949-877X (electronic). URL https: a cluster computing system for visu//link.springer.com/article/10. alizing massive-scale geospatial data. 1007/s00778-020-00647-0. REFERENCES 158 Romanous:2021:ELL [945] Bashar Romanous, Skyler Windh, and Vassilis Tsotras. Efficient local locking for massively multithreaded inmemory hash-based operators. VLDB Journal: Very Large Data Bases, 30 (3):333–359, May 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00642-5. Mao:2021:CES [946] Qizhong Mao, Steven Jacobs, and Neal E. Young. Comparison and evaluation of state-of-the-art LSM merge policies. VLDB Journal: Very Large Data Bases, 30(3): 361–378, May 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00638-1. Piatov:2021:CES [947] Danila Piatov, Sven Helmer, and Fabio Persia. Cache-efficient sweepingbased interval joins for extended Allen relation predicates. VLDB Journal: Very Large Data Bases, 30 (3):379–402, May 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00650-5. Do:2021:BDC [948] Jaeyoung Do, Ivan Luiz Picoli, and Philippe Bonnet. Better database cost/performance via batched I/O on programmable SSD. VLDB Journal: Very Large Data Bases, 30 (3):403–424, May 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00648-z. Song:2021:CTT [949] Shaoxu Song, Ruihong Huang, and Jianmin Wang. Cleaning timestamps with temporal constraints. VLDB Journal: Very Large Data Bases, 30 (3):425–446, May 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00641-6. Yang:2021:IEM [950] Chengcheng Yang, Dong Deng, and Ling Shao. Internal and external memory set containment join. VLDB Journal: Very Large Data Bases, 30 (3):447–470, May 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00644-3. See correction [968]. Chen:2021:ESN [951] Xiaoshuang Chen, Longbin Lai, and Xuemin Lin. Efficient structural node similarity computation on billion-scale graphs. VLDB Journal: Very Large Data Bases, 30 (3):471–493, May 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00654-9. Yu:2021:VAR [952] Wenhui Yu, Xiangnan He, and Zheng Qin. Visually aware recommendation with aesthetic features. VLDB REFERENCES 159 Journal: Very Large Data Bases, 30 (4):495–513, July 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00651-y. Hao:2021:MCE [953] Shuang Hao, Nan Tang, and Ning Wang. Mis-categorized entities detection. VLDB Journal: Very Large Data Bases, 30(4):515–536, July 2021. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-021-00653w. Galhotra:2021:EEP [954] Sainyam Galhotra, Donatella Firmani, and Divesh Srivastava. Efficient and effective ER with progressive blocking. VLDB Journal: Very Large Data Bases, 30 (4):537–557, July 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00656-7. Hewasinghage:2021:CMR [955] Moditha Hewasinghage, Alberto Abelló, and Esteban Zimányi. A cost model for random access queries in document stores. VLDB Journal: Very Large Data Bases, 30 (4):559–578, July 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00660-x. Schneider:2021:DDS [956] Johannes Schneider, Phillip Wenig, and Thorsten Papenbrock. Distributed detection of sequential anomalies in univariate time series. VLDB Journal: Very Large Data Bases, 30 (4):579–602, July 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00657-6. Chen:2021:LKB [957] Zhida Chen, Lisi Chen, and Christian S. Jensen. Location- and keyword-based querying of geo-textual data: a survey. VLDB Journal: Very Large Data Bases, 30 (4):603–640, July 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00661-w. Sirin:2021:MAA [958] Utku Sirin, Pinar Tözün, and Anastasia Ailamaki. Micro-architectural analysis of in-memory OLTP: Revisited. VLDB Journal: Very Large Data Bases, 30(4):641–665, July 2021. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-021-006638. Bouros:2021:MIJ [959] Panagiotis Bouros, Nikos Mamoulis, and Manolis Terrovitis. In-memory interval joins. VLDB Journal: Very Large Data Bases, 30(4): 667–691, July 2021. CODEN VLDBFR. ISSN 1066-8888 (print), REFERENCES 160 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00639-0. Guo:2021:MAD [960] Yunyan Guo, Zhipeng Zhang, and Jianzhong Li. Model averaging in distributed machine learning: a case study with Apache Spark. VLDB Journal: Very Large Data Bases, 30 (4):693–712, July 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00664-7. Jiang:2021:EEK [961] Yuli Jiang, Xin Huang, and Hong Cheng. I/O efficient k-truss community search in massive graphs. VLDB Journal: Very Large Data Bases, 30 (5):713–738, September 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00649-y. Balayn:2021:MBU [962] Agathe Balayn, Christoph Lofi, and Geert-Jan Houben. Managing bias and unfairness in data for decision support: a survey of machine learning and data engineering approaches to identify and mitigate bias and unfairness within data management and analytics systems. VLDB Journal: Very Large Data Bases, 30(5): 739–768, September 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00671-8. Shao:2021:MAF [963] Yingxia Shao, Shiyue Huang, and Lei Chen. Memory-aware framework for fast and scalable secondorder random walk over billion-edge natural graphs. VLDB Journal: Very Large Data Bases, 30(5):769– 797, September 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00669-2. Peng:2021:EHC [964] You Peng, Xuemin Lin, and Jingren Zhou. Efficient hop-constrained s–t simple path enumeration. VLDB Journal: Very Large Data Bases, 30(5): 799–823, September 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00674-5. Debrouvier:2021:MQL [965] Ariel Debrouvier, Eliseo Parodi, and Alejandro Vaisman. A model and query language for temporal graph databases. VLDB Journal: Very Large Data Bases, 30(5):825– 858, September 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00675-4. Wang:2021:FSH [966] Jin Wang, Jiacheng Wu, and Carlo Zaniolo. Formal semantics and high performance in declarative machine learning using Datalog. VLDB Journal: Very Large Data Bases, 30(5): 859–881, September 2021. CODEN REFERENCES 161 VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00665-6. Kersten:2021:TTF [967] Timo Kersten, Viktor Leis, and Thomas Neumann. Tidy tuples and flying start: fast compilation and fast execution of relational queries in Umbra. VLDB Journal: Very Large Data Bases, 30(5): 883–905, September 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-020-00643-4. Yang:2021:CIE [968] Chengcheng Yang, Dong Deng, and Ling Shao. Correction to: Internal and external memory set containment join. VLDB Journal: Very Large Data Bases, 30 (5):907, September 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00662-9. See [950]. Boniol:2021:USS [969] Paul Boniol, Michele Linardi, and Emmanuel Remy. Unsupervised and scalable subsequence anomaly detection in large data series. VLDB Journal: Very Large Data Bases, 30(6): 909–931, November 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00655-8. See correction [1054]. Tangwongsan:2021:OSW [970] Kanat Tangwongsan, Martin Hirzel, and Scott Schneider. In-order sliding-window aggregation in worstcase constant time. VLDB Journal: Very Large Data Bases, 30(6): 933–957, November 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00668-3. Zhang:2021:HCE [971] Ji Zhang, Ke Zhou, and Jiashu Xing. CDBTune+ : an efficient deep reinforcement learning-based automatic cloud database tuning system. VLDB Journal: Very Large Data Bases, 30(6): 959–987, November 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00670-9. Wang:2021:EBS [972] Hanzhi Wang, Zhewei Wei, and JiRong Wen. ExactSim: benchmarking single-source SimRank algorithms with high-precision ground truths. VLDB Journal: Very Large Data Bases, 30 (6):989–1015, November 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00672-7. Forresi:2021:DBF [973] Chiara Forresi, Enrico Gallinucci, and Hamdi Ben Hamadou. A dataspacebased framework for OLAP analyses in a high-variety multistore. VLDB Journal: Very Large Data Bases, 30(6): 1017–1040, November 2021. CODEN REFERENCES 162 VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00682-5. Peng:2021:FDS [974] Botao Peng, Panagiota Fatourou, and Themis Palpanas. Fast data series indexing for in-memory data. VLDB Journal: Very Large Data Bases, 30(6): 1041–1067, November 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00677-2. Wei:2021:ADE [975] Ziheng Wei, Sven Hartmann, and Sebastian Link. Algorithms for the discovery of embedded functional dependencies. VLDB Journal: Very Large Data Bases, 30(6): 1069–1093, November 2021. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00684-3. Kossmann:2022:DDQ [976] Jan Kossmann, Thorsten Papenbrock, and Felix Naumann. Data dependencies for query optimization: a survey. VLDB Journal: Very Large Data Bases, 31 (1):1–22, January 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00676-3. See correction [1055]. Zhu:2022:PSA [977] Yifan Zhu, Lu Chen, and Christian S. Jensen. Pivot selection al- gorithms in metric spaces: a survey and experimental study. VLDB Journal: Very Large Data Bases, 31 (1):23–47, January 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00691-4. Schmidl:2022:EDD [978] Sebastian Schmidl and Thorsten Papenbrock. Efficient distributed discovery of bidirectional order dependencies. VLDB Journal: Very Large Data Bases, 31(1):49–74, January 2022. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-021-006834. Dignos:2022:LRJ [979] Anton Dignös, Michael H. Böhlen, and Peter Moser. Leveraging range joins for the computation of overlap joins. VLDB Journal: Very Large Data Bases, 31 (1):75–99, January 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00692-3. Peng:2022:ARE [980] You Peng, Xuemin Lin, and Lu Qin. Answering reachability and K-reach queries on large graphs with label constraints. VLDB Journal: Very Large Data Bases, 31(1): 101–127, January 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00695-0. REFERENCES 163 Li:2022:DLP [981] Wentao Li, Miao Qiao, and Xuemin Lin. Distance labeling: on parallelism, compression, and ordering. VLDB Journal: Very Large Data Bases, 31 (1):129–155, January 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00694-1. Alevizos:2022:CEF [982] Elias Alevizos, Alexander Artikis, and Georgios Paliouras. Complex event forecasting with prediction suffix trees. VLDB Journal: Very Large Data Bases, 31(1): 157–180, January 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00698-x. Snodgrass:2022:QOH [983] Richard T. Snodgrass, Sabah Currim, and Young-Kyoon Suh. Have query optimizers hit the wall? VLDB Journal: Very Large Data Bases, 31 (1):181–200, January 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00689-y. Bonifati:2022:SIB [984] Angela Bonifati and Hannes Voigt. Special issue on big graph data management and processing. VLDB Journal: Very Large Data Bases, 31 (2):201–202, March 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-022-00732-6. Wang:2022:TES [985] Kai Wang, Xuemin Lin, and Ying Zhang. Towards efficient solutions of bitruss decomposition for largescale bipartite graphs. VLDB Journal: Very Large Data Bases, 31 (2):203–226, March 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00658-5. Linghu:2022:ACE [986] Qingyuan Linghu, Fan Zhang, and Ying Zhang. Anchored coreness: efficient reinforcement of social networks. VLDB Journal: Very Large Data Bases, 31(2):227–252, March 2022. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-021-006736. Yan:2022:PPF [987] Da Yan, Wenwen Qu, and Yang Zhou. PrefixFPM: a parallel framework for general-purpose mining of frequent and closed patterns. VLDB Journal: Very Large Data Bases, 31 (2):253–286, March 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00687-0. Yan:2022:GTG [988] Da Yan, Guimu Guo, and John C. S. Lui. G-thinker: a general distributed framework for finding qualified subgraphs in a big graph REFERENCES 164 with load balancing. VLDB Journal: Very Large Data Bases, 31 (2):287–320, March 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00688-z. Mohamed:2022:RKG [989] Aisha Mohamed, Ghadeer Abuoda, and Ashraf Aboulnaga. RDFFrames: knowledge graph access for machine learning tools. VLDB Journal: Very Large Data Bases, 31 (2):321–346, March 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00690-5. Sagi:2022:DSR [990] Tomer Sagi, Matteo Lissandrini, and Katja Hose. A design space for RDF data representations. VLDB Journal: Very Large Data Bases, 31 (2):347–373, March 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00725-x. Rost:2022:DTG [991] Christopher Rost, Kevin Gomez, and Erhard Rahm. Distributed temporal graph analytics with GRADOOP. VLDB Journal: Very Large Data Bases, 31(2):375–401, March 2022. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-021-006674. Bevilacqua:2022:FME [992] Glenn S. Bevilacqua and Laks V. S. Lakshmanan. A fractional memory-efficient approach for online continuous-time influence maximization. VLDB Journal: Very Large Data Bases, 31(2):403–429, March 2022. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-021-006790. Ali:2022:SRS [993] Waqas Ali, Muhammad Saleem, and Axel-Cyrille Ngonga Ngomo. A survey of RDF stores & SPARQL engines for querying knowledge graphs. VLDB Journal: Very Large Data Bases, 31(3):1–26, May 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00711-3. Pitoura:2022:FRR [994] Evaggelia Pitoura, Kostas Stefanidis, and Georgia Koutrika. Fairness in rankings and recommendations: an overview. VLDB Journal: Very Large Data Bases, 31 (3):431–458, May 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00697-y. Hidayat:2022:CMM [995] Arif Hidayat, Muhammad Aamir Cheema, and Ying Zhang. Continuous monitoring of moving skyline and top-k queries. VLDB Journal: Very Large Data Bases, 31 REFERENCES 165 (3):459–482, May 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00702-4. Farhan:2022:FFD query execution in the cloud. VLDB Journal: Very Large Data Bases, 31 (3):555–579, May 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00709-x. [996] Muhammad Farhan, Qing Wang, and Huang:2022:PEG Brendan McKay. Fast fully dynamic labelling for distance queries. VLDB [1000] Kai Huang, Haibo Hu, and Xiaofang Zhou. Privacy and efficiency guaranJournal: Very Large Data Bases, 31 teed social subgraph matching. VLDB (3):483–506, May 2022. CODEN Journal: Very Large Data Bases, 31 VLDBFR. ISSN 1066-8888 (print), (3):581–602, May 2022. CODEN 0949-877X (electronic). URL https: VLDBFR. ISSN 1066-8888 (print), //link.springer.com/article/10. 0949-877X (electronic). URL https: 1007/s00778-021-00707-z. //link.springer.com/article/10. Zhao:2022:RCS 1007/s00778-021-00706-0. [997] Tianyu Zhao, Shuai Huang, and GuoWen:2022:SRQ liang Li. RNE: computing shortest paths using road network embed- [1001] Dong Wen, Bohua Yang, and Wenjie Zhang. Span-reachability queryding. VLDB Journal: Very Large ing in large temporal graphs. VLDB Data Bases, 31(3):507–528, May 2022. Journal: Very Large Data Bases, 31 CODEN VLDBFR. ISSN 1066(4):629–647, July 2022. CODEN 8888 (print), 0949-877X (electronic). VLDBFR. ISSN 1066-8888 (print), URL https://link.springer.com/ 0949-877X (electronic). URL https: article/10.1007/s00778-021-00705//link.springer.com/article/10. 1. 1007/s00778-021-00715-z. Lai:2022:AMW Khalil:2022:PML [998] Zhuohang Lai, Xibo Sun, and Xiaolong Xie. Accelerating multi-way [1002] Jalal Khalil, Da Yan, and Lyuheng joins on the GPU. VLDB JourYuan. Parallel mining of large maxnal: Very Large Data Bases, 31 imal quasi-cliques. VLDB Jour(3):529–553, May 2022. CODEN nal: Very Large Data Bases, 31 VLDBFR. ISSN 1066-8888 (print), (4):649–674, July 2022. CODEN 0949-877X (electronic). URL https: VLDBFR. ISSN 1066-8888 (print), //link.springer.com/article/10. 0949-877X (electronic). URL https: 1007/s00778-021-00708-y. //link.springer.com/article/10. 1007/s00778-021-00712-2. diVimercati:2022:AMQ [999] Sabrina De Capitani di Vimercati, Sara Foresti, and Pierangela Samarati. An authorization model for Kellou-Menouer:2022:SSS [1003] Kenza Kellou-Menouer, Nikolaos Kardoulakis, and Haridimos Kondy- REFERENCES 166 lakis. A survey on semantic Zhu:2022:OPP schema discovery. VLDB Journal: Very Large Data Bases, 31 [1007] Yuqing Zhu, Jing Tang, and Xueyan Tang. Optimal price profile for in(4):675–710, July 2022. CODEN fluential nodes in online social netVLDBFR. ISSN 1066-8888 (print), works. VLDB Journal: Very Large 0949-877X (electronic). URL https: Data Bases, 31(4):779–795, July 2022. //link.springer.com/article/10. CODEN VLDBFR. ISSN 10661007/s00778-021-00717-x. 8888 (print), 0949-877X (electronic). Fritz:2022:EEC URL https://link.springer.com/ article/10.1007/s00778-021-00727[1004] Manuel Fritz, Michael Behringer, and 9. Holger Schwarz. Efficient exploratory Amagata:2022:FEP clustering analyses in large-scale exploration processes. VLDB Jour[1008] Daichi Amagata, Makoto Onizuka, nal: Very Large Data Bases, 31 and Takahiro Hara. Fast, exact, (4):711–732, July 2022. CODEN and parallel-friendly outlier detecVLDBFR. ISSN 1066-8888 (print), tion algorithms with proximity graph 0949-877X (electronic). URL https: in metric spaces. VLDB Jour//link.springer.com/article/10. nal: Very Large Data Bases, 31 1007/s00778-021-00716-y. (4):797–821, July 2022. CODEN VLDBFR. ISSN 1066-8888 (print), Zheng:2022:PPW 0949-877X (electronic). URL https: [1005] Libin Zheng, Lei Chen, and Peng //link.springer.com/article/10. Cheng. Privacy-preserving worker al1007/s00778-022-00729-1. location in crowdsourcing. VLDB Huang:2022:SIR Journal: Very Large Data Bases, 31 (4):733–751, July 2022. CODEN [1009] Zi Huang, Yanyan Shen, and DiVLDBFR. ISSN 1066-8888 (print), vesh Srivastava. Special issue 0949-877X (electronic). URL https: on responsible data management //link.springer.com/article/10. and data science. VLDB Jour1007/s00778-021-00713-1. nal: Very Large Data Bases, 31 (5):823, September 2022. CODEN Qin:2022:IDR VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1006] Xuedi Qin, Chengliang Chai, and //link.springer.com/article/10. Mourad Ouzzani. Interactively dis1007/s00778-022-00761-1. covering and ranking desired tuples by data exploration. VLDB JourLi:2022:AOD nal: Very Large Data Bases, 31 (4):753–777, July 2022. CODEN [1010] Pei Li, Jaroslaw Szlichta, and Divesh Srivastava. ABC of orVLDBFR. ISSN 1066-8888 (print), der dependencies. VLDB Jour0949-877X (electronic). URL https: nal: Very Large Data Bases, 31(5): //link.springer.com/article/10. 825–849, September 2022. CODEN 1007/s00778-021-00714-0. REFERENCES 167 VLDBFR. ISSN 1066-8888 (print), Liu:2022:PGA 0949-877X (electronic). URL https: [1014] Zifan Liu, Zhechun Zhou, and //link.springer.com/article/10. Theodoros Rekatsinas. Picket: 1007/s00778-021-00696-z. guarding against corrupted data in tabular data during learning Principe:2022:AHS and inference. VLDB Journal: Very Large Data Bases, 31(5):927– [1011] Renzo Arturo Alva Principe, An955, September 2022. CODEN drea Maurino, and Blerina Spahiu. VLDBFR. ISSN 1066-8888 (print), ABSTAT-HD: a scalable tool for pro0949-877X (electronic). URL https: filing very large knowledge graphs. //link.springer.com/article/10. VLDB Journal: Very Large Data 1007/s00778-021-00699-w. Bases, 31(5):851–876, September 2022. CODEN VLDBFR. ISSN 1066Ge:2022:MMD 8888 (print), 0949-877X (electronic). URL https://link.springer.com/ [1015] Yong-Feng Ge, Maria Orlowska, and Yanchun Zhang. MDDE: multiarticle/10.1007/s00778-021-00704tasking distributed differential evolu2. tion for privacy-preserving database Wang:2022:FAP fragmentation. VLDB Journal: Very Large Data Bases, 31(5):957– 975, September 2022. CODEN [1012] Qinyong Wang, Hongzhi Yin, and VLDBFR. ISSN 1066-8888 (print), Xiangliang Zhang. Fast-adapting 0949-877X (electronic). URL https: and privacy-preserving federated rec//link.springer.com/article/10. ommender system. VLDB Jour1007/s00778-021-00718-w. nal: Very Large Data Bases, 31(5): 877–896, September 2022. CODEN Panjei:2022:SOE VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1016] Egawati Panjei, Le Gruenwald, and Shejuti Silvia. A survey on out//link.springer.com/article/10. lier explanations. VLDB Journal: 1007/s00778-021-00700-6. Very Large Data Bases, 31(5):977– Xiang:2022:GGG 1008, September 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1013] Sheng Xiang, Dong Wen, and //link.springer.com/article/10. Xuemin Lin. General graph gen1007/s00778-021-00721-1. erators: experiments, analyses, and improvements. VLDB Journal: Zeng:2022:EAS Very Large Data Bases, 31(5):897– 925, September 2022. CODEN [1017] Weixin Zeng, Xiang Zhao, and Wei Wang. On entity alignVLDBFR. ISSN 1066-8888 (print), ment at scale. VLDB Journal: 0949-877X (electronic). URL https: Very Large Data Bases, 31(5):1009– //link.springer.com/article/10. 1033, September 2022. CODEN 1007/s00778-021-00701-5. REFERENCES 168 VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00703-3. Xu:2022:PBP tion debugging in machine learning pipelines. VLDB Journal: Very Large Data Bases, 31(5):1103– 1126, September 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00726-w. [1018] Qingyu Xu, Feng Zhang, and Xiaoyong Du. Payment behavior prediction on shared parking lots Li:2022:DTA with TR-GCN. VLDB Journal: Very Large Data Bases, 31(5):1035– 1058, September 2022. CODEN [1022] Qian Li, Zhichao Wang, and Guandong Xu. Deep treatment-adaptive VLDBFR. ISSN 1066-8888 (print), network for causal inference. VLDB 0949-877X (electronic). URL https: Journal: Very Large Data Bases, 31(5): //link.springer.com/article/10. 1127–1142, September 2022. CODEN 1007/s00778-021-00722-0. VLDBFR. ISSN 1066-8888 (print), Sadiq:2022:IRN 0949-877X (electronic). URL https: //link.springer.com/article/10. [1019] Shazia Sadiq, Amir Aryani, and Xi1007/s00778-021-00724-y. aofang Zhou. Information resilience: the nexus of responsible and agile apZhang:2022:BCS proaches to information use. VLDB Journal: Very Large Data Bases, 31(5): [1023] Rui Zhang, Bayu Distiawan Trisedya, 1059–1084, September 2022. CODEN and Jianzhong Qi. A benchmark VLDBFR. ISSN 1066-8888 (print), and comprehensive survey on knowl0949-877X (electronic). URL https: edge graph entity alignment via rep//link.springer.com/article/10. resentation learning. VLDB Jour1007/s00778-021-00720-2. nal: Very Large Data Bases, 31(5): Liu:2022:ECR 1143–1168, September 2022. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-022-00747-z. [1020] Fanzhen Liu, Zhao Li, and Quan Z. Sheng. eRiskCom: an e-commerce risky community detection platform. VLDB Journal: Very Large Data Porobic:2022:SIB Bases, 31(5):1085–1101, September 2022. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). [1024] Danica Porobic. Special issue on the best papers of DaMoN 2020. VLDB URL https://link.springer.com/ Journal: Very Large Data Bases, 31 article/10.1007/s00778-021-00723(6):1169, November 2022. CODEN z. VLDBFR. ISSN 1066-8888 (print), Grafberger:2022:DDD 0949-877X (electronic). URL https: [1021] Stefan Grafberger, Paul Groth, and //link.springer.com/article/10. Sebastian Schelter. Data distribu1007/s00778-022-00766-w. REFERENCES 169 Funke:2022:LLQ //link.springer.com/article/10. 1007/s00778-022-00734-4. [1025] Henning Funke, Jan Mühlig, and Jens Huang:2022:OOC Teubner. Low-latency query compilation. VLDB Journal: Very Large Data [1029] Yihe Huang, William Qian, Eddie Bases, 31(6):1171–1184, November Kohler, Barbara Liskov, and Li2022. CODEN VLDBFR. ISSN 1066uba Shrira. Opportunities for op8888 (print), 0949-877X (electronic). timism in contended main-memory URL https://link.springer.com/ multicore transactions. VLDB Jourarticle/10.1007/s00778-022-00741nal: Very Large Data Bases, 31(6): 5. 1239–1261, November 2022. CODEN Bang:2022:FSC VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00719-9. [1026] Tiemo Bang, Norman May, Ilia Petrov, and Carsten Binnig. The full story of 1000 cores. VLDB JourKandula:2022:DIP nal: Very Large Data Bases, 31(6): 1185–1213, November 2022. CODEN [1030] Srikanth Kandula, Laurel Orr, and VLDBFR. ISSN 1066-8888 (print), Surajit Chaudhuri. Data-induced pred0949-877X (electronic). URL https: icates for sideways information pass//link.springer.com/article/10. ing in query optimizers. VLDB Jour1007/s00778-022-00742-4. nal: Very Large Data Bases, 31(6): 1263–1290, November 2022. CODEN Pietrzyk:2022:SSV VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1027] Johannes Pietrzyk, Alexander Krause, //link.springer.com/article/10. Dirk Habich, and Wolfgang Lehner. 1007/s00778-021-00693-2. To share or not to share vector registers? VLDB Journal: Herlihy:2022:CCD Very Large Data Bases, 31(6):1215– 1236, November 2022. CODEN [1031] Maurice Herlihy, Barbara Liskov, and VLDBFR. ISSN 1066-8888 (print), Liuba Shrira. Cross-chain deals and 0949-877X (electronic). URL https: adversarial commerce. VLDB Jour//link.springer.com/article/10. nal: Very Large Data Bases, 31(6): 1007/s00778-022-00744-2. 1291–1309, November 2022. CODEN VLDBFR. ISSN 1066-8888 (print), Balazinska:2022:EV 0949-877X (electronic). URL https: //link.springer.com/article/10. [1028] Magdalena Balazinska and Xiao1007/s00778-021-00686-1. fang Zhou. Editorial for S.I.: VLDB 2020. VLDB Journal: Li:2022:AAC Very Large Data Bases, 31(6):1237– 1238, November 2022. CODEN [1032] Yuanbing Li, Xian Wu, Yifei Jin, Jian Li, Guoliang Li, and Jianhua VLDBFR. ISSN 1066-8888 (print), Feng. Adapative algorithms for crowd0949-877X (electronic). URL https: REFERENCES 170 0949-877X (electronic). URL https: aided categorization. VLDB Jour//link.springer.com/article/10. nal: Very Large Data Bases, 31(6): 1007/s00778-022-00730-8. 1311–1337, November 2022. CODEN VLDBFR. ISSN 1066-8888 (print), Ding:2023:FGE 0949-877X (electronic). URL https: //link.springer.com/article/10. [1036] Zeyu Ding, Yuxin Wang, Yingtai Xiao, 1007/s00778-021-00685-2. Guanhong Wang, Danfeng Zhang, Zheng:2022:PLF and Daniel Kifer. Free gap estimates from the exponential mecha[1033] Bolong Zheng, Xi Zhao, Lianggui nism, sparse vector, noisy max and Weng, Quoc Viet Hung Nguyen, Hang related algorithms. VLDB JourLiu, and Christian S. Jensen. PM-LSH: nal: Very Large Data Bases, 32 a fast and accurate in-memory frame(1):23–48, January 2023. CODEN work for high-dimensional approximate VLDBFR. ISSN 1066-8888 (print), NN and closest pair search. VLDB 0949-877X (electronic). URL https: Journal: Very Large Data Bases, 31(6): //link.springer.com/article/10. 1339–1363, November 2022. CODEN 1007/s00778-022-00728-2. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-021-00680-7. Fan:2023:MGC [1037] Wenfei Fan, Yuanhao Li, Muyang Liu, and Can Lu. Making graphs compact by lossless contraction. VLDB [1034] Bingqing Lyu, Lu Qin, Xuemin Lin, Journal: Very Large Data Bases, 32 Ying Zhang, Zhengping Qian, and Jin(1):49–73, January 2023. CODEN gren Zhou. Maximum and top-k diverVLDBFR. ISSN 1066-8888 (print), sified biclique search at scale. VLDB 0949-877X (electronic). URL https: Journal: Very Large Data Bases, 31(6): //link.springer.com/article/10. 1365–1389, November 2022. CODEN 1007/s00778-022-00731-7. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: Lourenco:2023:BID //link.springer.com/article/10. 1007/s00778-021-00681-6. [1038] Raoni Lourenço, Juliana Freire, Eric Lyu:2022:MTE Chen:2023:HHF [1035] Wei Chen, Weiqing Wang, Hongzhi Yin, Lei Zhao, and Xiaofang Zhou. HFUL: a hybrid framework for user account linkage across locationaware social networks. VLDB Journal: Very Large Data Bases, 32 (1):1–22, January 2023. CODEN VLDBFR. ISSN 1066-8888 (print), Simon, Gabriel Weber, and Dennis Shasha. BugDoc: Iterative debugging and explanation of pipeline. VLDB Journal: Very Large Data Bases, 32 (1):75–101, January 2023. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-022-00733-5. See correction [1056]. REFERENCES 171 Pankowski:2023:ODF 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-022-00738-0. [1039] Tadeusz Pankowski. Ontological databases with faceted queries. VLDB Maroulis:2023:RAA Journal: Very Large Data Bases, 32 (1):103–121, January 2023. CODEN [1043] Stavros Maroulis, Nikos Bikakis, VLDBFR. ISSN 1066-8888 (print), George Papastefanatos, Panos Vassil0949-877X (electronic). URL https: iadis, and Yannis Vassiliou. Resource//link.springer.com/article/10. aware adaptive indexing for in situ vi1007/s00778-022-00735-3. sual exploration and analytics. VLDB Journal: Very Large Data Bases, 32 Liu:2023:ZRN (1):199–227, January 2023. CODEN [1040] Gang Liu, Leying Chen, and Shimin VLDBFR. ISSN 1066-8888 (print), Chen. Zen+: a robust NUMA0949-877X (electronic). URL https: aware OLTP engine optimized for non//link.springer.com/article/10. volatile main memory. VLDB Jour1007/s00778-022-00739-z. nal: Very Large Data Bases, 32(1): Huang:2023:DEM 123–148, January 2023. CODEN VLDBFR. ISSN 1066-8888 (print), [1044] Jiacheng Huang, Wei Hu, Zhifeng 0949-877X (electronic). URL https: Bao, Qijin Chen, and Yuzhong Qu. //link.springer.com/article/10. Deep entity matching with adversar1007/s00778-022-00737-1. ial active learning. VLDB Journal: Very Large Data Bases, 32(1): Fan:2023:ADG 229–255, January 2023. CODEN VLDBFR. ISSN 1066-8888 (print), [1041] Wenfei Fan, Ruiqi Xu, Qiang Yin, 0949-877X (electronic). URL https: Wenyuan Yu, and Jingren Zhou. //link.springer.com/article/10. Application-driven graph partition1007/s00778-022-00745-1. ing. VLDB Journal: Very Large Data Bases, 32(1):149–172, January Wang:2023:ABC 2023. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). [1045] Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, and Ying Zhang. AccelURL https://link.springer.com/ erated butterfly counting with vertex article/10.1007/s00778-022-00736priority on bipartite graphs. VLDB 2. Journal: Very Large Data Bases, 32 Miao:2023:AIR (2):257–281, March 2023. CODEN [1042] Dongjing Miao, Pengfei Zhang, Jianzhong VLDBFR. ISSN 1066-8888 (print), Li, Ye Wang, and Zhipeng Cai. 0949-877X (electronic). URL https: Approximation and inapproxima//link.springer.com/article/10. bility results on computing op1007/s00778-022-00746-0. timal repairs. VLDB Journal: Nikookar:2023:DRS Very Large Data Bases, 32(1): 173–197, January 2023. CODEN [1046] Sepideh Nikookar, Mohammadreza Esfandiari, Ria Mae Borromeo, Paras VLDBFR. ISSN 1066-8888 (print), REFERENCES 172 namic equivalences. VLDB JourSakharkar, Sihem Amer-Yahia, and nal: Very Large Data Bases, 32 Senjuti Basu Roy. Diversifying rec(2):343–368, March 2023. CODEN ommendations on sequences of sets. VLDBFR. ISSN 1066-8888 (print), VLDB Journal: Very Large Data 0949-877X (electronic). URL https: Bases, 32(2):283–304, March 2023. //link.springer.com/article/10. CODEN VLDBFR. ISSN 10661007/s00778-022-00749-x. 8888 (print), 0949-877X (electronic). URL https://link.springer.com/ Nguyen:2023:DRL article/10.1007/s00778-022-007406. [1050] Thanh Tam Nguyen, Thanh Trung Piai:2023:FGS [1047] Federico Piai, Paolo Atzeni, Paolo Merialdo, and Divesh Srivastava. Fine-grained semantic type discovery for heterogeneous sources using clustering. VLDB Journal: Very Large Data Bases, 32(2): 305–324, March 2023. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-022-00743-3. Liu:2023:URR Huynh, Hongzhi Yin, Matthias Weidlich, Thanh Thi Nguyen, Thai Son Mai, and Quoc Viet Hung Nguyen. Detecting rumours with latency guarantees using massive streaming data. VLDB Journal: Very Large Data Bases, 32(2):369–387, March 2023. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-022-007504. Li:2023:VSE [1048] Hao Liu, Jindong Han, Yanjie Fu, [1051] Yang Li, Yu Shen, Wentao Zhang, Ce Zhang, and Bin Cui. VolYanyan Li, Kai Chen, and Hui canoML: speeding up end-to-end Xiong. Unified route representaAutoML via scalable search space tion learning for multi-modal transdecomposition. VLDB Journal: portation recommendation with spaVery Large Data Bases, 32(2): tiotemporal pre-training. VLDB Jour389–413, March 2023. CODEN nal: Very Large Data Bases, 32 VLDBFR. ISSN 1066-8888 (print), (2):325–342, March 2023. CODEN 0949-877X (electronic). URL https: VLDBFR. ISSN 1066-8888 (print), //link.springer.com/article/10. 0949-877X (electronic). URL https: 1007/s00778-022-00752-2. //link.springer.com/article/10. 1007/s00778-022-00748-y. Bouganim:2023:HDP Kim:2023:FSQ [1049] Hyunjoon Kim, Yunyoung Choi, Kunsoo Park, Xuemin Lin, Seok-Hee Hong, and Wook-Shin Han. Fast subgraph query processing and subgraph matching via static and dy- [1052] Luc Bouganim, Julien Loudet, and Iulian Sandu Popa. Highly distributed and privacy-preserving queries on personal data management systems. VLDB Journal: Very Large Data Bases, 32(2):415–445, March REFERENCES 173 2023. CODEN VLDBFR. ISSN 1066Lourenco:2023:CBI 8888 (print), 0949-877X (electronic). URL https://link.springer.com/ [1056] Raoni Lourenço, Juliana Freire, Eric Simon, Gabriel Weber, and Denarticle/10.1007/s00778-022-00753nis Shasha. Correction to: Bug1. Doc iterative debugging and explanaChen:2023:IGL tion of pipeline executions. VLDB Journal: Very Large Data Bases, [1053] Jiazun Chen, Jun Gao, and Bin 32(2):473, March 2023. CODEN Cui. ICS-GNN+ : lightweight interVLDBFR. ISSN 1066-8888 (print), active community search via graph 0949-877X (electronic). URL https: neural network. VLDB Jour//link.springer.com/article/10. nal: Very Large Data Bases, 32 1007/s00778-022-00751-3. See (2):447–467, March 2023. CODEN [1038]. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: Azzalini:2023:EDA //link.springer.com/article/10. [1057] Fabio Azzalini, Davide Piantella, 1007/s00778-022-00754-0. Emanuele Rabosio, and Letizia Tanca. Boniol:2023:CUS Enhancing domain-aware multi-truth data fusion using copy-based source au[1054] Paul Boniol, Michele Linardi, Fedthority and value similarity. VLDB erico Roncallo, Themis Palpanas, Journal: Very Large Data Bases, 32 Mohammed Meftah, and Emmanuel (3):475–500, May 2023. CODEN Remy. Correction to: Unsupervised VLDBFR. ISSN 1066-8888 (print), and scalable subsequence anomaly de0949-877X (electronic). URL https: tection in large data series. VLDB //link.springer.com/article/10. Journal: Very Large Data Bases, 1007/s00778-022-00757-x. 32(2):469, March 2023. CODEN Ahmed:2023:RST VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1058] Pritom Ahmed, Ahmed Eldawy, //link.springer.com/article/10. Vagelis Hristidis, and Vassilis J. 1007/s00778-021-00678-1. See [969]. Tsotras. Reverse spatial top-k keyword queries. VLDB JourKossmann:2023:CDD nal: Very Large Data Bases, 32 (3):501–524, May 2023. CODEN [1055] Jan Kossmann, Thorsten PapenVLDBFR. ISSN 1066-8888 (print), brock, and Felix Naumann. Cor0949-877X (electronic). URL https: rection to: Data dependencies for //link.springer.com/article/10. query optimization: a survey. VLDB 1007/s00778-022-00759-9. Journal: Very Large Data Bases, 32(2):471, March 2023. CODEN Li:2023:POB VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1059] Meng Li, Rongbiao Xie, Deyi Chen, Haipeng Dai, Rong Gu, He Huang, //link.springer.com/article/10. Wanchun Dou, and Guihai Chen. A 1007/s00778-021-00710-4. See [976]. REFERENCES 174 //link.springer.com/article/10. Pareto optimal Bloom filter family 1007/s00778-022-00760-2. with hash adaptivity. VLDB Journal: Very Large Data Bases, 32 Zhang:2023:LBQ (3):525–548, May 2023. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1063] Pengcheng Zhang, Bin Yao, Chao Gao, Bin Wu, Xiao He, Feifei Li, //link.springer.com/article/10. Yuanfei Lu, Chaoqun Zhan, and Fei1007/s00778-022-00755-z. long Tang. Learning-based query opLei:2023:HDP timization for multi-probe approximate nearest neighbor search. VLDB [1060] Chuan Lei, Abdul Quamar, Vasilis Journal: Very Large Data Bases, 32 Efthymiou, Fatma Özcan, and Rana (3):623–645, May 2023. CODEN Alotaibi. HERMES: data placement VLDBFR. ISSN 1066-8888 (print), and schema optimization for enter0949-877X (electronic). URL https: prise knowledge bases. VLDB Jour//link.springer.com/article/10. nal: Very Large Data Bases, 32 1007/s00778-022-00762-0. (3):549–574, May 2023. CODEN VLDBFR. ISSN 1066-8888 (print), Luo:2023:TMH 0949-877X (electronic). URL https: //link.springer.com/article/10. [1064] Qi Luo, Dongxiao Yu, Zhipeng Cai, 1007/s00778-022-00756-y. Xuemin Lin, Guanghui Wang, and Xiuzhen Cheng. Toward mainteLi:2023:ENQ nance of hypercores in large-scale dynamic hypergraphs. VLDB Jour[1061] Jiajia Li, Cancan Ni, Dan He, Lei Li, nal: Very Large Data Bases, 32 Xiufeng Xia, and Xiaofang Zhou. Effi(3):647–664, May 2023. CODEN cient k NN query for moving objects on VLDBFR. ISSN 1066-8888 (print), time-dependent road networks. VLDB 0949-877X (electronic). URL https: Journal: Very Large Data Bases, 32 //link.springer.com/article/10. (3):575–594, May 2023. CODEN 1007/s00778-022-00763-z. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: Zhang:2023:PPB //link.springer.com/article/10. 1007/s00778-022-00758-w. [1065] Liang Zhang, Noura Alghamdi, Huayi Zhang, Mohamed Y. Eltabakh, and Liu:2023:MCS Elke A. Rundensteiner. PARROT: [1062] Ziyi Liu, Lei Li, Mengxuan Zhang, pattern-based correlation exploitation Wen Hua, and Xiaofang Zhou. Multiin big partitioned data series. VLDB constraint shortest path using forJournal: Very Large Data Bases, 32 est hop labeling. VLDB Jour(3):665–688, May 2023. CODEN nal: Very Large Data Bases, 32 VLDBFR. ISSN 1066-8888 (print), (3):595–621, May 2023. CODEN 0949-877X (electronic). URL https: VLDBFR. ISSN 1066-8888 (print), //link.springer.com/article/10. 0949-877X (electronic). URL https: 1007/s00778-022-00767-9. REFERENCES 175 Wellenzohn:2023:RSC [1066] Kevin Wellenzohn, Michael H. Böhlen, Sven Helmer, Antoine Pietri, and Stefano Zacchiroli. Robust and scalable content-and-structure indexing. VLDB Journal: Very Large Data Bases, 32 (4):689–715, July 2023. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-022-00764-y. data series progressive k-NN similarity search and classification with probabilistic quality guarantees. VLDB Journal: Very Large Data Bases, 32 (4):763–789, July 2023. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-022-00771-z. Whang:2023:DCQ [1070] Steven Euijong Whang, Yuji Roh, Hwanjun Song, and Jae-Gil Lee. Data collection and quality chal[1067] Xupeng Miao, Wentao Zhang, Yuezlenges in deep learning: a dataihan Jiang, Fangcheng Fu, Yingxia centric AI perspective. VLDB JourShao, Lei Chen, Yangyu Tao, Gang nal: Very Large Data Bases, 32 Cao, and Bin Cui. P2 CG: a privacy (4):791–813, July 2023. CODEN preserving collaborative graph neural VLDBFR. ISSN 1066-8888 (print), network training framework. VLDB 0949-877X (electronic). URL https: Journal: Very Large Data Bases, 32 //link.springer.com/article/10. (4):717–736, July 2023. CODEN 1007/s00778-022-00775-9. VLDBFR. ISSN 1066-8888 (print), Lou:2023:TTA 0949-877X (electronic). URL https: //link.springer.com/article/10. [1071] Yunkai Lou, Chaokun Wang, Tiankai 1007/s00778-022-00768-8. Gu, Hao Feng, Jun Chen, and JefIslam:2023:GFE frey Xu Yu. Time-topology analysis on temporal graphs. VLDB [1068] Md Mouinul Islam, Mahsa Asadi, SiJournal: Very Large Data Bases, 32 hem Amer-Yahia, and Senjuti Basu (4):815–843, July 2023. CODEN Roy. A generic framework for VLDBFR. ISSN 1066-8888 (print), efficient computation of top-k di0949-877X (electronic). URL https: verse results. VLDB Journal: //link.springer.com/article/10. Very Large Data Bases, 32(4): 1007/s00778-022-00772-y. 737–761, July 2023. CODEN Miao:2023:PPP VLDBFR. ISSN 1066-8888 (print), Ntroumpogiannis:2023:MLA 0949-877X (electronic). URL https: //link.springer.com/article/10. [1072] Antonios Ntroumpogiannis, Michail 1007/s00778-022-00770-0. Giannoulis, Nikolaos Myrtakis, Vassilis Christophides, Eric Simon, and IoanEchihabi:2023:PDS nis Tsamardinos. A meta-level analy[1069] Karima Echihabi, Theophanis Tsandisis of online anomaly detectors. VLDB las, Anna Gogolou, Anastasia BezeJournal: Very Large Data Bases, 32 rianos, and Themis Palpanas. ProS: (4):845–886, July 2023. CODEN REFERENCES 176 VLDBFR. ISSN 1066-8888 (print), Yamada:2023:ALT 0949-877X (electronic). URL https: [1076] Masaya Yamada, Hiroyuki Kitagawa, //link.springer.com/article/10. Toshiyuki Amagasa, and Akiyoshi 1007/s00778-022-00773-x. Matono. Augmented lineage: traceability of data analysis including comZhang:2023:SSQ plex UDF processing. VLDB Journal: Very Large Data Bases, 32(5): [1073] Dongxiang Zhang, Zhihao Chang, 963–983, September 2023. CODEN Dingyu Yang, Dongsheng Li, KianVLDBFR. ISSN 1066-8888 (print), Lee Tan, Ke Chen, and Gang Chen. 0949-877X (electronic). URL https: SQUID: subtrajectory query in trillion//link.springer.com/article/10. scale GPS database. VLDB Jour1007/s00778-022-00769-7. nal: Very Large Data Bases, 32 (4):887–904, July 2023. CODEN Verwiebe:2023:SWT VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1077] Juliane Verwiebe, Philipp M. Grulich, Jonas Traub, and Volker Markl. Sur//link.springer.com/article/10. vey of window types for aggregation 1007/s00778-022-00777-7. in stream processing systems. VLDB Journal: Very Large Data Bases, 32(5): Katsogiannis-Meimarakis:2023:SDL 985–1011, September 2023. CODEN VLDBFR. ISSN 1066-8888 (print), [1074] George Katsogiannis-Meimarakis and 0949-877X (electronic). URL https: Georgia Koutrika. A survey on //link.springer.com/article/10. deep learning approaches for text-to1007/s00778-022-00778-6. See SQL. VLDB Journal: Very Large [1104]. Data Bases, 32(4):905–936, July 2023. CODEN VLDBFR. ISSN 1066Zhou:2023:BCB 8888 (print), 0949-877X (electronic). URL https://link.springer.com/ [1078] Alexander Zhou, Yue Wang, and Lei Chen. Butterfly counting and article/10.1007/s00778-022-00776bitruss decomposition on uncertain 8. bipartite graphs. VLDB Journal: Zhao:2023:LSS Very Large Data Bases, 32(5):1013– 1036, September 2023. CODEN VLDBFR. ISSN 1066-8888 (print), [1075] Kangfei Zhao, Jeffrey Xu Yu, Qiyan 0949-877X (electronic). URL https: Li, Hao Zhang, and Yu Rong. Learned //link.springer.com/article/10. sketch for subgraph counting: a 1007/s00778-023-00782-4. holistic approach. VLDB Journal: Very Large Data Bases, 32(5): Hirsch:2023:EDK 937–962, September 2023. CODEN VLDBFR. ISSN 1066-8888 (print), [1079] Vitali Hirsch, Peter Reimann, Dennis Treder-Tschechlov, Holger Schwarz, 0949-877X (electronic). URL https: and Bernhard Mitschang. Ex//link.springer.com/article/10. ploiting domain knowledge to ad1007/s00778-023-00781-5. REFERENCES 177 0949-877X (electronic). URL https: dress class imbalance and a het//link.springer.com/article/10. erogeneous feature space in multi1007/s00778-023-00784-2. class classification. VLDB Journal: Very Large Data Bases, 32(5): Yang:2023:BCE 1037–1064, September 2023. CODEN VLDBFR. ISSN 1066-8888 (print), [1083] Jianye Yang, Yun Peng, Dian Ouyang, 0949-877X (electronic). URL https: Wenjie Zhang, Xuemin Lin, and Xi//link.springer.com/article/10. ang Zhao. (p, q)-biclique counting 1007/s00778-023-00780-6. and enumeration for large sparse bipartite graphs. VLDB Journal: Xu:2023:LUI Very Large Data Bases, 32(5):1137– [1080] Jia Xu, Zulong Chen, Wanjie Tao, 1161, September 2023. CODEN Ziyi Wang, Detao Lv, Yao Yu, VLDBFR. ISSN 1066-8888 (print), and Chuanfei Xu. Leveraging user 0949-877X (electronic). URL https: itinerary to improve personalized deep //link.springer.com/article/10. matching at Fliggy. VLDB Jour1007/s00778-023-00786-0. nal: Very Large Data Bases, 32(5): Naumann:2023:ESI 1065–1086, September 2023. CODEN VLDBFR. ISSN 1066-8888 (print), [1084] Felix Naumann and Xin Luna Dong. 0949-877X (electronic). URL https: Editorial: Special issue for selected //link.springer.com/article/10. papers of VLDB 2021. VLDB Jour1007/s00778-023-00787-z. nal: Very Large Data Bases, 32 Gou:2023:SWB (6):1163, November 2023. CODEN VLDBFR. ISSN 1066-8888 (print), [1081] Xiangyang Gou and Lei Zou. Slid0949-877X (electronic). URL https: ing window-based approximate trian//link.springer.com/article/10. gle counting with bounded memory us1007/s00778-023-00792-2. age. VLDB Journal: Very Large Data Fent:2023:PPE Bases, 32(5):1087–1110, September 2023. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). [1085] Philipp Fent, Altan Birler, and Thomas Neumann. Practical planURL https://link.springer.com/ ning and execution of groupjoin and article/10.1007/s00778-023-00783nested aggregates. VLDB Jour3. nal: Very Large Data Bases, 32(6): Schiavio:2023:DDQ 1165–1190, November 2023. CODEN VLDBFR. ISSN 1066-8888 (print), [1082] Filippo Schiavio, Daniele Bonetta, 0949-877X (electronic). URL https: and Walter Binder. DynQ: a dy//link.springer.com/article/10. namic query engine with query1007/s00778-022-00765-x. reuse capabilities embedded in a polyglot runtime. VLDB Journal: Farias:2023:LDD Very Large Data Bases, 32(5):1111– 1135, September 2023. CODEN [1086] Victor A. E. Farias, Felipe T. Brito, Cheryl Flynn, Javam C. Machado, SubVLDBFR. ISSN 1066-8888 (print), REFERENCES 178 VLDBFR. ISSN 1066-8888 (print), habrata Majumdar, and Divesh Sri0949-877X (electronic). URL https: vastava. Local dampening: differen//link.springer.com/article/10. tial privacy for non-numeric queries 1007/s00778-023-00789-x. via local sensitivity. VLDB Journal: Very Large Data Bases, 32(6): Qian:2023:IDD 1191–1214, November 2023. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1090] Chaoqin Qian, Menglu Li, Zijing Tan, Ai Ran, and Shuai Ma. Incremental //link.springer.com/article/10. discovery of denial constraints. VLDB 1007/s00778-022-00774-w. Journal: Very Large Data Bases, 32(6): Li:2023:EEM 1289–1313, November 2023. CODEN VLDBFR. ISSN 1066-8888 (print), [1087] Yuliang Li, Jinfeng Li, Yoshi Suhara, 0949-877X (electronic). URL https: AnHai Doan, and Wang-Chiew Tan. //link.springer.com/article/10. Effective entity matching with trans1007/s00778-023-00788-y. formers. VLDB Journal: Very Large Data Bases, 32(6):1215–1235, Wang:2023:TGC November 2023. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X [1091] Zuozhi Wang, Kai Zeng, Botong (electronic). URL https://link. Huang, Wei Chen, Xiaozong Cui, springer.com/article/10.1007/s00778Bo Wang, Ji Liu, Liya Fan, Dachuan 023-00779-z. Qu, Zhenyu Hou, Tao Guan, Chen Yang:2023:PSE [1088] Renchi Yang, Jieming Shi, Xiaokui Xiao, Yin Yang, Sourav S. Bhowmick, and Juncheng Liu. PANE: scalable and effective attributed network embedding. VLDB Journal: Very Large Data Bases, 32(6):1237– 1262, November 2023. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-023-00790-4. Li, and Jingren Zhou. Tempura: a general cost-based optimizer framework for incremental data processing (journal version). VLDB Journal: Very Large Data Bases, 32(6): 1315–1342, November 2023. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-023-00785-1. Hellings:2023:BSB [1092] Jelle Hellings and Mohammad Sadoghi. ByShard: sharding in a Byzan[1089] Dian Ouyang, Dong Wen, Lu Qin, tine environment. VLDB Journal: Lijun Chang, Xuemin Lin, and Ying Very Large Data Bases, 32(6):1343– Zhang. When hierarchy meets 2-hop1367, November 2023. CODEN labeling: efficient shortest distance and VLDBFR. ISSN 1066-8888 (print), path queries on road networks. VLDB 0949-877X (electronic). URL https: Journal: Very Large Data Bases, 32(6): //link.springer.com/article/10. 1263–1287, November 2023. CODEN 1007/s00778-023-00794-0. Ouyang:2023:WHM REFERENCES 179 Papadakis:2023:AOO 2024. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-023-00797x. [1093] George Papadakis, Vasilis Efthymiou, Emmanouil Thanos, Oktie Hassanzadeh, and Peter Christen. An analysis of one-to-one matching algorithms Christodoulou:2024:HHI for entity resolution. VLDB Journal: Very Large Data Bases, 32(6): [1097] George Christodoulou, Panagiotis 1369–1400, November 2023. CODEN Bouros, and Nikos Mamoulis. HINT: VLDBFR. ISSN 1066-8888 (print), a hierarchical interval index for 0949-877X (electronic). URL https: Allen relationships. VLDB Jour//link.springer.com/article/10. nal: Very Large Data Bases, 33 1007/s00778-023-00791-3. (1):73–100, January 2024. CODEN Wang:2024:SDC VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1094] Haoyu Wang, Aoqian Zhang, Shaoxu //link.springer.com/article/10. Song, and Jianmin Wang. Stream1007/s00778-023-00798-w. ing data cleaning based on speed Farhan:2024:BBD change. VLDB Journal: Very Large Data Bases, 33(1):1–24, January 2024. CODEN VLDBFR. ISSN 1066- [1098] Muhammad Farhan, Henning Koehler, and Qing Wang. BatchHL+ : batch 8888 (print), 0949-877X (electronic). dynamic labelling for distance queries URL https://link.springer.com/ on large-scale networks. VLDB Jourarticle/10.1007/s00778-023-00796nal: Very Large Data Bases, 33(1): y. 101–129, January 2024. CODEN Aghasadeghi:2024:TGP VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1095] Amir Aghasadeghi, Jan Van den Buss//link.springer.com/article/10. che, and Julia Stoyanovich. Tem1007/s00778-023-00799-9. poral graph patterns by timed automata. VLDB Journal: Very Large Meilicke:2024:ABR Data Bases, 33(1):25–47, January 2024. CODEN VLDBFR. ISSN 1066- [1099] Christian Meilicke, Melisachew Wudage Chekol, Patrick Betz, Manuel Fink, 8888 (print), 0949-877X (electronic). and Heiner Stuckeschmidt. Anytime URL https://link.springer.com/ bottom-up rule learning for large-scale article/10.1007/s00778-023-00795knowledge graph completion. VLDB z. Journal: Very Large Data Bases, 33 Chang:2024:NOA (1):131–161, January 2024. CODEN [1096] Lijun Chang and Zhiyi Wang. A nearVLDBFR. ISSN 1066-8888 (print), optimal approach to edge connectivity0949-877X (electronic). URL https: based hierarchical graph decomposi//link.springer.com/article/10. tion. VLDB Journal: Very Large 1007/s00778-023-00800-5. See corData Bases, 33(1):49–71, January rection [1222]. REFERENCES 180 Zhao:2024:CBT itiveness of a dataset in relation to general preferences. VLDB Journal: Very Large Data Bases, 33(1): 231–250, January 2024. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-023-00804-1. [1100] Yan Zhao, Kai Zheng, Ziwei Wang, Liwei Deng, Bin Yang, Torben Bach Pedersen, Christian S. Jensen, and Xiaofang Zhou. Coalition-based task assignment with priority-aware fairness in spatial crowdsourcing. VLDB Journal: Very Large Data Bases, 33 Verwiebe:2024:CSW (1):163–184, January 2024. CODEN VLDBFR. ISSN 1066-8888 (print), [1104] Juliane Verwiebe, Philipp M. Grulich, 0949-877X (electronic). URL https: Jonas Traub, and Volker Markl. //link.springer.com/article/10. Correction to: Survey of window 1007/s00778-023-00802-3. types for aggregation in stream Shaham:2024:SSD processing systems. VLDB Journal: Very Large Data Bases, 33 [1101] Sina Shaham, Gabriel Ghinita, and (1):251, January 2024. CODEN Cyrus Shahabi. Supporting secure dyVLDBFR. ISSN 1066-8888 (print), namic alert zones using searchable en0949-877X (electronic). URL https: cryption and graph embedding. VLDB //link.springer.com/article/10. Journal: Very Large Data Bases, 33 1007/s00778-023-00793-1. See (1):185–206, January 2024. CODEN [1077]. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: Yang:2024:CTF //link.springer.com/article/10. [1105] Fan Yang, Faisal M. Almutairi, 1007/s00778-023-00803-2. Hyun Ah Song, Christos Faloutsos, Ma:2024:ADD Nicholas D. Sidiropoulos, and Vladimir Zadorozhny. Correction to: Turbo[1102] Chenhao Ma, Yixiang Fang, Reynold Lift: fast accuracy lifting for hisCheng, Laks V. S. Lakshmanan, Xitorical data recovery. VLDB Jouraolin Han, and Xiaodong Li. Acnal: Very Large Data Bases, 33 celerating directed densest subgraph (1):253, January 2024. CODEN queries with software and hardVLDBFR. ISSN 1066-8888 (print), ware approaches. VLDB Jour0949-877X (electronic). URL https: nal: Very Large Data Bases, 33(1): //link.springer.com/article/10. 207–230, January 2024. CODEN 1007/s00778-023-00801-4. See [910]. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: Liu:2024:TDS //link.springer.com/article/10. 1007/s00778-023-00805-0. [1106] Tongyu Liu, Ju Fan, Guoliang Li, Nan Tang, and Xiaoyong Du. TabMouratidis:2024:QCD ular data synthesis with generative [1103] Kyriakos Mouratidis, Keming Li, and adversarial networks: design space Bo Tang. Quantifying the competand optimizations. VLDB Jour- REFERENCES 181 nal: Very Large Data Bases, 33 Arroyuelo:2024:ORC (2):255–280, March 2024. CODEN VLDBFR. ISSN 1066-8888 (print), [1110] Diego Arroyuelo, Adrián GómezBrandón, Aidan Hogan, Gonzalo 0949-877X (electronic). URL https: Navarro, and Javiel Rojas-Ledesma. //link.springer.com/article/10. Optimizing RPQs over a compact 1007/s00778-023-00807-y. graph representation. VLDB Journal: Very Large Data Bases, 33 Karpov:2024:MFA (2):349–374, March 2024. CODEN [1107] Nikolai Karpov, Haoyu Zhang, and VLDBFR. ISSN 1066-8888 (print), Qin Zhang. MinJoin++: a fast 0949-877X (electronic). URL https: algorithm for string similarity joins //link.springer.com/article/10. under edit distance. VLDB Jour1007/s00778-023-00811-2. nal: Very Large Data Bases, 33 Chen:2024:QEP (2):281–299, March 2024. CODEN VLDBFR. ISSN 1066-8888 (print), [1111] Zhiwen Chen, Daokun Hu, Wenkui 0949-877X (electronic). URL https: Che, Jianhua Sun, and Hao Chen. //link.springer.com/article/10. A quantitative evaluation of persis1007/s00778-023-00806-z. tent memory hash indexes. VLDB Journal: Very Large Data Bases, 33 Usta:2024:XEN (2):375–397, March 2024. CODEN VLDBFR. ISSN 1066-8888 (print), [1108] Arif Usta, Akifhan Karakayali, and 0949-877X (electronic). URL https: Özgür Ulusoy. xDBTagger: explain//link.springer.com/article/10. able natural language interface to 1007/s00778-023-00812-1. databases using keyword mappings Abello:2024:EEM and schema graph. VLDB Journal: Very Large Data Bases, 33 [1112] Alberto Abelló and James Cheney. (2):301–321, March 2024. CODEN Eris: efficiently measuring discord VLDBFR. ISSN 1066-8888 (print), in multidimensional sources. VLDB 0949-877X (electronic). URL https: Journal: Very Large Data Bases, 33 //link.springer.com/article/10. (2):399–423, March 2024. CODEN 1007/s00778-023-00809-w. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: Wang:2024:CEU //link.springer.com/article/10. 1007/s00778-023-00810-3. [1109] Jiayi Wang, Chengliang Chai, Jiabin Liu, and Guoliang Li. Cardinality estiJiang:2024:SEM mation using normalizing flow. VLDB Journal: Very Large Data Bases, 33 [1113] Jiawei Jiang, Shaoduo Gan, Bo Du, Gustavo Alonso, Ana Klimovic, Ankit (2):323–348, March 2024. CODEN Singla, Wentao Wu, Sheng Wang, VLDBFR. ISSN 1066-8888 (print), and Ce Zhang. A systematic evalu0949-877X (electronic). URL https: ation of machine learning on server//link.springer.com/article/10. less infrastructure. VLDB Jour1007/s00778-023-00808-x. REFERENCES 182 nal: Very Large Data Bases, 33 Zhao:2024:RRE (2):425–449, March 2024. CODEN VLDBFR. ISSN 1066-8888 (print), [1117] Hongyao Zhao, Jingyao Li, Wei Lu, Qian Zhang, Wanqing Yang, Jia0949-877X (electronic). URL https: jia Zhong, Meihui Zhang, Haixiang //link.springer.com/article/10. Li, Xiaoyong Du, and Anqun Pan. 1007/s00778-023-00813-0. RCBench: an RDMA-enabled transZhang:2024:STS action framework for analyzing concurrency control algorithms. VLDB Journal: Very Large Data Bases, 33 [1114] Shuhao Zhang, Juan Soto, and Volker (2):543–567, March 2024. CODEN Markl. A survey on transactional VLDBFR. ISSN 1066-8888 (print), stream processing. VLDB Jour0949-877X (electronic). URL https: nal: Very Large Data Bases, 33 //link.springer.com/article/10. (2):451–479, March 2024. CODEN 1007/s00778-023-00821-0. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: Zhang:2024:LCS //link.springer.com/article/10. 1007/s00778-023-00814-z. [1118] Junhua Zhang, Long Yuan, WendHondt:2024:EDM [1115] Jens E. d’Hondt, Koen Minartz, and Odysseas Papapetrou. Efficient detection of multivariate correlations with different correlation measures. VLDB Journal: Very Large Data Bases, 33 (2):481–505, March 2024. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-023-00815-y. tao Li, Lu Qin, Ying Zhang, and Wenjie Zhang. Label-constrained shortest path query processing on road networks. VLDB Journal: Very Large Data Bases, 33(3): 569–593, May 2024. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-023-00825-w. Fang:2024:NWC [1119] James Fang, Dmitry Lychagin, Michael J. Carey, and Vassilis J. Tsotras. A new window clause for SQL++. VLDB Journal: Very Large Data Bases, 33 [1116] Marios Fragkoulis, Paris Carbone, (3):595–623, May 2024. CODEN Vasiliki Kalavri, and Asterios KatsiVLDBFR. ISSN 1066-8888 (print), fodimos. A survey on the evolution 0949-877X (electronic). URL https: of stream processing systems. VLDB //link.springer.com/article/10. Journal: Very Large Data Bases, 33 1007/s00778-023-00830-z. (2):507–541, March 2024. CODEN VLDBFR. ISSN 1066-8888 (print), Lee:2024:HMT 0949-877X (electronic). URL https: [1120] Geon Lee, Seokbum Yoon, Jihoon //link.springer.com/article/10. Ko, Hyunju Kim, and Kijung Shin. 1007/s00778-023-00819-8. Fragkoulis:2024:SES REFERENCES 183 Hypergraph motifs and their extenXia:2024:TSD sions beyond binary. VLDB Journal: Very Large Data Bases, 33 [1124] Tianrui Xia, Jinzhao Xiao, Yuxiang Huang, Changyu Hu, Shaoxu (3):625–665, May 2024. CODEN Song, Xiangdong Huang, and JianVLDBFR. ISSN 1066-8888 (print), min Wang. Time series data encod0949-877X (electronic). URL https: ing in Apache IoTDB: comparative //link.springer.com/article/10. analysis and recommendation. VLDB 1007/s00778-023-00827-8. Journal: Very Large Data Bases, 33 Liao:2024:SDG (3):727–752, May 2024. CODEN VLDBFR. ISSN 1066-8888 (print), [1121] Ningyi Liao, Dingheng Mo, Siqiang 0949-877X (electronic). URL https: Luo, Xiang Li, and Pengcheng Yin. //link.springer.com/article/10. Scalable decoupling graph neural net1007/s00778-024-00840-5. work with feature-oriented optimization. VLDB Journal: Very Large Ting:2024:NDT Data Bases, 33(3):667–683, May 2024. CODEN VLDBFR. ISSN 1066- [1125] Kai Ming Ting, Zongyou Liu, Lei Gong, Hang Zhang, and Ye Zhu. 8888 (print), 0949-877X (electronic). A new distributional treatment for URL https://link.springer.com/ time series anomaly detection. VLDB article/10.1007/s00778-023-00829Journal: Very Large Data Bases, 33 6. (3):753–780, May 2024. CODEN Liang:2024:STC VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1122] Anqi Liang, Bin Yao, Bo Wang, Yin//link.springer.com/article/10. pei Liu, Zhida Chen, Jiong Xie, and 1007/s00778-023-00832-x. Feifei Li. Sub-trajectory clustering with deep reinforcement learning. VLDB Gong:2024:IAI Journal: Very Large Data Bases, 33 (3):685–702, May 2024. CODEN [1126] Shufeng Gong, Chao Tian, Qiang Yin, Zhengdong Wang, Song Yu, Yanfeng VLDBFR. ISSN 1066-8888 (print), Zhang, Wenyuan Yu, Liang Geng, 0949-877X (electronic). URL https: Chong Fu, Ge Yu, and Jingren Zhou. //link.springer.com/article/10. Ingress: an automated incremental 1007/s00778-023-00833-w. graph processing system. VLDB Yao:2024:ISB Journal: Very Large Data Bases, 33 (3):781–806, May 2024. CODEN [1123] Kai Yao, Lijun Chang, and JefVLDBFR. ISSN 1066-8888 (print), frey Xu Yu. Identifying similar0949-877X (electronic). URL https: bicliques in bipartite graphs. VLDB //link.springer.com/article/10. Journal: Very Large Data Bases, 33 1007/s00778-024-00838-z. (3):703–726, May 2024. CODEN VLDBFR. ISSN 1066-8888 (print), Lin:2024:RRE 0949-877X (electronic). URL https: [1127] Hong Lin, Ke Chen, Dawei Jiang, //link.springer.com/article/10. Lidan Shou, and Gang Chen. Re1007/s00778-023-00834-9. REFERENCES 184 (3):883–900, May 2024. CODEN finer: a reliable and efficient incentiveVLDBFR. ISSN 1066-8888 (print), driven federated learning system pow0949-877X (electronic). URL https: ered by blockchain. VLDB Jour//link.springer.com/article/10. nal: Very Large Data Bases, 33 1007/s00778-024-00843-2. (3):807–831, May 2024. CODEN VLDBFR. ISSN 1066-8888 (print), Boehm:2024:SIM 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-024-00839-y. See cor- [1131] Matthias Boehm and Nesime Tatbul. Special issue on “Machine rection [1166]. learning and databases”. VLDB Jiang:2024:HGM Journal: Very Large Data Bases, 33(4):901, July 2024. CODEN [1128] Jiawei Jiang, Yi Wei, Yu Liu, Wentao VLDBFR. ISSN 1066-8888 (print), Wu, Chuang Hu, Zhigao Zheng, Ziyi 0949-877X (electronic). URL https: Zhang, Yingxia Shao, and Ce Zhang. //link.springer.com/article/10. How good are machine learning 1007/s00778-024-00848-x. clouds? Benchmarking two snapshots over 5 years. VLDB JourKara:2024:FIA nal: Very Large Data Bases, 33 (3):833–857, May 2024. CODEN VLDBFR. ISSN 1066-8888 (print), [1132] Ahmet Kara, Milos Nikolic, Dan Olteanu, and Haozhe Zhang. F-IVM: 0949-877X (electronic). URL https: analytics over relational databases //link.springer.com/article/10. under updates. VLDB Journal: 1007/s00778-024-00842-3. Very Large Data Bases, 33(4): Magalhaes:2024:MDM 903–929, July 2024. CODEN VLDBFR. ISSN 1066-8888 (print), [1129] Arlino Magalhaes, Angelo Brayner, 0949-877X (electronic). URL https: and Jose Maria Monteiro. MM//link.springer.com/article/10. DIRECT: Main memory database 1007/s00778-023-00817-w. instant recovery with tuple consistent checkpoint. VLDB JourHuang:2024:ERA nal: Very Large Data Bases, 33 (3):859–882, May 2024. CODEN VLDBFR. ISSN 1066-8888 (print), [1133] Enhui Huang, Yanlei Diao, Anna Liu, Liping Peng, and Luciano Di 0949-877X (electronic). URL https: Palma. Efficient and robust ac//link.springer.com/article/10. tive learning methods for interactive 1007/s00778-024-00846-z. database exploration. VLDB JourJia:2024:HNA nal: Very Large Data Bases, 33 [1130] Tong Jia, Ying Li, Yong Yang, (4):931–956, July 2024. CODEN and Gang Huang. Hilogx: noiseVLDBFR. ISSN 1066-8888 (print), aware log-based anomaly detection 0949-877X (electronic). URL https: with human feedback. VLDB Jour//link.springer.com/article/10. nal: Very Large Data Bases, 33 1007/s00778-023-00816-x. REFERENCES 185 Neutatz:2024:AHC VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-023-00824-x. [1134] Felix Neutatz, Marius Lindauer, and Ziawasch Abedjan. AutoML in heavily constrained applications. VLDB Journal: Very Large Data Bases, 33 Luo:2024:MPM (4):957–979, July 2024. CODEN VLDBFR. ISSN 1066-8888 (print), [1138] Yongping Luo, Peiquan Jin, Zhaole 0949-877X (electronic). URL https: Chu, Xiaoliang Wang, Yigui Yuan, //link.springer.com/article/10. Zhou Zhang, Yun Luo, Xufei Wu, 1007/s00778-023-00820-1. and Peng Zou. Morphtree: a polymorphic main-memory learned index Meduri:2024:AAL for dynamic workloads. VLDB Jour[1135] Venkata Vamsikrishna Meduri, Abdul nal: Very Large Data Bases, 33 Quamar, Chuan Lei, Xiao Qin, and (4):1065–1084, July 2024. CODEN Berthold Reinwald. Alfa: active learnVLDBFR. ISSN 1066-8888 (print), ing for graph neural network-based 0949-877X (electronic). URL https: semantic schema alignment. VLDB //link.springer.com/article/10. Journal: Very Large Data Bases, 33 1007/s00778-023-00823-y. (4):981–1011, July 2024. CODEN VLDBFR. ISSN 1066-8888 (print), Trummer:2024:DBM 0949-877X (electronic). URL https: //link.springer.com/article/10. [1139] Immanuel Trummer. DB-BERT: mak1007/s00778-023-00822-z. ing database tuning tools “read” the manual. VLDB Journal: Very Large Olteanu:2024:GRD Data Bases, 33(4):1085–1104, July [1136] Dan Olteanu, Nils Vortmeier, and 2024. CODEN VLDBFR. ISSN 1066– Dor– de Živanović. Givens rotations for 8888 (print), 0949-877X (electronic). QR decomposition, SVD and PCA URL https://link.springer.com/ over database joins. VLDB Jourarticle/10.1007/s00778-023-00831nal: Very Large Data Bases, 33 y. (4):1013–1037, July 2024. CODEN VLDBFR. ISSN 1066-8888 (print), Huynh:2024:TFR 0949-877X (electronic). URL https: //link.springer.com/article/10. [1140] Andy Huynh, Harshal A. Chaudhari, 1007/s00778-023-00818-9. Evimaria Terzi, and Manos Athanassoulis. Towards flexibility and roPaganelli:2024:MFA bustness of LSM trees. VLDB Jour[1137] Matteo Paganelli, Donato Tiano, nal: Very Large Data Bases, 33 and Francesco Guerra. A multi(4):1105–1128, July 2024. CODEN facet analysis of BERT-based enVLDBFR. ISSN 1066-8888 (print), tity matching models. VLDB Jour0949-877X (electronic). URL https: nal: Very Large Data Bases, 33 //link.springer.com/article/10. (4):1039–1064, July 2024. CODEN 1007/s00778-023-00826-9. REFERENCES 186 Redyuk:2024:ADD CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-024-00857w. [1141] Sergey Redyuk, Zoi Kaoudi, Sebastian Schelter, and Volker Markl. Assisted design of data science pipelines. VLDB Journal: Very Large Data Bases, 33 Xu:2024:SGD (4):1129–1153, July 2024. CODEN VLDBFR. ISSN 1066-8888 (print), [1145] Lijie Xu, Shuang Qiu, Binhang Yuan, 0949-877X (electronic). URL https: Jiawei Jiang, Cedric Renggli, Shao//link.springer.com/article/10. duo Gan, Kaan Kara, Guoliang Li, 1007/s00778-024-00835-2. Ji Liu, Wentao Wu, Jieping Ye, and Ce Zhang. Stochastic gradient descent Vu:2024:LBF without full data shuffle: with appli[1142] Tin Vu, Alberto Belussi, Sara Migliorcations to in-database machine learnini, and Ahmed Eldawy. A learninging and deep learning systems. VLDB based framework for spatial join Journal: Very Large Data Bases, 33(5): processing: estimation, optimiza1231–1255, September 2024. CODEN tion and tuning. VLDB JourVLDBFR. ISSN 1066-8888 (print), nal: Very Large Data Bases, 33 0949-877X (electronic). URL https: (4):1155–1177, July 2024. CODEN //link.springer.com/article/10. VLDBFR. ISSN 1066-8888 (print), 1007/s00778-024-00845-0. 0949-877X (electronic). URL https: Karegar:2024:DAI //link.springer.com/article/10. 1007/s00778-024-00836-1. [1146] Reza Karegar, Melicaalsadat Mirsafian, Parke Godfrey, Lukasz GoSong:2024:SST lab, Mehdi Kargar, Divesh Srivastava, and Jaroslaw Szlichta. Discovering [1143] Yuanfeng Song, Raymond Chi-Wing approximate implicit domain orders Wong, and Xuefang Zhao. Speechthrough order dependencies. VLDB to-SQL: toward speech-driven SQL Journal: Very Large Data Bases, 33(5): query generation from natural lan1257–1282, September 2024. CODEN guage question. VLDB JourVLDBFR. ISSN 1066-8888 (print), nal: Very Large Data Bases, 33 0949-877X (electronic). URL https: (4):1179–1201, July 2024. CODEN //link.springer.com/article/10. VLDBFR. ISSN 1066-8888 (print), 1007/s00778-024-00847-y. 0949-877X (electronic). URL https: //link.springer.com/article/10. Chang:2024:DDT 1007/s00778-024-00837-0. Shahbazi:2024:REI [1147] Jiwon Chang, Bohan Cui, Fatemeh Nargesian, Abolfazl Asudeh, and H. V. [1144] Nima Shahbazi and Abolfazl Asudeh. Jagadish. Data distribution tailorReliability evaluation of individual ing revisited: cost-efficient integration predictions: a data-centric approach. of representative data. VLDB JourVLDB Journal: Very Large Data nal: Very Large Data Bases, 33(5): Bases, 33(4):1203–1230, July 2024. 1283–1306, September 2024. CODEN REFERENCES 187 VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-024-00849-w. Chen:2024:LAL Chen, Pan Hui, and Fei Hao. Similarity-driven and task-driven models for diversity of opinion in crowdsourcing markets. VLDB Journal: Very Large Data Bases, 33(5):1377– 1398, September 2024. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-024-00853-0. [1148] Xingguang Chen, Rong Zhu, Bolin Ding, Sibo Wang, and Jingren Zhou. Lero: applying learning-to-rank in query optimizer. VLDB Journal: Very Large Data Bases, 33(5):1307– Wang:2024:EAR 1331, September 2024. CODEN VLDBFR. ISSN 1066-8888 (print), [1152] Kai Wang, Minghao Cai, Xiaoshuang 0949-877X (electronic). URL https: Chen, Xuemin Lin, Wenjie Zhang, //link.springer.com/article/10. Lu Qin, and Ying Zhang. Efficient algo1007/s00778-024-00850-3. rithms for reachability and path queries on temporal bipartite graphs. VLDB Preti:2024:HDO Journal: Very Large Data Bases, 33(5): 1399–1426, September 2024. CODEN [1149] Giulia Preti, Gianmarco De Francisci VLDBFR. ISSN 1066-8888 (print), Morales, and Francesco Bonchi. Hyper0949-877X (electronic). URL https: distance oracles in hypergraphs. VLDB //link.springer.com/article/10. Journal: Very Large Data Bases, 33(5): 1007/s00778-024-00854-z. 1333–1356, September 2024. CODEN VLDBFR. ISSN 1066-8888 (print), Xu:2024:EEA 0949-877X (electronic). URL https: //link.springer.com/article/10. [1153] Yichen Xu, Chenhao Ma, Yixiang 1007/s00778-024-00851-2. Fang, and Zhifeng Bao. Efficient and effective algorithms for densest subgraph Shi:2024:ECE discovery and maintenance. VLDB Journal: Very Large Data Bases, 33(5): [1150] Gongyu Shi, Geng Wang, Shi-Feng 1427–1452, September 2024. CODEN Sun, and Dawu Gu. Efficient cryptVLDBFR. ISSN 1066-8888 (print), analysis of an encrypted database sup0949-877X (electronic). URL https: porting data interoperability. VLDB //link.springer.com/article/10. Journal: Very Large Data Bases, 33(5): 1007/s00778-024-00855-y. 1357–1375, September 2024. CODEN VLDBFR. ISSN 1066-8888 (print), Wang:2024:PBC 0949-877X (electronic). URL https: //link.springer.com/article/10. [1154] Zhibin Wang, Longbin Lai, Yixue 1007/s00778-024-00852-1. Liu, Bing Shui, Chen Tian, and Sheng Zhong. Parallelization of butZhang:2024:SDT terfly counting on hierarchical mem[1151] Chen Jason Zhang, Yunrui Liu, ory. VLDB Journal: Very Large Data Pengcheng Zeng, Ting Wu, Lei Bases, 33(5):1453–1484, September REFERENCES 188 2024. CODEN VLDBFR. ISSN 1066Kitsios:2024:FGL 8888 (print), 0949-877X (electronic). URL https://link.springer.com/ [1158] Xenophon Kitsios, Panagiotis Liakos, Katia Papakonstantinopoulou, article/10.1007/s00778-024-00856and Yannis Kotidis. Flexible x. grouping of linear segments for Song:2024:SHT highly accurate lossy compression of time series data. VLDB Journal: [1155] Haoze Song, Wenchao Zhou, Heming Very Large Data Bases, 33(5):1569– Cui, Xiang Peng, and Feifei Li. A 1589, September 2024. CODEN survey on hybrid transactional and VLDBFR. ISSN 1066-8888 (print), analytical processing. VLDB Jour0949-877X (electronic). URL https: nal: Very Large Data Bases, 33(5): //link.springer.com/article/10. 1485–1515, September 2024. CODEN 1007/s00778-024-00862-z. VLDBFR. ISSN 1066-8888 (print), Pan:2024:SVD 0949-877X (electronic). URL https: //link.springer.com/article/10. [1159] James Jie Pan, Jianguo Wang, and 1007/s00778-024-00858-9. Guoliang Li. Survey of vector database management systems. VLDB JourPeng:2024:MMC nal: Very Large Data Bases, 33(5): [1156] Peng Peng, Shengyi Ji, M. Tamer 1591–1615, September 2024. CODEN Özsu, and Lei Zou. Minimum motifVLDBFR. ISSN 1066-8888 (print), cut: a workload-aware RDF graph 0949-877X (electronic). URL https: partitioning strategy. VLDB Jour//link.springer.com/article/10. nal: Very Large Data Bases, 33(5): 1007/s00778-024-00864-x. 1517–1542, September 2024. CODEN Liang:2024:FSF VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1160] Zhiyu Liang and Hongzhi Wang. //link.springer.com/article/10. FedST: secure federated shapelet trans1007/s00778-024-00860-1. formation for time series classification. VLDB Journal: Very Large Data Xia:2024:GBB Bases, 33(5):1617–1641, September 2024. CODEN VLDBFR. ISSN 1066[1157] Yifei Xia, Feng Zhang, Qingyu Xu, 8888 (print), 0949-877X (electronic). Mingde Zhang, Zhiming Yao, Lv Lu, URL https://link.springer.com/ Xiaoyong Du, Dong Deng, Bingarticle/10.1007/s00778-024-00865sheng He, and Siqi Ma. GPUw. based butterfly counting. VLDB Journal: Very Large Data Bases, 33(5): Yang:2024:FRC 1543–1567, September 2024. CODEN VLDBFR. ISSN 1066-8888 (print), [1161] Yifei Yang, Xiangyao Yu, Marco Serafini, Ashraf Aboulnaga, and Michael 0949-877X (electronic). URL https: Stonebraker. FlexpushdownDB: re//link.springer.com/article/10. thinking computation pushdown for 1007/s00778-024-00861-0. REFERENCES 189 VLDBFR. ISSN 1066-8888 (print), cloud OLAP DBMSs. VLDB Jour0949-877X (electronic). URL https: nal: Very Large Data Bases, 33(5): //link.springer.com/article/10. 1643–1670, September 2024. CODEN 1007/s00778-024-00870-z. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: Wu:2024:AZS //link.springer.com/article/10. [1165] Xinle Wu, Xingjian Wu, Bin Yang, 1007/s00778-024-00867-8. Lekui Zhou, Chenjuan Guo, Xiangfei Neuhof:2024:OBF Qiu, Jilin Hu, Zhenli Sheng, and Christian S. Jensen. AutoCTS++: [1162] Franziska Neuhof, Marco Fisichella, zero-shot joint neural architecture and George Papadakis, Konstantinos Nikohyperparameter search for correlated letos, Nikolaus Augsten, Wolfgang Netime series forecasting. VLDB Jourjdl, and Manolis Koubarakis. Open nal: Very Large Data Bases, 33(5): benchmark for filtering techniques 1743–1770, September 2024. CODEN in entity resolution. VLDB JourVLDBFR. ISSN 1066-8888 (print), nal: Very Large Data Bases, 33(5): 0949-877X (electronic). URL https: 1671–1696, September 2024. CODEN //link.springer.com/article/10. VLDBFR. ISSN 1066-8888 (print), 1007/s00778-024-00872-x. 0949-877X (electronic). URL https: //link.springer.com/article/10. Lin:2024:CRR 1007/s00778-024-00868-7. [1166] Hong Lin, Ke Chen, Dawei Jiang, LiLiu:2024:WUG dan Shou, and Gang Chen. Correction to: “Refiner: a reliable and efficient [1163] Zirui Liu, Fenghao Dong, Chengwu incentive-driven federated learning sysLiu, Xiangwei Deng, Tong Yang, Yikai tem powered by blockchain”. VLDB Zhao, Jizhou Li, Bin Cui, and Gong Journal: Very Large Data Bases, 33 Zhang. WavingSketch: an unbiased (5):1771, September 2024. CODEN and generic sketch for finding top-k VLDBFR. ISSN 1066-8888 (print), items in data streams. VLDB Jour0949-877X (electronic). URL https: nal: Very Large Data Bases, 33(5): //link.springer.com/article/10. 1697–1722, September 2024. CODEN 1007/s00778-024-00866-9. See VLDBFR. ISSN 1066-8888 (print), [1127]. 0949-877X (electronic). URL https: //link.springer.com/article/10. May:2024:SIM 1007/s00778-024-00869-6. Zhang:2024:FES [1167] Norman May, Spyros Blanas, and Danica Porobic. Special issue: mod[1164] Xingyi Zhang, Jinchao Huang, Fangyuan ern hardware. VLDB Journal: Zhang, and Sibo Wang. FICOM: Very Large Data Bases, 33(6):1773– an effective and scalable active learn1774, November 2024. CODEN ing framework for GNNs on semiVLDBFR. ISSN 1066-8888 (print), supervised node classification. VLDB 0949-877X (electronic). URL https: Journal: Very Large Data Bases, 33(5): //link.springer.com/article/10. 1723–1742, September 2024. CODEN 1007/s00778-024-00841-4. REFERENCES 190 Nicholson:2024:HME queries with REncoder. VLDB Journal: Very Large Data Bases, 33(6): 1837–1859, November 2024. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-024-00873-w. [1168] Hamish Nicholson, Periklis Chrysogelos, and Anastasia Ailamaki. HPCache: memory-efficient OLAP through proportional caching revisited. VLDB Journal: Very Large Data Bases, 33(6): 1775–1791, November 2024. CODEN He:2024:DCV VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1172] Yizhang He, Kai Wang, Wen//link.springer.com/article/10. jie Zhang, Xuemin Lin, and Ying 1007/s00778-023-00828-7. Zhang. Discovering critical vertices Li:2024:PAL for reinforcement of large-scale bipartite networks. VLDB Journal: [1169] Tianyu Li, Badrish Chandramouli, and Very Large Data Bases, 33(6):1861– Samuel Madden. Performant almost1886, November 2024. CODEN latch-free data structures using epoch VLDBFR. ISSN 1066-8888 (print), protection in more depth. VLDB Jour0949-877X (electronic). URL https: nal: Very Large Data Bases, 33(6): //link.springer.com/article/10. 1793–1812, November 2024. CODEN 1007/s00778-024-00871-y. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: Wang:2024:DDA //link.springer.com/article/10. [1173] Zeyu Wang, Qitong Wang, Peng 1007/s00778-024-00859-8. Wang, Themis Palpanas, and Wei Wang:2024:OLB Wang. DumpyOS: a data-adaptive multi-ary index for scalable data se[1170] Ruihong Wang, Chuqing Gao, Jianguo ries similarity search. VLDB JourWang, Prishita Kadam, M. TamerÖzsu, nal: Very Large Data Bases, 33(6): and Walid G. Aref. Optimiz1887–1911, November 2024. CODEN ing LSM-based indexes for disagVLDBFR. ISSN 1066-8888 (print), gregated memory. VLDB Journal: 0949-877X (electronic). URL https: Very Large Data Bases, 33(6):1813– //link.springer.com/article/10. 1836, November 2024. CODEN 1007/s00778-024-00874-9. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: Li:2024:VFA //link.springer.com/article/10. 1007/s00778-024-00863-y. [1174] Yiran Li, Gongyao Guo, Jieming Shi, Renchi Yang, Shiqi Shen, Qing Li, and Fan:2024:EST Jun Luo. A versatile framework for [1171] Zhuochen Fan, Bowen Ye, Ziwei attributed network clustering via KWang, Zheng Zhong, Jiarui Guo, nearest neighbor augmentation. VLDB Yuhan Wu, Haoyu Li, Tong Yang, Journal: Very Large Data Bases, 33(6): Yaofeng Tu, Zirui Liu, and Bin Cui. 1913–1943, November 2024. CODEN Enabling space-time efficient range VLDBFR. ISSN 1066-8888 (print), REFERENCES 191 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-024-00875-8. Pan:2025:AMB trieval. VLDB Journal: Very Large Data Bases, 34(1):??, January 2025. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-024-008847. [1175] Dong Pan, Xu Zhou, Wensheng Luo, Zhibang Yang, Qing Liu, Yunjun Gao, and Kenli Li. AccelerZeakis:2025:DAP ating maximum biplex search over large bipartite graphs. VLDB Jour- [1179] Alexandros Zeakis, George Papadakis, Dimitrios Skoutas, and Manolis nal: Very Large Data Bases, 34 Koubarakis. An in-depth analy(1):??, January 2025. CODEN sis of pre-trained embeddings for VLDBFR. ISSN 1066-8888 (print), entity resolution. VLDB Jour0949-877X (electronic). URL https: nal: Very Large Data Bases, 34 //link.springer.com/article/10. (1):??, January 2025. CODEN 1007/s00778-024-00882-9. VLDBFR. ISSN 1066-8888 (print), Arroyuelo:2025:ERP 0949-877X (electronic). URL https: //link.springer.com/article/10. [1176] Diego Arroyuelo, Adrián Gómez1007/s00778-024-00879-4. Brandón, and Gonzalo Navarro. Evaluating regular path queries on comHu:2025:GPM pressed adjacency matrices. VLDB Journal: Very Large Data Bases, [1180] Lin Hu, Yinnian Lin, Lei Zou, and M. Tamer Özsu. A graph pat34(1):??, January 2025. CODEN tern mining framework for large VLDBFR. ISSN 1066-8888 (print), graphs on GPU. VLDB Jour0949-877X (electronic). URL https: nal: Very Large Data Bases, 34 //link.springer.com/article/10. (1):??, January 2025. CODEN 1007/s00778-024-00885-6. VLDBFR. ISSN 1066-8888 (print), Hu:2025:PRF 0949-877X (electronic). URL https: //link.springer.com/article/10. [1177] Zheng Hu, Cong Xu, and Weiguo 1007/s00778-024-00883-8. Zheng. A powerful reducing framework for accelerating set intersecShin:2025:UIL tions over graphs. VLDB Journal: Very Large Data Bases, 34 [1181] Jaewoo Shin, Libin Zhou, Jianguo Wang, and Walid G. Aref. An (1):??, January 2025. CODEN update-intensive LSM-based R-tree inVLDBFR. ISSN 1066-8888 (print), dex. VLDB Journal: Very Large 0949-877X (electronic). URL https: Data Bases, 34(1):??, January 2025. //link.springer.com/article/10. CODEN VLDBFR. ISSN 10661007/s00778-024-00881-w. 8888 (print), 0949-877X (electronic). Liu:2025:EOR URL https://link.springer.com/ [1178] Hao Liu and Raymond Chi-Wing article/10.1007/s00778-024-008767. Wong. On efficient 3D object re- REFERENCES 192 Georgiadis:2025:RIO Data Bases, 34(1):??, January 2025. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). URL https://link.springer.com/ article/10.1007/s00778-024-008892. [1182] Thanasis Georgiadis, Eleni Tzirita Zacharatou, and Nikos Mamoulis. Raster interval object approximations for spatial intersection joins. VLDB Journal: Very Large Data Bases, Guo:2025:DQO 34(1):??, January 2025. CODEN VLDBFR. ISSN 1066-8888 (print), [1186] Yunyan Guo, Guoliang Li, Ruilin 0949-877X (electronic). URL https: Hu, and Yong Wang. In-database //link.springer.com/article/10. query optimization on SQL with ML 1007/s00778-024-00887-4. predicates. VLDB Journal: Very Large Data Bases, 34(1):??, January Mondal:2025:SME 2025. CODEN VLDBFR. ISSN 1066[1183] Manuel Mondal, Mourad Khay8888 (print), 0949-877X (electronic). ati, Hông-Ân Sandlin, and Philippe URL https://link.springer.com/ Cudré-Mauroux. A survey of article/10.1007/s00778-024-00888multimodal event detection based 3. on data fusion. VLDB JourMann:2025:STS nal: Very Large Data Bases, 34 (1):??, January 2025. CODEN [1187] Willi Mann, Nikolaus Augsten, ChrisVLDBFR. ISSN 1066-8888 (print), tian S. Jensen, and Mateusz Paw0949-877X (electronic). URL https: lik. SWOOP: top-k similarity joins //link.springer.com/article/10. over set streams. VLDB Jour1007/s00778-024-00878-5. nal: Very Large Data Bases, 34 (1):??, January 2025. CODEN Messaoud:2025:TBK VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1184] Aghiles Ait Messaoud, Sonia Ben //link.springer.com/article/10. Mokhtar, and Anthony Simonet1007/s00778-024-00880-x. Boulogne. Tee-based key-value stores: a survey. VLDB JourSong:2025:ETS nal: Very Large Data Bases, 34 (1):??, January 2025. CODEN [1188] Yitong Song, Bin Yao, Zhida Chen, VLDBFR. ISSN 1066-8888 (print), Xin Yang, Jiong Xie, Feifei Li, and 0949-877X (electronic). URL https: Mengshi Chen. Efficient top-k spatial//link.springer.com/article/10. range-constrained approximate near1007/s00778-024-00877-6. est neighbor search on geo-tagged high-dimensional vectors. VLDB Ahmed:2025:RTA Journal: Very Large Data Bases, [1185] Waqas Ahmed, Leticia Gómez, Alejan34(1):??, January 2025. CODEN dro Vaisman, and Esteban Zimányi. VLDBFR. ISSN 1066-8888 (print), Reconciling tuple and attribute times0949-877X (electronic). URL https: tamping for temporal data ware//link.springer.com/article/10. houses. VLDB Journal: Very Large 1007/s00778-024-00894-5. REFERENCES 193 Kim:2025:ESC VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-024-00891-8. [1189] Hyunju Kim, Heechan Moon, Fanchen Bu, Jihoon Ko, and Kijung Shin. Estimating simplet counts via sampling. VLDB Journal: Very Large Data Tong:2025:HFE Bases, 34(2):??, March 2025. CODEN VLDBFR. ISSN 1066-8888 (print), [1193] Yongxin Tong, Yuxiang Zeng, Yang 0949-877X (electronic). URL https: Song, Xuchen Pan, Zeheng Fan, //link.springer.com/article/10. Chunbo Xue, Zimu Zhou, Xiaofei 1007/s00778-024-00890-9. Zhang, Lei Chen, Yi Xu, Ke Xu, and Weifeng Lv. Hu-Fu: efficient and seMulder:2025:ONG cure spatial queries over data federa[1190] Thomas Mulder, George Fletcher, tion. VLDB Journal: Very Large Data and Nikolay Yakovets. Optimizing Bases, 34(2):??, March 2025. CODEN navigational graph queries. VLDB VLDBFR. ISSN 1066-8888 (print), Journal: Very Large Data Bases, 0949-877X (electronic). URL https: 34(2):??, March 2025. CODEN //link.springer.com/article/10. VLDBFR. ISSN 1066-8888 (print), 1007/s00778-024-00896-3. 0949-877X (electronic). URL https: //link.springer.com/article/10. Tao:2025:DPE 1007/s00778-024-00892-7. Liu:2025:HGM [1194] Yuchao Tao, Amir Gilad, Ashwin Machanavajjhala, and Sudeepa Roy. [1191] Qiyu Liu, Maocheng Li, Yuxiang Zeng, Differentially private explanations for Yanyan Shen, and Lei Chen. How aggregate query answers. VLDB good are multi-dimensional learned Journal: Very Large Data Bases, indexes? An experimental survey. 34(2):??, March 2025. CODEN VLDB Journal: Very Large Data VLDBFR. ISSN 1066-8888 (print), Bases, 34(2):??, March 2025. CODEN 0949-877X (electronic). URL https: VLDBFR. ISSN 1066-8888 (print), //link.springer.com/article/10. 0949-877X (electronic). URL https: 1007/s00778-024-00895-4. //link.springer.com/article/10. Trummer:2025:GHC 1007/s00778-024-00893-6. Jiang:2025:EHL [1192] Changkun Jiang, Heze Lao, Chaorui Zhang, Ji Cheng, Chen Jason Zhang, and Jianqiang Li. HeteroStamp: leveraging heterogeneous social interactions for mobility prediction-enhanced cost-aware spatiotemporal crowdsensing. VLDB Journal: Very Large Data Bases, 34(2):??, March 2025. CODEN [1195] Immanuel Trummer. Generating highly customizable Python code for data processing with large language models. VLDB Journal: Very Large Data Bases, 34(2):??, March 2025. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-025-00900-4. REFERENCES 194 Peng:2025:AAS Xiangfeng Zhu. Netherite: efficient execution of serverless workflows. VLDB Journal: Very Large Data Bases, 34(2):??, March 2025. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-024-00898-1. [1196] Jingshu Peng, Qiyu Liu, Zhao Chen, Yingxia Shao, Yanyan Shen, Lei Chen, and Jiannong Cao. From Sancus to Sancusq : staleness and quantizationaware full-graph decentralized training in graph neural networks. VLDB Journal: Very Large Data Bases, Yu:2025:QHC 34(2):??, March 2025. CODEN VLDBFR. ISSN 1066-8888 (print), [1200] Yuanhang Yu, Dong Wen, Michael Yu, 0949-877X (electronic). URL https: Lu Qin, Ying Zhang, Wenjie Zhang, //link.springer.com/article/10. and Xuemin Lin. Querying histori1007/s00778-024-00897-2. cal K-cores in large temporal graphs. VLDB Journal: Very Large Data Skavantzos:2025:TBC Bases, 34(2):??, March 2025. CODEN [1197] Philipp Skavantzos and Sebastian VLDBFR. ISSN 1066-8888 (print), Link. Third and Boyce–Codd nor0949-877X (electronic). URL https: mal form for property graphs. VLDB //link.springer.com/article/10. Journal: Very Large Data Bases, 1007/s00778-025-00903-1. 34(2):??, March 2025. CODEN Miao:2025:ESH VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1201] Xupeng Miao, Hailin Zhang, Yining //link.springer.com/article/10. Shi, Xiaonan Nie, Zhi Yang, Yangyu 1007/s00778-025-00902-2. Tao, Jie Jiang, and Bin Cui. Efficient Helt:2025:CCC and scalable huge embedding model training via distributed cache management. VLDB Journal: Very Large Data Bases, 34(3):??, May 2025. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-025-00908-w. [1198] Jeffrey Helt, Abhinav Sharma, Daniel J. Abadi, Wyatt Lloyd, and Jose M. Faleiro. C5: cloned concurrency control that always keeps up. VLDB Journal: Very Large Data Bases, 34(2):??, March 2025. CODEN VLDBFR. ISSN 1066-8888 (print), Peng:2025:CAP 0949-877X (electronic). URL https: //link.springer.com/article/10. [1202] Huanhuan Peng, Xiaoye Miao, Jin1007/s00778-025-00901-3. shan Zhang, Yunjun Gao, Shuiguang Deng, and Jianwei Yin. CostBurckhardt:2025:NEE aware prediction service pricing with [1199] Sebastian Burckhardt, Badrish Chanincomplete information. VLDB dramouli, Chris Gillum, David Justo, Journal: Very Large Data Bases, Konstantinos Kallas, Connor McMa34(3):??, May 2025. CODEN hon, Christopher S. Meiklejohn, and VLDBFR. ISSN 1066-8888 (print), REFERENCES 195 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-025-00909-9. Zhang:2025:MCO Tsay, Aaron Elmore, Michael J. Franklin, and John Paparrizos. VUS: effective and efficient accuracy measures for time-series anomaly detection. VLDB Journal: Very Large Data Bases, 34(3):??, May 2025. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-025-00907-x. [1203] Zhuoxing Zhang and Sebastian Link. Mixed covers: optimizing updates and queries using minimal keys and functional dependencies. VLDB Journal: Very Large Data Bases, 34(3):??, May 2025. CODEN Yin:2025:LLI VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1207] Ziqi Yin, Shanshan Feng, Shang Liu, //link.springer.com/article/10. Gao Cong, Yew Soon Ong, and 1007/s00778-025-00910-2. Bin Cui. LIST: learning to index spatio-textual data for embedLiu:2025:DFA ding based spatial keyword queries. VLDB Journal: Very Large Data [1204] Chunwei Liu, Anna Pavlenko, Matteo Bases, 34(3):??, May 2025. CODEN Interlandi, and Brandon Haynes. Data VLDBFR. ISSN 1066-8888 (print), formats in analytical DBMSs: per0949-877X (electronic). URL https: formance trade-offs and future direc//link.springer.com/article/10. tions. VLDB Journal: Very Large Data 1007/s00778-024-00886-5. Bases, 34(3):??, May 2025. CODEN VLDBFR. ISSN 1066-8888 (print), Luo:2025:EIS 0949-877X (electronic). URL https: //link.springer.com/article/10. [1208] Qi Luo, Wenjie Zhang, and Liping 1007/s00778-025-00911-1. Wang. Efficient indexing and searching of constrained core in hypergraphs. Li:2025:JOR VLDB Journal: Very Large Data [1205] Rui Li, Zongyan He, and Jeffrey Xu Bases, 34(3):??, May 2025. CODEN Yu. Join optimization revisited: a novel VLDBFR. ISSN 1066-8888 (print), DP algorithm for join&sort order selec0949-877X (electronic). URL https: tion. VLDB Journal: Very Large Data //link.springer.com/article/10. Bases, 34(3):??, May 2025. CODEN 1007/s00778-025-00915-x. VLDBFR. ISSN 1066-8888 (print), Li:2025:GEG 0949-877X (electronic). URL https: //link.springer.com/article/10. [1209] Pengfei Li, Yong Zhang, and Hua 1007/s00778-025-00906-y. Lu. GRELA: Exploiting graph repBoniol:2025:VEE [1206] Paul Boniol, Ashwin K. Krishna, Marine Bruel, Qinghua Liu, Mingyi Huang, Themis Palpanas, Ruey S. resentation learning in effective approximate query processing. VLDB Journal: Very Large Data Bases, 34(3):??, May 2025. CODEN VLDBFR. ISSN 1066-8888 (print), REFERENCES 196 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-025-00914-y. Ji:2025:TID rich query languages. VLDB Journal: Very Large Data Bases, 34(4):??, July 2025. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-025-00922-y. [1210] Daomin Ji, Hui Luo, and J. Shane Culpepper. Table integration in data lakes unleashed: pairwise integrabilTang:2025:TPC ity judgment, integrable set discovery, and multi-tuple conflict resolu- [1214] Dixin Tang, Alan Fekete, and tion. VLDB Journal: Very Large Data Aditya G. Parameswaran. TransacBases, 34(3):??, May 2025. CODEN tional panorama: a conceptual frameVLDBFR. ISSN 1066-8888 (print), work for user perception in analyt0949-877X (electronic). URL https: ical visual interfaces (extended ver//link.springer.com/article/10. sion). VLDB Journal: Very Large Data 1007/s00778-025-00917-9. Bases, 34(4):??, July 2025. CODEN VLDBFR. ISSN 1066-8888 (print), Li:2025:DTY 0949-877X (electronic). URL https: [1211] Qian Li, Peter Kraft, and Michael //link.springer.com/article/10. Stonebraker. DBOS: three years later. 1007/s00778-025-00923-x. VLDB Journal: Very Large Data Nikookar:2025:MRR Bases, 34(3):??, May 2025. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1215] Sepideh Nikookar, Sohrab Namazi Nia, and Behrooz Omidvar-Tehrani. Model //link.springer.com/article/10. reusability in reinforcement learning. 1007/s00778-024-00899-0. VLDB Journal: Very Large Data Li:2025:PPL Bases, 34(4):??, July 2025. CODEN VLDBFR. ISSN 1066-8888 (print), [1212] Shuaimin Li, Xuanang Chen, and 0949-877X (electronic). URL https: Lei Chen. prompt4vis: prompting //link.springer.com/article/10. large language models with exam1007/s00778-025-00920-0. ple mining for tabular data visualization. VLDB Journal: Very Large Data Haubenschild:2025:OCA Bases, 34(4):??, July 2025. CODEN VLDBFR. ISSN 1066-8888 (print), [1216] Michael Haubenschild and Viktor 0949-877X (electronic). URL https: Leis. OLTP in the cloud: archi//link.springer.com/article/10. tectures, tradeoffs, and cost. VLDB 1007/s00778-025-00912-0. Journal: Very Large Data Bases, 34(4):??, July 2025. CODEN Budiu:2025:DAI VLDBFR. ISSN 1066-8888 (print), [1213] Mihai Budiu, Leonid Ryzhyk, and 0949-877X (electronic). URL https: Val Tannen. DBSP: automatic //link.springer.com/article/10. incremental view maintenance for 1007/s00778-025-00913-z. REFERENCES 197 Zhang:2025:HHK URL https://link.springer.com/ article/10.1007/s00778-025-009259. [1217] Jun Zhang, Jue Wang, and Xuejian Gong. HMI: hierarchical knowledge Li:2025:ATS management for efficient multi-tenant inference in pretrained language mod- [1221] Peng Li, Yeye He, and Surajit Chaudhuri. Auto-tables: synthesizing multiels. VLDB Journal: Very Large Data step transformations to relationalBases, 34(4):??, July 2025. CODEN ize tables without using examples. VLDBFR. ISSN 1066-8888 (print), VLDB Journal: Very Large Data 0949-877X (electronic). URL https: Bases, 34(4):??, July 2025. CODEN //link.springer.com/article/10. VLDBFR. ISSN 1066-8888 (print), 1007/s00778-025-00919-7. 0949-877X (electronic). URL https: Zhang:2025:ECF //link.springer.com/article/10. 1007/s00778-025-00921-z. [1218] Zhihao Zhang, Jianpeng Qi, and Yan- Meilicke:2025:CAB wei Yu. Efficiently counting four-node motifs in large-scale temporal graphs. VLDB Journal: Very Large Data [1222] Christian Meilicke, Melisachew Wudage Chekol, and Heiner Stuckenschmidt. Bases, 34(4):??, July 2025. CODEN Correction: Anytime bottom-up VLDBFR. ISSN 1066-8888 (print), rule learning for large-scale knowl0949-877X (electronic). URL https: edge graph completion. VLDB //link.springer.com/article/10. Journal: Very Large Data Bases, 1007/s00778-025-00926-8. 34(4):??, July 2025. CODEN Zhou:2025:TIO VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1219] Xinjing Zhou, Xiangpeng Hao, and //link.springer.com/article/10. Michael Stonebraker. Tiered-indexing: 1007/s00778-025-00918-8. See Optimizing access methods for skew. [1099]. VLDB Journal: Very Large Data Bonifati:2025:TQT Bases, 34(4):??, July 2025. CODEN VLDBFR. ISSN 1066-8888 (print), [1223] Angela Bonifati, Stefania Dumbrava, 0949-877X (electronic). URL https: and Dominik Tomaszuk. Threshold //link.springer.com/article/10. queries in theory and in the wild. 1007/s00778-025-00928-6. VLDB Journal: Very Large Data Gao:2025:EAU Bases, 34(4):??, July 2025. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-025-00916-w. [1220] Xiangyu Gao, Xingxing Xiao, and Jianzhong Li. Efficient algorithms for uncertain restricted skyline query processing. VLDB Journal: Very Bonte:2025:LSR Large Data Bases, 34(4):??, July 2025. CODEN VLDBFR. ISSN 1066- [1224] Pieter Bonte, Christophe Callé, and Riccardo Tommasini. Languages and 8888 (print), 0949-877X (electronic). REFERENCES 198 systems for RDF stream processing, Cambria:2025:MGR a survey. VLDB Journal: Very Large Data Bases, 34(4):??, July [1228] Francesco Cambria, Francesco Invernici, and Stefano Ceri. Mine 2025. CODEN VLDBFR. ISSN 1066Graph Rule: a new GQL opera8888 (print), 0949-877X (electronic). tor for mining association rules in URL https://link.springer.com/ property graph databases. VLDB article/10.1007/s00778-025-00927Journal: Very Large Data Bases, 7. 34(4):??, July 2025. CODEN Zhao:2025:ETR VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1225] Hongyao Zhao, Wei Lu, and Xiaoy//link.springer.com/article/10. ong Du. An efficient two-round dis1007/s00778-025-00934-8. tributed transaction processing apGraur:2025:SQN proach over heterogeneous networks. VLDB Journal: Very Large Data [1229] Dan Graur, Ingo Müller, and Gustavo Bases, 34(4):??, July 2025. CODEN Alonso. The status-quo in nested data VLDBFR. ISSN 1066-8888 (print), processing for high-energy physics. 0949-877X (electronic). URL https: VLDB Journal: Very Large Data //link.springer.com/article/10. Bases, 34(4):??, July 2025. CODEN 1007/s00778-025-00929-5. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: Freire:2025:ESI //link.springer.com/article/10. 1007/s00778-025-00924-w. [1226] Juliana Freire, Fatma Özcan, and Xuemin Lin. Editorial for speParciak:2025:MAF cial issue: VLDB 2022. VLDB Journal: Very Large Data Bases, [1230] Marcel Parciak, Sebastiaan Weytjens, and Stijn Vansummeren. Mea34(4):??, July 2025. CODEN suring approximate functional deVLDBFR. ISSN 1066-8888 (print), pendencies: a comparative study. 0949-877X (electronic). URL https: VLDB Journal: Very Large Data //link.springer.com/article/10. Bases, 34(4):??, July 2025. CODEN 1007/s00778-025-00930-y. VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: Hou:2025:ESG //link.springer.com/article/10. 1007/s00778-025-00931-x. [1227] Jiamin Hou, Zhanhao Zhao, and Xiaoyong Du. An efficient and scalable graph Saha:2025:BIV database with built-in temporal support. VLDB Journal: Very Large Data [1231] Arkaprava Saha, Xiangyu Ke, and Laks V. S. Lakshmanan. Beyond Bases, 34(4):??, July 2025. CODEN influence: voting theory for opinVLDBFR. ISSN 1066-8888 (print), ion maximization. VLDB Jour0949-877X (electronic). URL https: nal: Very Large Data Bases, 34 //link.springer.com/article/10. (5):??, September 2025. CODEN 1007/s00778-025-00932-w. REFERENCES 199 VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-025-00933-9. Ayad:2025:TIL with collective spatial keywords: a skyline-based approach. VLDB Journal: Very Large Data Bases, 34 (5):??, September 2025. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-025-00940-w. [1232] Lorraine A. K. Ayad, Grigorios Loukides, and Solon P. Pissis. Text indexing for long patterns using loZhang:2025:SAQ cally consistent anchors. VLDB Journal: Very Large Data Bases, 34 [1236] Yunjia Zhang, Yannis Chronis, and (5):??, September 2025. CODEN Theodoros Rekatsinas. Simple adapVLDBFR. ISSN 1066-8888 (print), tive query processing vs. learned query 0949-877X (electronic). URL https: optimizers: Observations and anal//link.springer.com/article/10. ysis. VLDB Journal: Very Large 1007/s00778-025-00935-7. Data Bases, 34(5):??, September 2025. CODEN VLDBFR. ISSN 1066Tian:2025:DTD 8888 (print), 0949-877X (electronic). [1233] Anxin Tian, Alexander Zhou, and URL https://link.springer.com/ Chen Zhang. Distributed truss dearticle/10.1007/s00778-025-00936composition over large directed graphs. 6. VLDB Journal: Very Large Data Zhang:2025:DDL Bases, 34(5):??, September 2025. CODEN VLDBFR. ISSN 1066[1237] Qi Zhang, Rong-Hua Li, and Guoren 8888 (print), 0949-877X (electronic). Wang. Density decomposition on URL https://link.springer.com/ large static and dynamic graphs: alarticle/10.1007/s00778-025-00938gorithms and applications. VLDB 4. Journal: Very Large Data Bases, 34 Sun:2025:EMS (6):??, November 2025. CODEN VLDBFR. ISSN 1066-8888 (print), [1234] Renjie Sun, Chen Chen, and Xuemin 0949-877X (electronic). URL https: Lin. Efficient maximum signed bi//link.springer.com/article/10. clique and biplex identification in 1007/s00778-025-00942-8. signed bipartite graphs. VLDB Journal: Very Large Data Bases, 34 Peng:2025:GSS (5):??, September 2025. CODEN VLDBFR. ISSN 1066-8888 (print), [1238] Jinfeng Peng, Hanghai Cui, and Ge Yu. 0949-877X (electronic). URL https: GARF+ : self-supervised and inter//link.springer.com/article/10. pretable data cleaning with sequence 1007/s00778-025-00939-3. generative adversarial networks. VLDB Journal: Very Large Data Bases, 34 Li:2025:ROC (6):??, November 2025. CODEN [1235] Jiajia Li, Qiulin An, and XiaoVLDBFR. ISSN 1066-8888 (print), fang Zhou. Route optimization 0949-877X (electronic). URL https: REFERENCES 200 //link.springer.com/article/10. 1007/s00778-025-00941-9. Oulefki:2025:BMB (6):??, November 2025. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-025-00947-3. [1239] Samira Oulefki, Lamia Berkani, and Aicha Mokhtari. BioGITOM: MatchDan:2025:DEH ing biomedical ontologies with graph isomorphism transformer. VLDB Journal: Very Large Data Bases, 34 [1243] Tangpeng Dan, Xiao Pan, and Xiaofeng Meng. DHL: an efficient (6):??, November 2025. CODEN hierarchical index for shortest disVLDBFR. ISSN 1066-8888 (print), tance querying in time-dependent 0949-877X (electronic). URL https: road networks. VLDB Journal: //link.springer.com/article/10. Very Large Data Bases, 34(6): 1007/s00778-025-00943-7. ??, November 2025. CODEN Kang:2025:PTS VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1240] Hongbo Kang, Yiwei Zhao, and //link.springer.com/article/10. Phillip B. Gibbons. PIM-tree: a 1007/s00778-025-00946-4. skew-resistant index for processingin-memory. VLDB Journal: Very Yang:2025:PUB Large Data Bases, 34(6):??, November 2025. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). [1244] Yi Yang, Yurong Cheng, and Yongjiao Sun. Privacy-utility balanced coURL https://link.springer.com/ operative online matching in spaarticle/10.1007/s00778-025-00937tial crowdsourcing. VLDB Jour5. nal: Very Large Data Bases, 34 Arroyuelo:2025:CST (6):??, November 2025. CODEN [1241] Diego Arroyuelo, Daniela Campos, VLDBFR. ISSN 1066-8888 (print), and Domagoj Vrgoc. CompactLTJ: 0949-877X (electronic). URL https: Space & time efficient leapfrog triejoin //link.springer.com/article/10. on graph databases. VLDB Jour1007/s00778-025-00944-6. nal: Very Large Data Bases, 34 Lu:2025:CQP (6):??, November 2025. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1245] Pengkai Lu, Zhongle Xie, and Lidan //link.springer.com/article/10. Shou. Cohort query processing with1007/s00778-025-00945-5. out misleading aging effects. VLDB Journal: Very Large Data Bases, 34 Zhong:2025:FLD (6):??, November 2025. CODEN [1242] Kai Zhong, Luming Sun, and Hong VLDBFR. ISSN 1066-8888 (print), Chen. FOSS: a learned doctor for 0949-877X (electronic). URL https: query optimization. VLDB Jour//link.springer.com/article/10. nal: Very Large Data Bases, 34 1007/s00778-025-00948-2. REFERENCES 201 Sylligardos:2025:MDD 35(1):??, January 2026. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-025-00954-4. [1246] Emmanouil Sylligardos, John Paparrizos, and Paul Boniol. MSAD: A deep dive into model selection for time series anomaly detection. VLDB Sun:2026:EBT Journal: Very Large Data Bases, 34 (6):??, November 2025. CODEN [1250] Sikang Sun, Chuqing Gao, and JianVLDBFR. ISSN 1066-8888 (print), guo Wang. An evaluation of B0949-877X (electronic). URL https: tree compression techniques. VLDB //link.springer.com/article/10. Journal: Very Large Data Bases, 1007/s00778-025-00949-1. 35(1):??, January 2026. CODEN VLDBFR. ISSN 1066-8888 (print), Nosrati:2026:VAD 0949-877X (electronic). URL https: [1247] Masoud Nosrati and Ying Cai. Verifi//link.springer.com/article/10. able authenticated data structure (V1007/s00778-025-00950-8. ADS) for analytic queries. VLDB Hu:2026:DHL Journal: Very Large Data Bases, 35(1):??, January 2026. CODEN [1251] Mengdi Hu, Lanxiang Chen, and VLDBFR. ISSN 1066-8888 (print), Yi Mu. Dynamic hub labeling for 0949-877X (electronic). URL https: shortest distance queries on struc//link.springer.com/article/10. tured encrypted graphs. VLDB 1007/s00778-025-00952-6. See corJournal: Very Large Data Bases, rection [1258]. 35(1):??, January 2026. CODEN VLDBFR. ISSN 1066-8888 (print), Xu:2026:QHC 0949-877X (electronic). URL https: [1248] Lantian Xu, Dong Wen, and Xuemin //link.springer.com/article/10. Lin. On querying historical con1007/s00778-025-00955-3. nectivity in large-scale temporal Xu:2026:TTG graphs. VLDB Journal: Very Large Data Bases, 35(1):??, January 2026. [1252] Lijie Xu, Chulin Xie, and Ce Zhang. CODEN VLDBFR. ISSN 1066TablePuppet: Towards a generic 8888 (print), 0949-877X (electronic). framework for learning over relaURL https://link.springer.com/ tional tables. VLDB Journal: Very article/10.1007/s00778-025-00951Large Data Bases, 35(1):??, January 7. 2026. CODEN VLDBFR. ISSN 10668888 (print), 0949-877X (electronic). Song:2026:CNL URL https://link.springer.com/ [1249] Yuanfeng Song, Jinwei Lu, and Rayarticle/10.1007/s00778-025-00956mond Chi-Wing Wong. CoVis: Neu2. ral and LLM-driven multi-turn inYang:2026:FLD teractions for conversational textto-visualization generation. VLDB [1253] Yi Yang, Chenhao Ma, and Xiaolin Han. Finding locally densest subJournal: Very Large Data Bases, REFERENCES 202 article/10.1007/s00778-025-00953graphs: Convex programming with 5. edge and triangle density. VLDB Journal: Very Large Data Bases, Luo:2026:MVI 35(1):??, January 2026. CODEN VLDBFR. ISSN 1066-8888 (print), [1257] Feng Luo, Hai Lan, and Xiaoli 0949-877X (electronic). URL https: Wang. Missing value imputation //link.springer.com/article/10. in tabular data lakes unleashed: 1007/s00778-025-00958-0. a hybrid approach. VLDB Journal: Very Large Data Bases, 35 Cheng:2026:KSS (2):??, March 2026. CODEN VLDBFR. ISSN 1066-8888 (print), [1254] Gang Cheng, Hanlin Zhang, and Kun 0949-877X (electronic). URL https: Hua. KOG: a secret sharing-based //link.springer.com/article/10. scalable privacy-preserving training 1007/s00778-025-00957-1. framework for decision trees. VLDB Journal: Very Large Data Bases, Nosrati:2026:CVA 35(1):??, January 2026. CODEN VLDBFR. ISSN 1066-8888 (print), [1258] Masoud Nosrati and Ying Cai. Cor0949-877X (electronic). URL https: rection: Verifiable authenticated data //link.springer.com/article/10. structure (V-ADS) for analytic queries. 1007/s00778-025-00959-z. VLDB Journal: Very Large Data Bases, 35(2):??, March 2026. CODEN Punter:2026:OMD VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1255] Wieger R. Punter, Odysseas Pa//link.springer.com/article/10. papetrou, and Minos Garofalakis. 1007/s00778-025-00962-4. See OmniSketch: Multi-dimensional up[1247]. date stream analytics with arbitrary predicates. VLDB JourZhu:2026:TTE nal: Very Large Data Bases, 35 (1):??, January 2026. CODEN [1259] Kaijie Zhu, Di Chen, and NikoVLDBFR. ISSN 1066-8888 (print), lay Yakovets. On topology and 0949-877X (electronic). URL https: time: efficient evaluation for temporal//link.springer.com/article/10. clique subgraph queries. VLDB 1007/s00778-025-00960-6. Journal: Very Large Data Bases, 35(2):??, March 2026. CODEN Liang:2026:RDA VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: [1256] Chen Liang, Donghua Yang, and //link.springer.com/article/10. Hongzhi Wang. Revisiting data analy1007/s00778-026-00963-x. sis with pre-trained foundation models. VLDB Journal: Very Large Bei:2026:EDC Data Bases, 35(1):??, January 2026. CODEN VLDBFR. ISSN 1066- [1260] Yijun Bei, Teng Ma, and Gang Chen. Efficient discovery of co8888 (print), 0949-877X (electronic). movement patterns from video data. URL https://link.springer.com/ REFERENCES 203 VLDB Journal: Very Large Data Bases, 35(2):??, March 2026. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-026-00964-w. Du:2026:PPP [1261] Shen Du and Xinrui Ge. PTSSP: privacy-preserving top-k spatial keyword similarity query with priority matching. VLDB Journal: Very Large Data Bases, 35 (2):??, March 2026. CODEN VLDBFR. ISSN 1066-8888 (print), 0949-877X (electronic). URL https: //link.springer.com/article/10. 1007/s00778-026-00965-9.