Poster Session 2 and a reception will take place on Thursday at 16:45 in the Kohala Ballroom. This session contains the posters of the following papers:

1. TOP: A Framework for Enabling Algorithmic Optimizations for Distance-Related Problems, by Yufei Ding, Xipeng Shen, Madanlal Musuvathi, Todd Mytkowicz
2. SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs, by Hiroaki Shiokawa, Yasuhiro Fujiwara, Makoto Onizuka
3. GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations, by Yang Zhou, Ling Liu, Kisung Lee, Qi Zhang
4. A Scalable Distributed Graph Partitioner, by Daniel Margo, Margo Seltzer
5. Keys for Graphs, by Wenfei Fan, Zhe Fan, Chao Tian, Xin Luna Dong
6. Scaling Up Concurrent Main-Memory Column-Store Scans: Towards Adaptive NUMA-aware Data and Task Placement, by Iraklis Psaroudakis, Tobias Scheuer, Norman May, Abdelkader Sellami, Anastassia Ailamaki
7. In-Memory Performance for Big Data, by Goetz Graefe, Haris Volos, Hideaki Kimura, Harumi Kuno, Joseph Tucek, Mark Lillibridge, Alistair Veitch
8. Profiling R on a Contemporary Processor, by Shriram Sridharan, Jignesh Patel
9. Deployment of Query Plans on Multicores, by Jana Giceva, Gustavo Alonso, Timothy Roscoe, Tim Harris
10. Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions, by Hiroshi Inoue, Moriyoshi Ohara, Kenjiro Taura
11. Resource Bricolage for Parallel Database Systems, by Jiexing Li, Jeffrey Naughton, Rimma Nehme
12. Multi-Objective Parametric Query Optimization, by Immanuel Trummer, Christoph Koch
13. Querying with Access Patterns and Integrity Constraints, by Michael Benedikt, Julien Leblay, Efi Tsamoura
14. Uncertainty Aware Query Execution Time Prediction, by Wentao Wu, Xi Wu, Hakan Hacigumus, Jeffrey Naughton
15. Join Size Estimation Subject to Filter Conditions, by David Vengerov, Andre Menck, Sunil Chakkappen, Mohamed Zait
16. Scaling Up Crowd-Sourcing to Very Large Datasets: A Case for Active Learning, by Barzan Mozafari, Purna Sarkar, Michael Franklin, Michael Jordan, Sam Madden
17. Hear the Whole Story: Towards the Diversity of Opinion in Crowdsourcing Markets, by Ting Wu, Lei Chen, Pan Hui, CHEN ZHANG, Weikai Li
18. Where To: Crowd-Aided Path Selection, by Chen Zhang, Yongxin Tong, Lei Chen
19. Reliable Diversity-Based Spatial Crowdsourcing by Moving Workers, by Peng Cheng, Xiang Lian, Zhao Chen, Rui Fu, Lei Chen, Jinsong Han, Jizhong Zhao
20. Learning User Preferences By Adaptive Pairwise Comparison, by Li Qian, Jinyang Gao, H V Jagadish
21. Pregelix: Big(ger) Graph Analytics on A Dataflow Engine, by Yingyi Bu, Vinayak Borkar, Jianfeng Jia, Michael Carey, Tyson Condie
22. Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation, by Yi Lu, James Cheng, Da Yan, Huanhuan Wu
23. Fast Failure Recovery in Distributed Graph Processing Systems, by Yanyan Shen, Gang Chen, H V Jagadish, Wei Lu, Beng Chin Ooi, Bogdan Tudor
24. Giraph Unchained: Barrierless Asynchronous Parallel Execution in Pregel-like Graph Processing Systems, by Minyang Han, Khuzaima Daudjee
25. GraphMat: High performance graph analytics made productive, by Narayanan Sundaram, Nadathur Satish, Mostofa Ali Patwary, Subramanya Dulloor, Michael Anderson, Satya Gautam Vadlamudi, Dipankar Das, Pradeep Dubey
26. In-Cache Query Co-Processing on Coupled CPU-GPU Architectures, by Jiong He, Shuhao Zhang, Bingsheng He
27. NVRAM-aware Logging in Transaction Systems, by Jian Huang, Karsten Schwan, Moinuddin Qureshi
28. Improving Main Memory Hash Joins on Intel Xeon Phi Processors: An Experimental Approach, by Saurabh Jha, Bingsheng He, Mian Lu, Xuntao Cheng, Phung Huynh Huynh
29. REWIND: Recovery Write-Ahead System for In-Memory Non-Volatile Data-Structures, by Andreas Chatzistergiou, Marcelo Cintra, Stratis Viglas
30. Persistent B+-Trees in Non-Volatile Main Memory, by Shimin Chen, Qin Jin
31. Robust Local Community Detection: On Free Rider Effect and Its Elimination, by Yubao Wu, Ruoming Jin, Jing Li, Xiang Zhang
32. Viral Marketing Meets Social Advertising: Ad Allocation with Minimum Regret, by Cigdem Aslay, Wei Lu, Francesco Bonchi, Amit Goyal, Laks Lakshmanan
33. Community Detection in Social Networks: An In-depth Benchmarking Study with a Procedure-Oriented Framework, by Meng Wang, Chaokun Wang, Jeffrey Xu Yu, Jun Zhang
34. Leveraging History for Faster Sampling of Online Social Networks, by Zhuojie Zhou, Nan Zhang, Gautam Das
35. Real-time Targeted Influence Maximization for Online Advertisements, by Yuchen Li, Dongxiang Zhang, Kian-Lee Tan
36. Top-k Nearest Neighbor Search In Uncertain Data Series, by Michele Dallachiesa, Themis Palpanas, Ihab Ilyas
37. Scaling Manifold Ranking Based Image Retrieval, by Yasuhiro Fujiwara, Go Irie, Shari Kuroyama, Makoto Onizuka
38. Optimal Enumeration: Efficient Top-k Tree Matching, by Lijun Chang, Xuemin Lin, Wenjie Zhang, Jeffrey Xu Yu, Ying Zhang, Lu Qin
39. Generating Top-k Packages via Preference Elicitation, by Min Xie, Laks V. S. Lakshmanan, Peter Wood
40. Rank aggregation with ties: Experiments and Analysis, by Bryan Brancotte, Bo Yang, Guillaume Blin, Sarah Cohen-Boulakia, Alain Denise, Sylvie Hamel
41. Trajectory Simplification: On Minimizing the Direction-based Error, by Cheng Long, Raymond Chi-Wing Wong, H V Jagadish
42. Selectivity Estimation on Streaming SpatioTextual Data Using Local Correlations, by Xiaoyang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin, Wei Wang
43. Spatial Joins in Main Memory: Implementation Matters!, by Darius Sidlauskas, Christian Jensen
44. Large Scale Real-time Ridesharing with Service Guarantee on Road Networks, by Yan Huang, Favyen Bastani, Ruoming Jin, Xiaoyang Wang
45. Compressed Spatial Hierarchical Bitmap (cSHB) Indexes for Efficiently Processing Spatial Range Query Workloads, by Parth Nagarkar, K. Selcuk Candan, Aneesha Bhat
46. Finding Patterns in a Knowledge Base using Keywords to Compose Table Answers, by Mohan Yang, Bolin Ding, Surajit Chaudhuri, Kaushik Chakrabarti
47. Searchlight: Enabling Integrated Search and Exploration over Large Multidimensional Data, by Alexander Kalinin, Ugur Cetintemel, Stan Zdonik
48. Processing Moving kNN Queries Using Influential Neighbor Sets, by Chuanwen Li, Yu Gu, Jianzhong Qi, Ge Yu, Rui Zhang, Wang Yi
49. Reverse k Nearest Neighbors Query Processing: Experiments and Analysis, by Shiyu Yang, Muhammad Cheema, Xuemin Lin, Wei Wang
50. Permutation Search Methods are Efficient, Yet Faster Search is Possible, by Bilegsaikhan Naidan, Leonid Boytsov, Eric Nyberg
51. DREAM: Distributed RDF Engine with Adaptive Query Planner and Minimal Communication, by Mohammad Hammoud, Dania Abed Rabbou, Reza Nouri, Seyed-Mehdi-Reza Beheshti, Sherif Sakr
52. Efficient Identification of Implicit Facts in Incomplete OWL2-EL Knowledge Bases, by John Liagouris, Manolis Terrovitis
53. Taming Subgraph Isomorphism for RDF Query Processing, by Jinha Kim, Hyungyu Shin, Wook-Shin Han, Sungpack Hong, Hassan Chafi
54. SEMA-JOIN : Joining Semantically-Related Tables Using Big Table Corpora, by Yeye He, Kris Ganjam, Xu Chu
55. QuickFOIL: Scalable Inductive Logic Programming, by Qiang Zeng, Jignesh Patel, David Page
56. ScalaGiST: Scalable Generalized Search Trees for MapReduce Systems, by Peng Lu, Gang Chen, Beng Chin Ooi, Hoang Tam Vo, Sai Wu
57. DIADEM: Thousands of Websites to a Single Database, by Tim Furche, Georg Gottlob, Giovanni Grasso, Xiaonan Guo, Giorgio Orsi, Christian Schallhart, Cheng Wang
58. AsterixDB: A Scalable, Open Source BDMS, by Sattam Alsubaiee, Yasser Altowim, Hotham Altwaijry, Alex Behm, Vinayak Borkar, Yingyi Bu, Michael Carey, Inci Cetindil, Madhusudan Cheelangi, Khurram Faraaz, Eugenia Gabrielova, Raman Grover, Zachary Heilbron, Young-Seok Kim, Chen Li, Guangqiang Li, Ji Mahn Ok, Nicola Onose, Pouria Pirzadeh, Vassilis Tsotras, Rares Vernica, Jian Wen, Till Westmann
59. Mega-KV: A Case for GPUs to Maximize the Throughput of In-Memory Key-Value Stores, by Kai Zhang, Kaibo Wang, Yuan Yuan, Lei Guo, Rubao Lee, Xiaodong Zhang
60. UDA-GIST: An In-database Framework to Unify Data-Parallel and State-Parallel Analytics, by Kun Li, Daisy Zhe Wang, Alin Dobra, Chris Dudley
61. Auto-Approximation of Graph Computing, by Zechao Shang, Jeffrey Xu Yu
62. 62. Approximate lifted inference with probabilistic databases , by Wolfgang Gatterbauer, Dan Suciu
63. Incremental Knowledge Base Construction Using DeepDive, by Jaeho Shin, Sen Wu, Feiran Wang, Christopher De Sa, Ce Zhang, Christopher Re
64. Lenses: An On-Demand Approach to ETL, by Ying Yang, Niccolo Meneghetti, Ronny Fehling, Zhen Hua Liu, Oliver Kennedy
65. Knowledge-Based Trust: A Method to Estimate the Trustworthiness of Web Sources, by Xin Luna Dong, Evgeniy Gabrilovich, Kevin Murphy, Van Dang, Wilko Horn, Camillo Lugaresi, Shaohua Sun, Wei Zhang
66. DAQ: A New Paradigm for Approximate Query Processing, by Navneet Potti, Jignesh Patel
67. On the Surprising Difficulty of Simple Things: the Case of Radix Partitioning, by Felix Schuhknecht, Pankaj Khanchandani, Jens Dittrich
68. Efficient Processing of Window Functions in Analytical SQL Queries, by Viktor Leis, Kan Kundhikanjana, Alfons Kemper, Thomas Neumann
69. Scaling Similarity Joins over Tree-Structured Data, by Yu Tang, Yilun Cai, Nikos Mamoulis
70. Processing of Probabilistic Skyline Queries Using MapReduce, by Yoonjae Park, Jun-Ki Min, Kyuseok Shim
71. Interpretable and Informative Explanations of Outcomes, by Kareem El Gebaly, Parag Agrawal, Lukasz Golab, Flip Korn, Divesh Srivastava
72. Stale View Cleaning: Getting Fresh Answers from Stale Materialized Views, by Sanjay Krishnan, Jiannan Wang, Michael Franklin, Ken Goldberg, Tim Kraska
73. Scalable Topical Phrase Mining from Text Corpora, by Ahmed El-Kishky, Yanglei Song, Chi Wang, Clare Voss, Jiawei Han
74. Maximum Rank Query, by Kyriakos Mouratidis, Jilian Zhang, HweeHwa Pang
75. A Confidence-Aware Approach for Truth Discovery on Long-Tail Data, by Qi Li, Yaliang Li, Jing Gao, Lu Su, Bo Zhao, Murat Demirbas, Wei Fan, Jiawei Han
76. 76. An Architecture for Compiling UDF-centric Workflows , by Andrew Crotty, Alex Galakatos, Kayhan Dursun, Tim Kraska, Carsten Binnig, Ugur Cetintemel, Stan Zdonik
77. Take me to your leader! Online Optimization of Distributed Storage Configurations, by Artyom Sharov, Alexander Shraer, Arif Merchant, Murray Stokely
78. SIMD- and Cache-Friendly Algorithm for Sorting an Array of Structures, by Hiroshi Inoue, Kenjiro Taura
79. To Lock, Swap, or Elide: On the Interplay of Hardware Transactional Memory and Lock-Free Indexing, by Darko Makreshanski, Justin Levandoski, Ryan Stutsman
80. SQLite Optimization with Phase Change Memory for Mobile Applications, by Gihwan Oh, Sangchul Kim, Sang-Won Lee, Bongki Moon
81. Practical Authenticated Pattern Matching with Optimal Proof Size, by Dimitrios Papadopoulos, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos
82. Fast Range Query Processing with Strong Privacy Protection for Cloud Computing, by Rui Li, Alex Liu, Ann Wang, Bezawada Bruhadeshwar
83. DPT: Differentially Private Trajectory Synthesis Using Hierarchical Reference Systems, by Xi He, Graham Cormode, Ashwin Machanavajjhala, Cecilia Procopiuc, Divesh Srivastava
84. Privacy Implications of Database Ranking, by Md Farhadur Rahman, Weimo Liu, Saravanan Thirumuruganathan, Nan Zhang, Gautam Das
85. Selective Provenance for Datalog Programs Using Top-k Queries, by Daniel Deutch, Amir Gilad, Yuval Moskovitch
86. Asynchronous and Fault-Tolerant Recursive Datalog Evaluation in Shared-Nothing Engines, by Jingjing Wang, Magdalena Balazinska, Daniel Halperin
87. Aggregate Estimations over Location Based Services, by Weimo Liu, Md Farhadur Rahman, Saravanan Thirumuruganathan, Nan Zhang, Gautam Das
88. PARADIS: An Efficient Parallel Algorithm for In-place Radix Sort, by Minsik Cho, Daniel Brand, Rajesh Bordawekar, Ulrich Finkler, Vincent Kulandaisamy, Ruchir Puri
89. Performance and Scalability of Indexed Subgraph Query Processing Methods, by Foteini Katsarou, Nikos Ntarmos, Peter Triantafillou
90. Spatial Partitioning Techniques in SpatialHadoop, by Ahmed Eldawy, Louai Alarabi, Mohamed Mokbel
91. Divide & Conquer-based Inclusion Dependency Discovery, by Thorsten Papenbrock, Sebastian Kruse, Jorge-Arnulfo Quiane-Ruiz, Felix Naumann
92. Functional Dependency Discovery: An Experimental Evaluation of Seven Algorithms, by Thorsten Papenbrock, Jens Ehrlich, jannik Marten, Tommy Neubert, Jan-Peer Rudolph, Martin Schˆnberg, Jakob Zwiener, Felix Naumann
93. Extraction of Logical Structure of Documents Based on Hierarchical Headings, by Tomohiro Manabe, Keishi Tajima
94. Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach, by Xiaofei Zhang, Hong Cheng, Lei Chen
95. CANDS: Continuous Optimal Navigation via Distributed Stream Processing, by Dingyu Yang, Dongxiang Zhang, Kian-Lee Tan, Jian Cao, Frederic Le Mouel
96. 96. General Incremental Sliding-Window Aggregation , by Kanat Tangwongsan, Martin Hirzel, Scott Schneider, Kun-Lung Wu
97. YADING: Fast Clustering of Large-Scale Time Series Data, by Rui Ding, Qiang Wang, Yingnong Dang, Qiang Fu,Haidong Zhang,Dongmei Zhang
98. Monitoring Distributed Streams using Convex Decompositions, by Arnon Lazerson, Daniel Keren, Izchak Sharfman, Minos Garofalakis, Vasilis Samoladas, Assaf Schuste
99. Staring into the Abyss: An Evaluation of Concurrency Control with One Thousand Cores, by Xiangyao Yu, George Bezerra, Andy Pavlo, Srinivas Devadas, Michael Stonebraker
100. 100. E-Store: Fine-Grained Elastic Partitioning for Distributed Transaction Processing Systems , by Rebecca Taft, Essam Mansour, Marco Serafini, Jennie Duggan, Aaron Elmore, Ashraf Aboulnaga, Andy Pavlo, Michael Stonebraker
101. ADDICT: Advanced Instruction Chasing for Transactions, by Pinar Tozun, Islam Atta, Anastasia Ailamaki, Andrea Moshovos
102. Rethinking serializable multiversion concurrency control, by Jose Faleiro, Daniel Abadi