default search action
The VLDB Journal, Volume 31
Volume 31, Number 1, January 2022
- Jan Kossmann
, Thorsten Papenbrock
Data dependencies for query optimization: a survey. 1-22 - Yifan Zhu
Pivot selection algorithms in metric spaces: a survey and experimental study. 23-47 - Sebastian Schmidl
Efficient distributed discovery of bidirectional order dependencies. 49-74 - Anton Dignös
Leveraging range joins for the computation of overlap joins. 75-99 - You Peng
Answering reachability and K-reach queries on large graphs with label constraints. 101-127 - Wentao Li
Distance labeling: on parallelism, compression, and ordering. 129-155 - Elias Alevizos
Complex event forecasting with prediction suffix trees. 157-180 - Richard T. Snodgrass, Sabah Currim, Young-Kyoon Suh
Have query optimizers hit the wall? 181-200
Volume 31, Number 2, March 2022
- Angela Bonifati
Special issue on big graph data management and processing. 201-202 - Kai Wang
Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs. 203-226 - Qingyuan Linghu, Fan Zhang
Anchored coreness: efficient reinforcement of social networks. 227-252 - Da Yan
PrefixFPM: a parallel framework for general-purpose mining of frequent and closed patterns. 253-286 - Da Yan
G-thinker: a general distributed framework for finding qualified subgraphs in a big graph with load balancing. 287-320 - Aisha Mohamed, Ghadeer Abuoda, Abdurrahman Ghanem, Zoi Kaoudi
RDFFrames: knowledge graph access for machine learning tools. 321-346 - Tomer Sagi
A design space for RDF data representations. 347-373 - Christopher Rost
Distributed temporal graph analytics with GRADOOP. 375-401 - Glenn S. Bevilacqua
A fractional memory-efficient approach for online continuous-time influence maximization. 403-429
Volume 31, Number 3, May 2022
- Waqas Ali
A survey of RDF stores & SPARQL engines for querying knowledge graphs. 1-26 - Evaggelia Pitoura, Kostas Stefanidis
Fairness in rankings and recommendations: an overview. 431-458 - Arif Hidayat
Continuous monitoring of moving skyline and top-k queries. 459-482 - Muhammad Farhan
Fast fully dynamic labelling for distance queries. 483-506 - Tianyu Zhao, Shuai Huang, Yong Wang, Chengliang Chai, Guoliang Li
RNE: computing shortest paths using road network embedding. 507-528 - Zhuohang Lai
Accelerating multi-way joins on the GPU. 529-553 - Sabrina De Capitani di Vimercati
An authorization model for query execution in the cloud. 555-579 - Kai Huang
Privacy and efficiency guaranteed social subgraph matching. 581-602
Volume 31, Number 4, July 2022
- Dong Wen
Span-reachability querying in large temporal graphs. 629-647 - Jalal Khalil, Da Yan
Parallel mining of large maximal quasi-cliques. 649-674 - Kenza Kellou-Menouer
A survey on semantic schema discovery. 675-710 - Manuel Fritz
Efficient exploratory clustering analyses in large-scale exploration processes. 711-732 - Libin Zheng
Privacy-preserving worker allocation in crowdsourcing. 733-751 - Xuedi Qin, Chengliang Chai, Yuyu Luo, Tianyu Zhao, Nan Tang, Guoliang Li
Interactively discovering and ranking desired tuples by data exploration. 753-777 - Yuqing Zhu, Jing Tang
Optimal price profile for influential nodes in online social networks. 779-795 - Daichi Amagata
Fast, exact, and parallel-friendly outlier detection algorithms with proximity graph in metric spaces. 797-821
Volume 31, Number 5, September 2022
- Zi Huang
Special issue on responsible data management and data science. 823 - Pei Li, Jaroslaw Szlichta
ABC of order dependencies. 825-849 - Renzo Arturo Alva Principe, Andrea Maurino, Matteo Palmonari, Michele Ciavotta, Blerina Spahiu
ABSTAT-HD: a scalable tool for profiling very large knowledge graphs. 851-876 - Qinyong Wang, Hongzhi Yin
Fast-adapting and privacy-preserving federated recommender system. 877-896 - Sheng Xiang, Dong Wen
General graph generators: experiments, analyses, and improvements. 897-925 - Zifan Liu
Picket: guarding against corrupted data in tabular data during learning and inference. 927-955 - Yong-Feng Ge
MDDE: multitasking distributed differential evolution for privacy-preserving database fragmentation. 957-975 - Egawati Panjei
A survey on outlier explanations. 977-1008 - Weixin Zeng
On entity alignment at scale. 1009-1033 - Qingyu Xu, Feng Zhang
Payment behavior prediction on shared parking lots with TR-GCN. 1035-1058 - Shazia Sadiq
Information Resilience: the nexus of responsible and agile approaches to information use. 1059-1084 - Fanzhen Liu
eRiskCom: an e-commerce risky community detection platform. 1085-1101 - Stefan Grafberger
Data distribution debugging in machine learning pipelines. 1103-1126 - Qian Li
Deep treatment-adaptive network for causal inference. 1127-1142 - Rui Zhang
A benchmark and comprehensive survey on knowledge graph entity alignment via representation learning. 1143-1168
Volume 31, Number 6, November 2022
- Danica Porobic
Special issue on the best papers of DaMoN 2020. 1169 - Henning Funke
Low-latency query compilation. 1171-1184 - Tiemo Bang
The full story of 1000 cores. 1185-1213 - Johannes Pietrzyk
To share or not to share vector registers? 1215-1236 - Magdalena Balazinska, Xiaofang Zhou:
Editorial for S.I.: VLDB 2020. 1237-1238 - Yihe Huang, William Qian, Eddie Kohler
Opportunities for optimism in contended main-memory multicore transactions. 1239-1261 - Srikanth Kandula
Data-induced predicates for sideways information passing in query optimizers. 1263-1290 - Maurice Herlihy
Cross-chain deals and adversarial commerce. 1291-1309 - Yuanbing Li, Xian Wu, Yifei Jin, Jian Li, Guoliang Li
Adapative algorithms for crowd-aided categorization. 1311-1337 - Bolong Zheng
PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search. 1339-1363 - Bingqing Lyu, Lu Qin
Maximum and top-k diversified biclique search at scale. 1365-1389
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-07 23:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: