default search action
The VLDB Journal, Volume 28
Volume 28, Number 1, February 2019
- Habibur Rahman, Senjuti Basu Roy, Saravanan Thirumuruganathan, Sihem Amer-Yahia, Gautam Das:
Optimized group formation for solving collaborative tasks. 1-23 - Zhiqiang Wu, Kenli Li:
VBTree: forward secure conjunctive queries over encrypted data for cloud computing. 25-46 - Seokki Lee, Bertram Ludäscher, Boris Glavic:
PUG: a framework and practical implementation for why and why-not provenance. 47-71 - Wenlu Wang, Ji Zhang, Min-Te Sun, Wei-Shinn Ku:
A scalable spatial skyline evaluation system utilizing parallel independent region groups. 73-98 - Yue Wang, Lei Chen, Yulin Che, Qiong Luo:
Accelerating pairwise SimRank estimation over static and dynamic graphs. 99-122 - Kaiqi Zhao, Gao Cong, Jin Yao Chin, Rong Wen:
Exploring market competition over topics in spatio-temporal document collections. 123-145
Volume 28, Number 2, April 2019
- Jose Picado, Arash Termehchy, Alan Fern, Parisa Ataei:
Logical scalability and efficiency of relational learning algorithms. 147-171 - Günes Aluç, M. Tamer Özsu, Khuzaima Daudjee:
Building self-clustering RDF databases using Tunable-LSH. 173-195 - Xiangmin Zhou, Dong Qin, Lei Chen, Yanchun Zhang:
Real-time context-aware social media recommendation. 197-219 - Lefteris Ntaflos, George Trimponias, Dimitris Papadias:
A unified agent-based framework for constrained graph partitioning. 221-241 - Behrooz Omidvar-Tehrani, Sihem Amer-Yahia, Ria Mae Borromeo:
User group analytics: hypothesis generation and exploratory analysis of user data. 243-266 - Xubo Wang, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang:
Leveraging set relations in exact and dynamic set similarity join. 267-292
Volume 28, Number 3, June 2019
- Sihem Amer-Yahia, Lei Chen, Renée J. Miller:
Thematic issue on data management for graphs. 293-294 - Sejla Cebiric, François Goasdoué, Haridimos Kondylakis, Dimitris Kotzinos, Ioana Manolescu, Georgia Troullinou, Mussab Zneika:
Summarizing semantic graphs: a survey. 295-327 - Gunduz Vehbi Demirci, Hakan Ferhatosmanoglu, Cevdet Aykanat:
Cascade-aware partitioning of large graph databases. 329-350 - Apurba Das, Michael Svendsen, Srikanta Tirthapura:
Incremental maintenance of maximal cliques in a dynamic graph. 351-375 - Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Efficient structural graph clustering: an index-based approach. 377-399 - Weiren Yu, Xuemin Lin, Wenjie Zhang, Jian Pei, Julie A. McCann:
SimRank*: effective and scalable pairwise similarity search based on graph topology. 401-426
Volume 28, Number 4, August 2019
- Fabio Valdés, Ralf Hartmut Güting:
A framework for efficient multi-attribute movement data analysis. 427-449 - Georgios Psaropoulos, Thomas Legler, Norman May, Anastasia Ailamaki:
Interleaving with coroutines: a systematic and practical approach to hide memory latency in index joins. 451-471 - Antoon Bronselaer, Christophe Billiet, Robin De Mol, Joachim Nielandt, Guy De Tré:
Compact representations of temporal databases. 473-496 - Mohamed-Amine Baazizi, Dario Colazzo, Giorgio Ghelli, Carlo Sartiani:
Parametric schema inference for massive JSON datasets. 497-521 - Yuan Li, Ahmed Eldawy, Jie Xue, Nadezda Knorozova, Mohamed F. Mokbel, Ravi Janardan:
Scalable computational geometry in MapReduce. 523-548 - Namyong Park, Sejoon Oh, U Kang:
Fast and scalable method for distributed Boolean tensor factorization. 549-574 - Davide Frazzetto, Thomas Dyhre Nielsen, Torben Bach Pedersen, Laurynas Siksnys:
Prescriptive analytics: a survey of emerging trends and technologies. 575-595 - Rong Zhu, Zhaonian Zou, Jianzhong Li:
Fast diversified coherent core search on multi-layer graphs. 597-622
Volume 28, Number 5, October 2019
- Nur Al Hasan Haldar, Jianxin Li, Mark Reynolds, Timos Sellis, Jeffrey Xu Yu:
Location prediction in large-scale social networks: an in-depth benchmarking study. 623-648 - Yixiang Fang, Yun Li, Reynold Cheng, Nikos Mamoulis, Gao Cong:
Evaluating pattern matching queries for spatial databases. 649-673 - Jinhyun Kim, Jun-Ki Min, Kyuseok Shim:
Efficient two-dimensional Haar + synopsis construction for the maximum absolute error measure. 675-701 - Konstantinos Theocharidis, John Liagouris, Nikos Mamoulis, Panagiotis Bouros, Manolis Terrovitis:
SRX: efficient management of spatial RDF data. 703-733 - Tong Yang, Jie Jiang, Yang Zhou, Long He, Jinyang Li, Bin Cui, Steve Uhlig, Xiaoming Li:
Fast and accurate stream processing by filtering the cold. 735-763 - Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Eccentricities on small-world networks. 765-792 - Katrin Affolter, Kurt Stockinger, Abraham Bernstein:
A comparative survey of recent natural language interfaces for databases. 793-819 - Zhinan Cheng, Qun Huang, Patrick P. C. Lee:
On the performance and convergence of distributed stream processing via approximate fault tolerance. 821-846
Volume 28, Number 6, December 2019
- Haridimos Kondylakis, Niv Dayan, Kostas Zoumpatianos, Themis Palpanas:
Coconut: sortable summarizations for scalable indexes over static and streaming data series. 847-869 - Tianming Zhang, Yunjun Gao, Lu Chen, Wei Guo, Shiliang Pu, Baihua Zheng, Christian S. Jensen:
Efficient distributed reachability querying of massive temporal graphs. 871-896 - Xuelian Lin, Jiahao Jiang, Shuai Ma, Yimeng Zuo, Chunming Hu:
One-pass trajectory simplification using the synchronous Euclidean distance. 897-921 - Runhui Wang, Sibo Wang, Xiaofang Zhou:
Parallelizing approximate single-source personalized PageRank queries on shared memory. 923-940 - Geoff Langdale, Daniel Lemire:
Parsing gigabytes of JSON per second. 941-960 - Weilong Ren, Xiang Lian, Kambiz Ghazinour:
Skyline queries over incomplete data streams. 961-985 - Fan Zhang, Xuemin Lin, Ying Zhang, Lu Qin, Wenjie Zhang:
Efficient community discovery with user engagement and similarity. 987-1012
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.