VLDB2011?Accepted?Research?Papers

Accepted Research Papers

VLDB 2011 accepted research papers:

• Generating Efficient Execution Plans for Vertically Partitioned XML Databases
  Patrick Kling (University of Waterloo), M. Tamer Özsu (University of Waterloo), Khuzaima Daudjee (University of Waterloo)
  
• Distributed Threshold Querying of General Functions by a Difference of Monotonic Representation
  Guy Sagy (Technion), Daniel Keren (Haifa University), Izchak Sharfman, Assaf Schuster (Technion)
  
• A Generic Framework for Handling Uncertain Data with Local Correlations
  Xiang Lian (HKUST), LEI CHEN (HKUST)
  
• SnipSuggest: Context-Aware Autocompletion For SQL
  Nodira Khoussainova (University of Washington), YongChul Kwon (University of Washington), Magdalena Balazinska (University of Washington), Dan Suciu (University of Washington)
  
• On Triangulation-based Dense Neighborhood Graph Discovery
  Nan Wang (National UniversityofSingapore), Jingbo Zhang (National University of Singapore), Kian-Lee Tan (National University of Singapore), Anthony Tung (National University of Singapore)
  
• Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions
  Michael Rice (UCR), Vassilis Tsotras (UCR)
  
• CRIUS: User-Friendly Database Design
  Li Qian (University of Michigan), Kristen LeFevre (Univ. of Michigan), H. Jagadish (University of Michigan)
  
• Efficient Processing of Top-k Spatial Preference Queries
  João Rocha-Junior (NTNU), Akrivi Vlachou (NTNU), Christos Doulkeridis (NTNU), Kjetil Norvag (NTNU)
  
• A Probabilistic Approach for Automatically Filling Form-Based Web Interfaces
  Guilherme Toda (Federal University of Amazonas), Eli Cortez (Federal University of Amazonas), Altigran da Silva (Federal University of Amazonas), Edleno de Moura (Federal University of Amazonas)
  
• HYRISE - A Main Memory Hybrid Storage Engine
  Martin Grund (Hasso-Plattner-Institut), Jens Krueger (Hasso-Plattner-Institut), Hasso Plattner (Hasso-Plattner Institute), Alexander Zeier (Hasso-Plattner Institute), Philippe Cudre-Mauroux (MIT CSAIL), Samuel Madden (MIT)
  
• Output URL Bidding
  Panagiotis Papadimitriou (Stanford University), Hector Garcia-Molina (Stanford University), Ali Dasdan, Santanu Kolay
  
• Human-Assisted Graph Search: It's Okay to Ask Questions
  Aditya Parameswaran (Stanford University), Anish Das Sarma (Yahoo! Research), Hector Garcia-Molina (Stanford University), Neoklis Polyzotis (UC Santa Cruz), Jennifer Widom (Stanford University)
  
• Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
  Xintian Yang (The Ohio State University), Srinivasan Parthasarathy (The Ohio State University), Ponnuswamy Sadayappan (The Ohio State University)
  
• Fast Incremental and Personalized PageRank
  Bahman Bahmani (Stanford University), Abdur Chowdhury (Twitter Inc.), Ashish Goel (Stanford University, Twitter Inc.)
  
• Automatic Wrappers for Large Scale Web Extraction
  Nilesh Dalvi (Yahoo! ), Ravi Kumar (Yahoo!), Mohamed Soliman (U. of Waterloo)
  
• Similarity Join Size Estimation using Locality Sensitive Hashing
  Hongrae Lee (University of British Columbia), Raymond Ng (University of British Columbia), Kyuseok Shim (Seoul National University)
  
• Update Rewriting and Integrity Constraint Maintenance in a Schema Evolution Support System: PRISM++
  Carlo Curino (MIT), Hyun Moon (NEC Labs America), Alin Deutsch (UCSD), Carlo Zaniolo (UCLA)
  
