default search action
The VLDB Journal, Volume 27
Volume 27, Number 1, February 2018
- Hao Wei, Jeffrey Xu Yu, Can Lu, Ruoming Jin:
Reachability querying: an independent permutation labeling approach. 1-26 - Chunbin Lin, Jiaheng Lu, Zhewei Wei, Jianguo Wang, Xiaokui Xiao:
Optimal algorithms for selecting top-k combinations of attributes: theory and applications. 27-52 - Xiang Zhao, Chuan Xiao, Xuemin Lin, Wenjie Zhang, Yang Wang:
Efficient structure similarity searches: a partition-based approach. 53-78 - Weiren Yu, Xuemin Lin, Wenjie Zhang, Julie A. McCann:
Dynamical SimRank search on time-varying networks. 79-104 - Tomer Sagi, Avigdor Gal:
Non-binary evaluation measures for big data integration. 105-126 - Yubao Wu, Xiang Zhang, Yuchen Bian, Zhipeng Cai, Xiang Lian, Xueting Liao, Fengpan Zhao:
Second-order random walk-based proximity measures in graph analysis: formulations and algorithms. 127-152
Volume 27, Number 2, April 2018
- Bin Yang, Jian Dai, Chenjuan Guo, Christian S. Jensen, Jilin Hu:
PACE: a PAth-CEntric paradigm for stochastic path finding. 153-178 - Jilin Hu, Bin Yang, Chenjuan Guo, Christian S. Jensen:
Risk-aware path selection with time-varying, uncertain travel costs: a time series approach. 179-200 - Dong Su, Jianneng Cao, Ninghui Li, Min Lyu:
PrivPfC: differentially private data publication for classification. 201-223 - Dongxiang Zhang, Yuchen Li, Xin Cao, Jie Shao, Heng Tao Shen:
Augmented keyword search on spatial entity databases. 225-244 - Daniel Deutch, Amir Gilad, Yuval Moskovitch:
Efficient provenance tracking for datalog using top-k queries. 245-269 - Junfeng Zhou, Jeffrey Xu Yu, Na Li, Hao Wei, Ziyang Chen, Xian Tang:
Accelerating reachability query processing based on DAG reduction. 271-296
Volume 27, Number 3, June 2018
- Alexandros Belesiotis, Dimitrios Skoutas, Christodoulos Efstathiades, Vassilis Kaffes, Dieter Pfoser:
Spatio-textual user matching and clustering based on set similarity joins. 297-320 - Lei Li, Kai Zheng, Sibo Wang, Wen Hua, Xiaofang Zhou:
Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory. 321-345 - Chang Yao, Meihui Zhang, Qian Lin, Beng Chin Ooi, Jiatao Xu:
Scaling distributed transaction processing and recovery based on dependency logging. 347-368 - Yodsawalai Chodpathumwan, Ali Vakilian, Arash Termehchy, Amir Nayyeri:
Cost-effective conceptual design using taxonomies. 369-394 - Shuo Shang, Lisi Chen, Zhewei Wei, Christian S. Jensen, Kai Zheng, Panos Kalnis:
Parallel trajectory similarity joins in spatial networks. 395-420 - Juchang Lee, Wook-Shin Han, Hyoung Jun Na, Chang Gyoo Park, Kyu Hwan Kim, Deok Hoe Kim, Joo-Yeon Lee, Sang Kyun Cha, SeungHyun Moon:
Parallel replication across formats for scaling out mixed OLTP/OLAP workloads in main-memory databases. 421-444
Volume 27, Number 4, August 2018
- Farhana Murtaza Choudhury, J. Shane Culpepper, Zhifeng Bao, Timos Sellis:
Finding the optimal location and keywords in obstructed and unobstructed space. 445-470 - Jianye Yang, Wenjie Zhang, Shiyu Yang, Ying Zhang, Xuemin Lin, Long Yuan:
Efficient set containment join. 471-495 - Shuang Hao, Nan Tang, Guoliang Li, Jian Li, Jianhua Feng:
Distilling relations using knowledge bases. 497-519 - Renata Borovica-Gajic, Stratos Idreos, Anastasia Ailamaki, Marcin Zukowski, Campbell Fraser:
Smooth Scan: robust access path selection without cardinality estimation. 521-545 - Kai Herrmann, Hannes Voigt, Torben Bach Pedersen, Wolfgang Lehner:
Multi-schema-version data management: data independence in the twenty-first century. 547-571 - Jaroslaw Szlichta, Parke Godfrey, Lukasz Golab, Mehdi Kargar, Divesh Srivastava:
Effective and complete discovery of bidirectional order dependencies via set-based axioms. 573-591
Volume 27, Number 5, October 2018
- Surajit Chaudhuri, Jayant R. Haritsa:
Special issue on best papers of VLDB 2016. 593-594 - Matteo Interlandi, Ari Ekmekji, Kshitij Shah, Muhammad Ali Gulzar, Sai Deep Tetali, Miryung Kim, Todd D. Millstein, Tyson Condie:
Adding data provenance support to Apache Spark. 595-615 - Marius Eich, Pit Fender, Guido Moerkotte:
Efficient generation of query plans containing group-by, join, and groupjoin. 617-641 - Viktor Leis, Bernhard Radke, Andrey Gubichev, Atanas Mirchev, Peter A. Boncz, Alfons Kemper, Thomas Neumann:
Query optimization through the looking glass, and what we found running the Join Order Benchmark. 643-668 - Darko Makreshanski, Georgios Giannikis, Gustavo Alonso, Donald Kossmann:
Many-query join: efficient shared execution of relational joins on modern hardware. 669-692 - Matteo Brucato, Azza Abouzied, Alexandra Meliou:
Package queries: efficient and scalable computation of high-order constraints. 693-718 - Ahmed Elgohary, Matthias Boehm, Peter J. Haas, Frederick R. Reiss, Berthold Reinwald:
Compressed linear algebra for large-scale machine learning. 719-744
Volume 27, Number 6, December 2018
- Chengliang Chai, Guoliang Li, Jian Li, Dong Deng, Jianhua Feng:
A partial-order-based framework for cost-effective crowdsourced entity resolution. 745-770 - Tania Roblot, Miika Hannula, Sebastian Link:
Probabilistic Cardinality Constraints - Validation, Reasoning, and Semantic Summaries. 771-795 - Sebastian Breß, Bastian Köcher, Henning Funke, Steffen Zeuch, Tilmann Rabl, Volker Markl:
Generating custom code for efficient query execution on heterogeneous processors. 797-822 - Kostas Zoumpatianos, Yin Lou, Ioana Ileana, Themis Palpanas, Johannes Gehrke:
Generating data series query workloads. 823-846 - Quoc-Cuong To, Juan Soto, Volker Markl:
A survey of state management in big data processing systems. 847-872 - Yuchen Liu, Hai Liu, Dongqing Xiao, Mohamed Y. Eltabakh:
Adaptive correlation exploitation in big data query optimization. 873-898 - Tianzheng Wang, Ryan Johnson, Alan D. Fekete, Ippokratis Pandis:
Erratum to: Efficiently making (almost) any concurrency control mechanism serializable. 899-900
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.