


Остановите войну!
for scientists:


default search action
The VLDB Journal, Volume 26
Volume 26, Number 1, February 2017
- Chen Li, Volker Markl:
Special issue on best papers of VLDB 2015. 1-2 - Chen Li, Volker Markl:
Erratum to: Special issue on best papers of VLDB 2015. 3 - Wolfgang Gatterbauer, Dan Suciu:
Dissociation and propagation for approximate lifted inference with standard relational database management systems. 5-30 - Jiexing Li, Jeffrey F. Naughton, Rimma V. Nehme:
Resource bricolage and resource selection for parallel database systems. 31-54 - Jan Finis
, Robert Brunel, Alfons Kemper, Thomas Neumann
, Norman May, Franz Färber:
Order Indexes: supporting highly dynamic hierarchical data in relational main-memory database systems. 55-80 - Christopher De Sa, Alexander Ratner, Christopher Ré, Jaeho Shin, Feiran Wang, Sen Wu, Ce Zhang:
Incremental knowledge base construction using DeepDive. 81-105 - Immanuel Trummer
, Christoph Koch:
Multi-objective parametric query optimization. 107-124 - Zuhair Khayyat
, William Lucia, Meghna Singh
, Mourad Ouzzani, Paolo Papotti
, Jorge-Arnulfo Quiané-Ruiz
, Nan Tang, Panos Kalnis
:
Fast and scalable inequality joins. 125-150
Volume 26, Number 2, April 2017
- Shiyu Yang, Muhammad Aamir Cheema
, Xuemin Lin
, Ying Zhang
, Wenjie Zhang
:
Reverse k nearest neighbors queries and spatial reverse top-k queries. 151-176 - Kun Li, Xiaofeng Zhou
, Daisy Zhe Wang, Christan Earl Grant
, Alin Dobra
, Christopher Dudley:
In-database batch and query-time inference over probabilistic graphical models using UDA-GIST. 177-201 - Miao Xie
, Sourav S. Bhowmick
, Gao Cong
, Qing Wang:
PANDA: toward partial topology-based search on large networks in a single machine. 203-228 - Mohan Yang
, Alexander Shkapsky, Carlo Zaniolo:
Scaling up the performance of more powerful Datalog systems on multicore machines. 229-248 - Minghe Yu, Jin Wang, Guoliang Li, Yong Zhang, Dong Deng, Jianhua Feng:
A unified framework for string similarity search with edit-distance constraint. 249-274 - Long Yuan, Lu Qin
, Xuemin Lin
, Lijun Chang, Wenjie Zhang
:
I/O efficient ECC graph decomposition via graph reduction. 275-300
Volume 26, Number 3, June 2017
- Xiang Wang
, Wenjie Zhang
, Ying Zhang
, Xuemin Lin
, Zengfeng Huang
:
Top-k spatial-keyword publish/subscribe over sliding window. 301-326 - Jun Gao, Yuqiong Liu, Chang Zhou, Jeffrey Xu Yu:
Path-based holistic detection plan for multiple patterns in distributed graph frameworks. 327-345 - Peipei Yi
, Byron Choi, Sourav S. Bhowmick
, Jianliang Xu
:
AutoG: a visual query autocompletion framework for graph databases. 347-372 - Saad Aljubayrin
, Jianzhong Qi
, Christian S. Jensen
, Rui Zhang, Zhen He
, Yuan Li:
Finding lowest-cost paths in settings with safe and preferred zones. 373-397 - Dongxiang Zhang, Dingyu Yang, Yuan Wang, Kian-Lee Tan
, Jian Cao, Heng Tao Shen:
Distributed shortest path query processing on dynamic road networks. 399-419 - Longbin Lai
, Lu Qin
, Xuemin Lin
, Lijun Chang:
Scalable subgraph enumeration in MapReduce: a cost-oriented approach. 421-446 - Francesco Cafagna
, Michael H. Böhlen
:
Disjoint interval partitioning. 447-466
Volume 26, Number 4, August 2017
- Yunjun Gao, Xiaoye Miao, Gang Chen, Baihua Zheng
, Deng Cai, Huiyong Cui:
On efficiently finding reverse k-nearest neighbors over uncertain graphs. 467-492 - Yufei Tao
, Xiaocheng Hu, Miao Qiao
:
Stream sampling over windows with worst-case optimality and $$\ell $$ ℓ -overlap independence. 493-510 - Nguyen Quoc Viet Hung
, Chi Thang Duong, Thanh Tam Nguyen
, Matthias Weidlich
, Karl Aberer, Hongzhi Yin
, Xiaofang Zhou
:
Argument discovery via crowdsourcing. 511-535 - Tianzheng Wang, Ryan Johnson, Alan D. Fekete, Ippokratis Pandis:
Efficiently making (almost) any concurrency control mechanism serializable. 537-562 - Qiankun Zhu, Hong Cheng, Xin Huang
:
I/O-efficient algorithms for top-k nearest keyword search in massive graphs. 563-583 - Lu Chen
, Yunjun Gao, Aoxiao Zhong, Christian S. Jensen
, Gang Chen, Baihua Zheng
:
Indexing metric uncertain data for range queries and range joins. 585-610
Volume 26, Number 5, October 2017
- Shaoxu Song
, Boge Liu, Hong Cheng, Jeffrey Xu Yu, Lei Chen:
Graph repairing under neighborhood constraints. 611-635 - Xiangmin Zhou
, Lei Chen, Yanchun Zhang, Dong Qin, Longbing Cao
, Guangyan Huang, Chen Wang
:
Enhancing online video recommendation using social user interactions. 637-656 - Varunya Attasena
, Jérôme Darmont
, Nouria Harbi:
Secret sharing for cloud data security: a survey. 657-681 - Qiang Huang
, Jianlin Feng, Qiong Fang, Wilfred Ng, Wei Wang:
Query-aware locality-sensitive hashing scheme for lp norm. 683-708 - Qijun Zhu, Haibo Hu
, Cheng Xu
, Jianliang Xu
, Wang-Chien Lee:
Geo-social group queries with minimum acquaintance constraints. 709-727 - Kai Zhang
, Kaibo Wang, Yuan Yuan, Lei Guo, Rubao Li, Xiaodong Zhang, Bingsheng He
, Jiayu Hu, Bei Hua:
A distributed in-memory key-value store system on heterogeneous CPU-GPU cluster. 729-750
Volume 26, Number 6, December 2017
- Rong-Hua Li, Lu Qin
, Jeffrey Xu Yu, Rui Mao:
Finding influential communities in massive networks. 751-776 - Syed Muhammad Fawad Ali
, Robert Wrembel
:
From conceptual design to performance optimization of ETL workflows: current state of research and open problems. 777-801 - Yixiang Fang
, Reynold Cheng, Yankai Chen, Siqiang Luo
, Jiafeng Hu:
Effective and efficient attributed community search. 803-828 - Wei Lu, Jiajia Hou, Ying Yan, Meihui Zhang, Xiaoyong Du, Thomas Moscibroda:
MSQL: efficient similarity search in metric spaces using SQL. 829-854 - Nguyen Quoc Viet Hung
, Duong Chi Thang, Thanh Tam Nguyen
, Matthias Weidlich
, Karl Aberer, Hongzhi Yin
, Xiaofang Zhou
:
Answer validation for generic crowdsourcing tasks with minimal efforts. 855-880 - Melanie Herschel, Ralf Diestelkämper, Houssem Ben Lahmar:
A survey on provenance: What for? What form? What from? 881-906

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.