• The Complexity of Causality and Responsibility for Query Answers and non-Answers
  Alexandra Meliou (University of Washington), Wolfgang Gatterbauer (University of Washington), Katherine Moore (University of Washington), Dan Suciu (University of Washington)
  
• Query Expansion Based on Clustered Results
  Ziyang Liu (Arizona State University), Sivaramakrishnan Natarajan (Arizona State University), Yi Chen (ASU)
  
• CoPhy: A Scalable, Portable, and Interactive Index Advisor for Large Workloads
  Debabrata Dash (ArcSight), Neoklis Polyzotis (UC Santa Cruz), Anastasia Ailamaki (Ecole Polytechnique Fédérale de Lausanne (EPFL))
  
• Guided Data Repair
  Mohamed Yakout (Purdue University), Ahmed Elmagarmid (Qatar Computing Research Institute), Jennifer Neville (Purdue University), Mourad Ouzzani (Purdue University), Ihab Ilyas (University of Waterloo)
  
• Using Paxos to Build a Scalable, Consistent, and Highly Available Datastore
  Jun Rao (LinkedIn), Eugene Shekita (IBM Research), Sandeep Tata (IBM Research)
  
• Fast Set Intersection in Memory
  Bolin Ding (UIUC), Arnd Christian König (Microsoft Research)
  
• QSkycube: Efficient Skycube Computation Using Point-Based Space Partitioning
  Jongwuk Lee (POSTECH), Seungwon Hwang (POSTECH)
  
• Hyper-Local, Directions-Based Ranking of Places
  Petros Venetis (Stanford University), Hector Gonzalez (Google Inc), Christian Jensen (Aarhus University), Alon Halevy (Google)
  
• Recovering Semantics of Tables on the Web
  Petros Venetis (Stanford University), Alon Halevy (Google), Jayant Madhavan (Google Inc), Marius Pasca (Google Inc), Warren Shen (Google), Fei Wu (Google Inc), Gengxin Miao (University of California, Santa Barbara), Chung Wu
  
• Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS
  Feng Niu (University of Wisconsin), Christopher Ré (University of Wisconsin-Madison), AnHai Doan (University of Wisconsin), Jude Shavlik (University of Wisconsin-Madison)
  
• Incrementally Maintaining Classification using an RDBMS
  Mehmet Levent Koc (University of Wisconsin-Madison), Christopher Ré (University of Wisconsin-Madison)
  
• High-Throughput Transaction Executions on Graphics Processors
  Bingsheng He (Nanyang Technological University), Jeffrey Xu Yu (Chinese University of Hong Kong)
  
• Distributed Inference and Query Processing for RFID Tracking and Monitoring
  Zhao Cao (University of Massachusetts), Charles Sutton (University of Edinburgh), Yanlei Diao (University of Massachusetts), Prashant Shenoy (University of Massachusetts)
  
• Synthesizing Products for Online Catalogs
  Hoa Nguyen (University of Utah), Ariel Fuxman (Microsoft Research), Stelios Paparizos (Microsoft Research), Juliana Freire (University of Utah), Rakesh Agrawal (Microsoft Research)
  
• On Pruning for Top-K Ranking in Uncertain Databases
  Chonghai Wang (University of Alberta), Li Yan Yuan (University of Alberta), Jia-Huai You (University of Alberta), Osmar Zaiane (), Jian Pei (Simon Fraser University)
  
• ZINC: Efficient Indexing for Skyline Computation
  Bin Liu (National Univ of Singapore), Chee-Yong Chan (National University of Singapore)
  
• SXPath - Extending XPath towards Spatial Querying on Web Documents
  Ermelinda Oro (DEIS-UNICAL, Altilia srl), Massimo Ruffolo (ICAR-CNR, Altilia srl), Steffen Staab (Institute WeST, University of Koblenz-Landau)
  
• Efficient Parallel Lists Intersection and Index Compression Algorithms using Graphics Processing Units
  Naiyong Ao, Fan Zhang (Nankai University), Di Wu, Douglas Stones (Monash University), Gang Wang, Xiaoguang Liu, Jing Liu, Sheng Lin
  
• Personalized Privacy Protection in Social Networks
  mingxuan Yuan (HKUST), Lei Chen (Hong Kong University of Science and Technology, China), Philip Yu (UIC)
  
• PLP: Page Latch-free Shared-everything OLTP
  Ippokratis Pandis (Carnegie Mellon University), Pinar Tozun (EPFL), Ryan Johnson (University of Toronto), Anastasia Ailamaki (Ecole Polytechnique Fédérale de Lausanne (EPFL))
  
• gStore: Answering SPARQL Queries via Subgraph Matching
  Lei Zou (Peking University), Jinhui Mo (Peking University), Lei Chen (Hong Kong University of Science and Technology, China), M. Tamer Özsu (University of Waterloo), Zhao Dongyan ()
  
• Albatross: Lightweight Elasticity in Shared Storage Databases for the Cloud using Live Data Migration
  Sudipto Das (UC Santa Barbara), Shoji Nishimura (NEC Corporation), Divyakant Agrawal (University of California, Santa Barbara), Amr El Abbadi (UC Santa Barbara)
  
• Column-Oriented Storage Techniques for MapReduce
  Avrilia Floratou (University of Wisconsin-Madison), Jignesh Patel (University of Wisconsin-Madison), Eugene Shekita (IBM Research), Sandeep Tata (IBM Research)
  
• Entity Matching: How Similar Is Similar
  Jiannan Wang (Tsinghua University), Guoliang Li (Tsinghua), Jeffrey Xu Yu (Chinese University of Hong Kong), Jianhua Feng
  
• Automatic Optimization for MapReduce Programs
  Eaman Jahani (University of Michigan), Michael Cafarella (University of Michigan), Christopher Ré (University of Wisconsin-Madison)
  
• Active Complex Event Processing over Event Streams
  Di Wang (Worcester Polytechnic Institut), Elke Rundensteiner (Worcester Polytechnic Institute), Richard Ellison III (University of Massachusetts Medical School)
  
• Structural Trend Analysis For Online Social Networks
  Ceren Budak (University of California, Santa Barbara), Divyakant Agrawal (University of California, Santa Barbara), Amr El Abbadi (University of California, Santa Barbara)
  
• Efficiently Compiling Efficient Query Plans for Modern Hardware
  Thomas Neumann (Technische Universität München)
  
• Distance-Constraint Reachability Computation in Uncertain Graphs
  Ruoming Jin (Kent State University), Lin Liu (Kent State University), Bolin Ding (UIUC), Haixun Wang (Microsoft Research Asia)
  
• Compression Aware Physical Database Design
  Hideaki Kimura (Brown University), Vivek Narasayya (Microsoft Research), Manoj Syamala (Microsoft Research)
  
• Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data
  Andreas Züfle (Ludwig-Maximilians-University), Matthias Renz (Ludwig-Maximilians-University), Thomas Bernecker (Ludwig-Maximilians-University), Tobias Emrich (Ludwig-Maximilians-University), Hans-Peter Kriegel (Univ. of Munchen, Germany), Stefan Zankl (Ludwig-Maximilians-University)
  
• iCBS: Incremental Cost-based Scheduling under Piecewise Linear SLAs
  Yun Chi (NEC Laboratories, America), Hyun Moon (NEC Labs America), Hakan Hacigumus (NEC Labs America)
  
• CoHadoop: Flexible Data Placement and Its Exploitation in Hadoop
  Mohamed Eltabakh (IBM), Yuanyuan Tian (IBM Almaden Research), Fatma Ozcan (IBM Almden Research Center), Rainer Gemulla (MPG), Aljoscha Krettek (IBM Germany), John McPherson (IBM Almaden Research Center)
  
• On Social-Temporal Group Query with Acquaintance Constraint
  De-Nian Yang (Academia Sinica), Yi-Ling Chen (National Taiwan University), Wang-Chien Lee (The Penn State University), Ming-Syan Chen (National Taiwan University)
  
• Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores
  Stratos Idreos (CWI), Stefan Manegold (CWI), Harumi Kuno (HP Labs), Goetz Graefe (HP Labs)
  
• Keyword Search in Graphs: Finding r-cliques
  Mehdi Kargar (York University), Aijun An (York University)
  
• Large-Scale Collective Entity Matching
  Vibhor Rastogi (Yahoo! Research), Nilesh Dalvi (Yahoo! ), Minos Garofalakis (Technical University of Crete)
  
• Implementing Performance Competitive Logical Recovery
  David Lomet (Microsoft Research, USA), Kostas Tzoumas (Aalborg University, Denmark), Michael Zwilling (Microsoft)
  
• An Incremental Hausdorff Distance Calculation Algorithm
  Sarana Nutanong (University of Maryland), Edwin Jacox (University of Maryland), Hanan Samet (University of Maryland)
  
• Personalized Social Recommendations - Accurate or Private?
  Ashwin Machanavajjhala (Yahoo! Research), Aleksandra Korolova (Stanford University), Atish Das Sarma (Google)
  
• Efficient Diversification of Web Search Results
  Gabriele Capannini (ISTI CNR), Franco Maria Nardini (ISTI-CNR), Raffaele Perego (ISTI-CNR), Fabrizio Silvestri (ISTI-CNR)
  
• Social content matching in MapReduce
  Gianmarco De Francisci Morales (IMT Lucca), Aristides Gionis (Yahoo! Research), Mauro Sozio
  
• A Framework for Supporting DBMS-like Indexes in the Cloud
  Gang Chen (Zhejiang University), Hoang Tam Vo (School of Computing), Sai Wu (National Univ. of Singapore), Beng Chin Ooi (National University of Singapo), M. Tamer Özsu (University of Waterloo)
  
• On Link-based Similarity Join
  Liwen Sun (University of Hong Kong), Reynold Cheng, Xiang Li (University of Hong Kong), David Cheung (University of Hong Kong), Jiawei Han (UIUC)
  
• On Querying Historical Evolving Graph Sequences
  Chenghui Ren (The University of Hong Kong), Eric Lo (HK Polytechnic University), Ben Kao (The University of Kong Kong), Xinjie Zhu (The University of Kong Kong), Reynold Cheng, Chun Kit Chui (The University of Kong Kong)
  
• RemusDB: Transparent High-Availability for Database Systems
  Umar Farooq Minhas (University of Waterloo), Shriram Rajagopalan (University of British Columbia), Brendan Cully (University of British Columbia), Ashraf Aboulnaga (University of Waterloo), Ken Salem (University of Waterloo), Andrew Warfield (University of British Columbia)
  
• Completeness of Queries over Incomplete Databases
  Simon Razniewski (FU Bozen), Werner Nutt (FU Bozen)
  
• A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application
  Alexios Kotsifakos, Panagiotis Papapetrou (Aalto University), Jaakko Hollmen, Dimitris Gunopulos (University of Athens, Greece)
  
• Approximate Substring Matching over Uncertain Strings
  Tingjian Ge (University of Kentucky), Zheng Li (University of Kentucky)
  
• Serializable Snapshot Isolation for Replicated Databases in High-Update Scenarios
  Hyungsoo Jung (University of Sydney), Hyuck Han (Seoul National Univeristy), Alan Fekete (University of Sydney), Uwe Roehm (University of Sydney)
  
• PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors
  Jason Sewall (Intel Corporation), Jatin Chhugani (Intel Corporation), Changkyu Kim (Intel Corporation), Nadathur Satish (Intel Corporation), Pradeep Dubey (Intel Corporation)
  
• Mining Top-K Large Structural Patterns in a Massive Network
  Feida Zhu (Singapore Management Uni), Qiang Qu (Peking University), David Lo (Singapore Management University), Xifeng Yan (UCSB), Jiawei Han (UIUC), Philip Yu (UIC)
  
• Structure-Aware Sampling: Flexible and Accurate Summarization
  Edith Cohen (AT&T), Graham Cormode (AT&T Labs), Nick Duffield
  
• Data Coordination: Supporting Contingent Updates
  Michael Lawrence (University of British Columbia), Rachel Pottinger (University of British Columbia), Sheryl Staub-French (University of British Columbia)
  
• Accellerating Queries with Group-By and Join by Groupjoin
  Guido Moerkotte (University of Mannheim), Thomas Neumann (Technische Universität München)
  
• Lightweight Graphical Models for Selectivity Estimation Without Independence Assumptions
  Kostas Tzoumas (Aalborg University, Denmark), Amol Deshpande (University of Maryland), Christian Jensen (Aarhus University)
  
• Dissemination of Models over Time-Varying Data
  Yongluan Zhou (University of Southern Denmark), Zografoula Vagena (Rice University), Jonas Haustad (University of Southern Denmark)
  
• Efficient Subgraph Search over Large Uncertain Graphs
  Ye Yuan (College of Information Science and Engineering, Northeastern University, China), Guoren Wang (College of Information Science and Engineering, Northeastern University, China), Haixun Wang (Microsoft Research Asia), Lei Chen (Hong Kong University of Science and Technology, China)
  
• Entangled Transactions
  Nitin Gupta (Cornell University), Milos Nikolic, Sudip Roy, Gabriel Bender, Lucja Kot (Cornell University), Johannes Gehrke (Cornell University), Christoph Koch (Cornell University)
  
• Summary Graphs for Relational Database Schemas
  Cecilia Procopiuc (AT&T Labs-Research), Divesh Srivastava (AT&T Labs), Xiaoyan Yang (National Univ. of Singapore)
  
• RecBench: Benchmarks for Evaluating Performance of Recommender System Architectures
  Justin Levandoski (University of Minnesota), Michael Ekstrand (University of Minnesota), Michael Ludwig (University of Minnesota), Ahmed Eldawy (University of Minnesota), Mohamed Mokbel (University of Minnesota), John Riedl (University of Minnesota)
  
• Business Policy Modeling and Enforcement in Databases
  Ahmed Ataullah (University of Waterloo), Frank Tompa (University of Waterloo)
  
• Online Data Fusion
  Xuan Liu (National Univ. of Singapore), Xin Dong (AT&amp, T Labs), Beng Chin Ooi (National University of Singapo), Divesh Srivastava (AT&T Labs)
  
• Optimistic Concurrency Control by Melding Trees
  Philip Bernstein (Microsoft Corp), Colin Reid (Microsoft Corporation), Ming Wu (Microsoft), Xinhao Yuan (Tsinghua University, Beijing, China)
  
• Linking Temporal Records
  Pei Li (University of Milan - Bicocca), Xin Dong (AT&T Labs), Divesh Srivastava (AT&T Labs), Andrea Maurino (University of Milan - Bicocca)
  
• Efficient Algorithms for Finding Optimal Meeting Point on Road Networks
  Da Yan (HKUST), Zhou Zhao (HKUST), WIlfred Ng (HKSUT)
  
• Optimal Schemes for Robust Web Extraction
  Aditya Parameswaran (Stanford University), Nilesh Dalvi (Yahoo! ), Hector Garcia-Molina (Stanford University), Rajeev Rastogi (Yahoo! India)
  
• PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks
  Yizhou Sun (UIUC), Jiawei Han (UIUC), Xifeng Yan (UCSB), Philip Yu (UIC), Tianyi Wu (Microsoft)
  
• Optimizing Query Answering under Ontological Constraints
  Giorgio Orsi (Oxford University), Andreas Pieris (Oxford University)
  
• OXPath: A Language for Scalable, Memory-efficient Data Extraction from Web Applications
  Tim Furche (Oxford University), Georg Gottlob (Oxford University), Giovanni Grasso (Oxford University), Christian Schallhart (Oxford University), Andrew Sellers (Oxford University)
  
• Optimizing and Parallelizing Ranked Enumeration
  Konstantin Golenberg (The Hebrew University), Benny Kimelfeld (IBM Research - Almaden), Yehoshua Sagiv (Hebrew University, Jerusalem)
  
• Where in the World is My Data?
  Jianjun Chen (Yahoo!), Adam Silberstein (Yahoo), Sudarshan Kadambi (Bloomberg), Brian Cooper (Google), David Lomax (Yahoo!), Raghu Ramakrishnan (Yahoo!), Erwin Tam (Yahoo!), Hector Garcia-Molina (Stanford University)
  
• Queries with Difference on Probabilistic Databases
  Sanjeev Khanna (University of Pennsylvania), Sudeepa Roy (University of Pennsylvania), Val Tannen (University of Pennsylvania)
  
• MRI: Meaningful Interpretations of Collaborative Ratings
  Mahashweta Das (University of Texas at Arlington), Sihem Amer-Yahia (Yahoo Research, USA ), Gautam Das (University of Texas, Arlington), Cong Yu (Google)
  
• Storing Matrices on Disk: Theory and Practice Revisited
  Yi Zhang (Duke University), Kamesh Munagala, Jun Yang (Duke University)
  
• Publishing Set-Valued Data via Differential Privacy
  Rui Chen (Concordia University), Noman Mohammed (Concordia University), Benjamin C. M. Fung (Concordia University), Bipin Desai (Concordia University), LI Xiong
  
• Randomized Generalization for Aggregate Suppression over Hidden Web Databases
  Xin Jin (George Washington U), Nan Zhang (George Washington U), Aditya Mone (UT Arlington), Gautam Das (UT Arlington)
  
• Profiling, What-if Analysis, and Cost-based Optimization of MapReduce Programs
  Herodotos Herodotou (Duke University), Shivnath Babu (Duke University)
  
• Scalable SPARQL Querying of Large RDF Graphs
  Daniel Abadi (Yale University), Kun Ren, Jiewen Huang (Yale University)
  
• Online Aggregation for Large MapReduce Jobs
  Niketan Pansare (Rice U.), Vinayak Borkar (UC Irvine), Chris Jermaine (Rice U.), Tyson Condie (Yahoo Research)
  
• Private Analysis of Graph Structure
  Vishesh Karwa (Pennsylvania State University), Sofya Raskhodnikova (Pennsylvania State University), Adam Smith (Pennsylvania State University), Grigory Yaroslavtsev (Pennsylvania State University)
  
• Stratification criteria and rewriting techniques for checking chase termination
  Sergio Greco (Università della Calabria), Francesca Spezzano (Università della Calabria), Irina Trubitsyna (Università della Calabria)
  
• Optimizing Probabilistic Query Processing on Continuous Uncertain Data
  Liping Peng (UMass Amherst), Yanlei Diao (University of Massachusetts), Anna Liu (UMass Amherst)
  
• Massive scale-out of expensive continuous queries
  Erik Zeitler (Uppsala University), Tore Risch (Uppsala University)
  
• Keyword Search on Form Results
  Aditya Ramesh (Stanford University), S. Sudarshan (IIT Bombay), Purva Joshi (IIT Bombay)
  
• Efficient Rank Join with Aggregation Constraints
  Min Xie (University of British Columbia), Laks Lakshmanan (University of British Columbia), Peter Wood (Birkbeck, University of London)
  
• Surrogate Parenthood: Protected and Informative Graphs
  Barbara Blaustein (MITRE), Adriane Chapman (MITRE), Len Seligman (MITRE), M. David Allen (MITRE), Arnon Rosenthal (MITRE)