Renaissance Arlington Capital View Hotel
2800 South Potomac Ave, Arlington, Virginia 22202
April 1-5 2012
*****Accepted Papers for Research Paper Track*****
The annual ICDE conference addresses research issues in designing, building, managing, and evaluating advanced data-intensive systems and applications. It is a leading forum for researchers, practitioners, developers, and users to explore cutting-edge ideas and to exchange techniques, tools, and experiences. We invite the submission of original research contributions and industrial papers, as well as proposals for workshops, panels, tutorials, and demonstrations.
ICDE 2012 will be held in Washington, DC, USA, April 1-5, 2012. Washington DC is the nation’s capital of USA. Washington DC is a perfect spot to ring in Spring, with famous and beautiful cherry blossoms, and is a cosmopolitan city brimming with a unique American history. The conference will be held at Renaissance Arlington Capital View Hotel near the Regan National Airport.
***********************************************
We are pleased to announce 85 papers accepted for full presentation and 15 papers accepted for short presentation in the Research Paper Track.
PROGRAM CHAIRS
Johannes Gehrke (Cornell University)
Beng Chin Ooi (National University of Singapore)
Evaggelia Pitoura (University of Ioannina, Greece)
***********************************************
Papers accepted for full presentation
2. Searching Uncertain Data Represented by Non-Axis Parallel Gaussian Mixture Models
Katrin Haegler (University of Munich)
Frank Fiedler (University of Munich)
Christian Boehm (University of Munich)
18. Answering why-not questions on Top-k queries
Zhian He (HongKong Polytechnic University), Eric Lo (Hong Kong Polytechnic University)
24. Multi-Version Concurrency via Timestamp Range Conflict Management
Lomet David (Microsoft Research)
Alan Fekete (Univ. of Sidney)
Rui Wang (Microsoft Research)
Peter Ward (University of Sydney)
25. Iterative Graph Feature Mining for Graph Indexing
DAYU YUAN (Penn State University)
Prasenjit Mitra
Huiwen Yu
C Lee Giles (Penn State)
26. Cross Domain Search by Exploiting Wikipedia
Chen Liu (School of Computing, NUS)
Sai Wu (National U of Singapore)
Shouxu Jiang (Harbin Institute of Technology)
Anthony Tung (National University of Singapore)
60. Aggregate Query Answering on Possibilistic Data with Cardinality Constraints
Graham Cormode (AT&T)
Entong Shen (North Carolina State Univ)
Divesh Srivastava (AT&T)
Ting Yu (North Carolina State University)
61. Differentially Private Spatial Decompositions
Graham Cormode ()AT&T)
Cecilia Procopiuc (AT&T Research Labs)
Entong Shen (North Carolina State Univ)
Divesh Srivastava (AT&T)
Ting Yu (North Carolina State University)
74. L everaging P2P Structure for Large-scale Data Processing
Gang Chen (Zhejiang University)
Tianlei Hu (Zhejiang University)
Dawei Jiang (National University of Singapore)
Peng Lu (National University of Singapore)
Kian-Lee Tan (National University of Singapore)
Hoang Tam Vo (National University of Singapore)
Sai Wu (National U of Singapore)
82. Effective Data Density Estimation in Ring-based P2P Networks
Minqi Zhou (East China Normal University)
Heng Tao Shen (University of Queensland)
Xiaofang Zhou (University of Queensland)
Weining Qian (East China Normal University)
Aoying Zhou (East China Normal University)
87. A Self-Configuring Schema Matching System
Eric Peukert (SAP Research Dresden)
Julian Eberius (TU Dresden)
Erhard Rahm (Univ. of Leipzig)
99. Efficient Similarity Search over Encrypted Data
Mehmet Kuzu (University of Texas at Dallas)
Mohammad Saiful Islam (University of Texas at Dallas)
Murat Kantarcioglu (University of Texas at Dallas)
104. Mapping XML to a Wide Sparse Table
Liang Jeff Chen (UCSD)
Philip Bernstein (Microsoft)
Peter Carlin ()
Dimitrije Filipovic ()
Michael Rys ()
Nikita Shamgunov (Facebook)
James Terwilliger ()
Milos Todic ()
Sasa Tomasevic ()
Dragan Tomic (Microsoft)
105. Physically Independent Stream Merging
Badrish Chandramouli (Microsoft Research)
David Maier (Portland State University)
Jonathan Goldstein (Microsoft Corporation)
106. Lookup Tables: Fine-Grained Partitioning for Distributed Databases
Aubrey Tatarowicz (MIT)
Evan Jones (MIT)
Carlo Curino (MIT)
Madden Samuel ()
121. Effective and Robust Pruning for Top-Down Join Enumeration Algorithms
Pit Fender (University of Mannheim)
Guido Moerkotte (University of Mannheim)
Thomas Neumann (Technische Universität München) <
Viktor Leis (Technical University of Munich)
140. An Efficient Graph Indexing Method
Xiaoli Wang (NUS)
Xiaofeng Ding (HUST)
Anthony Tung (National University of Singapore)
Shanshan Ying (National University of Singapore)
Hai Jin (HUST)
141. An Efficient Trie-based Method for Approximate Entity Extraction with Edit-Distance Constraints
Dong Deng (Tsinghua University)
Guoliang Li (Tsinghua University)
Jianhua Feng (Tsinghua University)
147. Correlation Support for Risk Evaluation in Databases
Katrin Eisenreich (SAP AG)
Jochen Adamek (TU Berlin)
Philipp Rösch (SAP Research)
Volker Markl (TU Berlin)
Gregor Hackenbroich (SAP Research)
156. Towards Preference-aware Relational Databases
Anastasios Arvanitis (NTUA)
Georgia Koutrika (IBM Almaden Research Center)
159. Multidimensional Analysis of Atypical Events in Cyber-Physical Data
Lu-An Tang (UIUC)
Xiao Yu (UIUC)
Sangkyum Kim (UIUC)
Jiawei Han (UIUC)
Wen-Chih Peng (National Chiao Tung University, Taiwan) <wcpeng@cs.nctu.edu.tw>
Yizhou Sun (UIUC)
Hector Gonzalez (Google)
Sebastian Seith (Morningstar Inc.)
163. On Discovery of Traveling Companions from Streaming Trajectories
Lu-An Tang (UIUC)
Yu Zheng (Microsoft Research Asia)
Jing Yuan (Microsoft)
Jiawei Han (University of Illinois)
Alice Leung (BBN)
Chih-Chieh Hung (NCTU)
Wen-Chih Peng ( National Chiao Tung University, Taiwan)
179. Extracting Analyzing and Visualizing Triangle K-Core Motifs within Networks
Yang Zhang (Ohio State Univ.)
Srinivasan Parthasarathy (Ohio State Univ.)
183. Provenance-based Indexing Support in Micro-blog Platforms
Junjie Yao (Peking University)
Bin CUI (Peking University)
Zijun Xue ()
Qingyun Liu ()
184. Scalable Multi-Query Optimization for SPARQL
Wangchao Le (University of Utah)
Anastasios Kementsietsidis (IBM)
Songyun Duan (IBM T.J. Watson Research Center)
Feifei Li ()
185. Relevance Matters: Capitalizing on Less (Top-k Matching in Publish/Subscribe)
Mohammad Sadoghi (University of Toronto)
Hans-Arno Jacobsen (University of Toronto)
203. Reducing Uncertainty of Low-Sampling-Rate Trajectories
Kai Zheng (Univ. of Queensland)
Yu Zheng (Microsoft Research Asia)
Xing Xie ()
Xiaofang Zhou (Univ. of Queensland)
215. A Foundation for Efficient Indoor Distance-Aware Query Processing
Hua Lu ()
Xin Cao ()
Christian S. Jensen ()
229. Parameter-Free Determination of Distance Thresholds for Metric Distance Constraints
Shaoxu Song (Tsinghua University)
Lei Chen ()
Hong Cheng (Chinese University of Hong Kong)
235. Differentially Private Histogram Publication
Jia Xu (Northeastern University,China)
Zhenjie Zhang (Advanced Digital Sciences Center)
Xiaokui Xiao (Nanyang Technological University)
Yin Yang (Advanced Digital Sciences Center Illinois at Singapore Pte.)
Ge Yu ()
239. PRAGUE: Towards Blending Practical Visual Subgraph Query Formulation and Query Processing
Changjiu Jin (Nanyang Technological University)
Sourav S Bhowmick (Nanyang Technological Univ)
Byron Choi (Hong Kong Baptist University)
Shuigeng Zhou (Fudan University)
246. Discovering Threshold-based Frequent Closed Itemsets over Probabilistic Data
Yongxin Tong (HKUST)
Lei Chen ()
Bolin Ding (University of Illinois at Urbana-Champaign)
261. Optimization of Massive Pattern Queries by Dynamic Configuration Morphing
Nikolay Laptev (UCLA)
Carlo Zaniolo (UCLA)
262. Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
Miao Qiao (The Chinese Univ. of Hong Kong)
Hong Cheng (Chinese University of Hong Kong)
Lijun Chang (The Chinese Univ. of Hong Kong)
Jeffrey Yu (Chinese University of Hong Kong)
274. LARS: A Location-Aware Recommender System
Justin Levandoski (University of Minnesota)
Mohamed Sarwat (University Of Minnesota)
Ahmed Eldawy (University of Minnesota)
Mohamed F. Mokbel ()
281. Temporal Analytics on Big Data for Web Advertising
Badrish Chandramouli (Microsoft Research)
Jonathan Goldstein (Microsoft Corporation)
Songyun Duan (IBM T.J. Watson Research Center)
283. Accelerating Range Queries For Brain Simulations
Farhan Tauheed ()
Laurynas Biveinis (Aalborg University)
Thomas Heinis (EPFL)
Felix Schuermann (EPFL)
Henry Markram (EPFL)
Anastasia Ailamaki ()
286. Parametric Plan Caching Using Density-Based Clustering
Gunes Aluc (University of Waterloo)
David DeHaan (Sybase iAnywhere)
Ivan Bowman (Sybase, an SAP Company)
301. Optimizing Statistical Information Extraction Programs Over Evolving Text
Fei Chen (HP Labs China)
Xixuan Feng ()
Christopher Re ()
Min Wang (HP Labs China)
308. Ranking Query Results in Probabilistic Databases: Complexity and Efficient Algorithms
Dan Olteanu ()
Hongkai Wen (University of Oxford)
309. A General Method for Estimating Correlated Aggregates over a Data Stream
Srikanta Tirthapura (Iowa State University)
David Woodruff (IBM Almaden)
316. Learning-based Query Performance Modeling and Prediction
Mert Akdere (Brown University)
Ugur Cetintemel ()
Matteo Riondato (Brown University)
Eli Upfal (Brown University)
Stanley Zdonik (Brown University)
319. Querying XML Data: As You Shape It
Dyreson Curtis ()
Sourav S Bhowmick (Nanyang Technological Univ)
327. Fuzzy Joins Using MapReduce
Foto Afrati (NTUA)
Anish Das Sarma (Google Research)
David Menestrina (Google)
Aditya Parameswaran (Stanford University)
Jeffrey Ullman (Stanford Univ.)
332. Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach
Chong Sun (UW-Madison)
Jeffrey Naughton (University of Wisconsin -- Madison)
Siddharth Barman (UW-Madison)
340. CI-Rank: Ranking Keyword Search Results Based on Collective Importance
Xiaohui Yu (York University)
Huxia Shi ()
344. Temporal Support for Persistent Stored Modules
Richard Snodgrass (University of Arizona)
Dengfeng Gao (IBM Silicon Valley Lab)
Rui Zhang (University of Arizona)
Stephen Thomas (Queen's University)
348. Branch Code: A Labeling Scheme for Efficient Query Answering on Trees
Yanghua Xiao (Fudan University)
Ji Hong ()
Wanyun Cui (Fudan University)
zhenying He ()
Wei Wang ()
Guodong Feng (Fudan University)
351. Incorporating Duration Information for Trajectory Classification
Dhaval Patel (NUS)
Chang Sheng (Development Bank of Singapore)
Wynne Hsu (National University of Singapore)
Mong Li Lee (National University of Singapore)
360. GSLPI: a Cost-based Query Progress Indicator
Jiexing Li (University of Wisconsin)
Rimma Nehme (Microsoft Jim Gray Systems Lab)
Jeffrey Naughton (University of Wisconsin -- Madison)
363. Fast SLCA and ELCA Computation for XML Keyword Queries based on Set Intersection
Junfeng Zhou (Yanshan University)
Zhifeng Bao (NUS)
Wei Wang ()
Tok Wang Ling (NUS)
Ziyang Chen ()
Xudong Lin ()
Jingfeng Guo ()
364. Keyword Query Reformulation on Structured Data
Junjie Yao (Peking University)
Bin CUI (Peking University)
Liansheng Hua (pku)
Yuxin huang (PKU)
369. Community Detection with Edge Content in Social Media Networks
Guo-Jun Qi (UIUC)
Charu Aggarwal (IBM)
Thomas Huang ()
374. A Game-Theoretic Approach for High-Assurance of Data Trustworthiness in Sensor Networks
Hyo-Sang Lim (Purdue University)
Gabriel Ghinita (Purdue University)
Elisa Bertino ()
Murat Kantarcioglu ()
378. Efficient Exact Similarity Searches using Multiple Token Orderings
Jongik Kim (Chonbuk National University)
Hongrae Lee (Google Inc.)
389. Attribute-Based Subsequence Matching and Mining
Yu Peng (HKUST)
Raymond Chi-Wing Wong (HKUST)
Liangliang Ye (HKUST)
Philip Yu (UIC)
399. Incremental Detection of Inconsistencies in Distributed Data
Wenfei Fan (University of Edinburgh)
Jianzhong Li ()
Nan Tang (University of Edinburgh)
Wenyuan Yu ()
407. Random Error Reduction in Similarity Search on Time Series: A Statistical Approach
Wush Chi-Hsuan Wu (Academia Sinica)
Mi-Yen Yeh (Institute of Information Science, Academia Sinica)
Jian Pei () jpei@cs.sfu.ca
417. Entity Search Strategies for Mashup Applications
Stefan Endrullis (University of Leipzig)
Andreas Thor (University of Leipzig)
Erhard Rahm (Univ. of Leipzig)
418. Detecting Outliers in Sensor Networks using the Geometric Approach
Sabbas Burdakis (Technical University of Crete)
Antonios Deligiannakis ()
412. Predicting Approximate Protein-DNA Binding Cores Using Association Rule Mining
Po-Yuen Wong (CSE, CUHK, Hong Kong)
Tak-Ming Chan ()
Man-Hon Wong ()
Kwong-Sak Leung ()
431. Parallel Top-K Similarity Join Algorithms Using MapReduce
Younghoon Kim (Seoul National University)
Kyuseok Shim ()
432. HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
Fabian Keller (Karlsruhe Institute of Technol)
Emmanuel Müller (Karlsruhe Institute of Technology (K)
Klemens Böhm (Karlsruhe Institute of Technology (KIT)
435. Efficiently Monitoring Top-k Pairs over Sliding Windows
Zhitao Shen (UNSW)
Muhammad Cheema (UNSW, Australia)
Xuemin Lin (UNSW)
Wenjie Zhang (UNSW)
Haixun Wang ()
438. Automatic Extraction of Structured Web Data with Domain Knowledge
Nora Derouiche (Télécom ParisTech) <nor
Bogdan Cautis (Télécom ParisTech)
Talel Abdessalem (Telecom ParisTech)
441. Efficient Graph Similarity Joins with Edit Distance Constraints
Xiang Zhao (University of New South Wales)
Chuan Xiao (UNSW)
Xuemin Lin (UNSW)
Wei Wang ()
453. Upgrading Uncompetitive Products Economically
Hua Lu ()
Christian S. Jensen ()
459. Desks: Direction-Aware Spatial Keyword Search
Guoliang Li (Tsinghua University)
Jianhua Feng (Tsinghua University)
Jing Xu (Tsinghua University)
462. Querying Uncertain Spatio-Temporal Data
Andreas Züfle (LMU München)
Tobias Emrich (LMU München)
Renz Matthias ()
Nikos Mamoulis (University of Hong Kong)
Hans-Peter Kriegel (LMU Munich)
480. Privacy-Preserving and Content-Protecting Location Based Queries
Russell Paulet (Victoria University)
Md. Golam Koasar (Victoria University)
Xun Yi (Victoria University)
Elisa Bertino ()
484. Accuracy-Aware Uncertain Stream Databases
Tingjian Ge ()
Fujun Liu (University of Kentucky)
492. GeoFeed: A Location Aware News Feed System
Jie Bao (University of Minnesota)
Mohamed F. Mokbel ()
Chi-Yin Chow (City University of Hong Kong)
495. SWST: A Disk Based Index for Sliding Window Spatio-Temporal Data
Manish Singh (University of Michigan)
Hosagrahar V Jagadish (University of Michigan)
Qiang Zhu (University of Michigan)
501. Privacy in Social Networks: How Risky is Your Social Graph?
Cuneyt Akcora (University of Insubria)
Barbara Carminati (University of Insubria, Italy)
Elena Ferrari (Università degli Studi dell'Insubria, Italy)
524. Towards Multi-Tenant Performance SLOs
Willis Lang (University of Wisconsin)
Srinath Shankar (Microsoft Corp)
Jignesh Patel (University of Wisconsin - Madison)
Ajay Kalhan (Microsoft Corp)
527. Efficient Versioning for Scientific Array Databases
Adam Seering (MIT)
Philippe Cudre-Mauroux (MIT)
Madden Samuel ()
Michael Stonebraker (MIT)
539. Extending Map-Reduce for Efficient Predicate-Based Sampling
Raman Grover (UC Irvine)
Michael Carey (UC Irvine)
540. Discovering Conservation Rules
Lukasz Golab (University of Waterloo)
Howard Karloff (AT&T Labs - Research)
Flip Korn ()
Barna Saha (U. of Maryland)
Divesh Srivastava ()
558. Recomputing Materialized Instances after Changes to Mappings and Data
Todd Green (U. of California, Davis)
Zachary Ives (University of Pennsylvania)
562. Processing of Rank Joins in Highly Distributed Systems
Christos Doulkeridis (NTNU)
Akrivi Vlachou (NTNU)
Kjetil Nørvåg (NTNU)
Yannis Kotidis (AUEB)
Neoklis Polyzotis ()
566. On Top-k Structural Similarity Search
i Lee (UBC)
Laks V.S. Lakshmanan (UBC)
Jeffrey Yu (Chinese University of Hong Kong)
567. Micro-Specialization in DBMSes
Rui Zhang (The University of Arizona)
Richard Snodgrass (University of Arizona)
Saumya Debray (The University of Arizona)
576. On Text Clustering with Side Information
Charu Aggarwal (IBM)
Yuchen Zhao (UIC)
Philip Yu (UIC)
580. Three-level Processing of Multiple Aggregate Continuous Queries
Shenoda Guirguis (University of Pittsburgh)
Mohamed Sharaf (The University of Queensland)
Panos Chrysanthis (University of Pittsburgh)
Alexandros Labrinidis (University of Pittsburgh)
588. Ego-centric Graph Pattern Census
Walaa Eldin Moustafa (University of Maryland)
Amol Deshpande (University of Maryland)
Lise Getoor ()
644. Joint Entity Resolution
Steven Whang (Stanford University)
Hector Garcia-Molina (Stanford)
Papers accepted for short presentation
173. Efficient Threshold Monitoring for Distributed Probabilistic Data
Mingwang Tang (University of Utah)
Feifei Li ()
Jeff Phillips (University of Utah)
Jeffrey Jestes (School of Computing, University of Utah)
194. Bi-level Locality Sensitive Hashing for K-Nearest Neighbor Computation
Jia Pan (UNC Chapel Hill)
Dinesh Manocha (UNC Chapel Hill)
330: Processing and Notifying Range Top-k Subscriptions
Albert Yu (Duke University)
Jun Yang ()
Pankaj Agarwal (Duke University)
534. Stochastic Information Flow in Networks
Luke Dickens (Imperial College London)
Ian Molloy (IBM)
Jorge Lobo (IBM)
Pau-Chen Cheng (IBM)
Alessandra Russo (Imperial College London)
615. ISOBAR Preconditioner for Effective and High-throughput Lossless Data Compression
Eric Schendel (North Carolina State Univ.)
Ye Jin (NCSU)
Neil Shah ()
Jackie Chen (Sandia National Laboratory, Livermore)
C.S. Chang (New York University, New York, NY)
Seung-Hoe Ku ()
Stephane Ethier ()
Scott Klasky (Oak Ridge National Laboratory, Oak Ridge)
Robert Latham ()
Robert Ross (Argonne National Laboratory, Argonne)
Nagiza Samatova (North Carolina State Univ.)
57. Evaluating Probabilistic Queries over Uncertain Matching
Reynold Cheng (University of Hong Kong)
Jian Gong (The University of HongKong)
David W. Cheung (The University of Hong Kong)
Jiefeng Cheng (The University of Hong Kong)
84. Adaptive Windows for Duplicate Detection
Uwe Draisbach (Hasso-Plattner-Institute)
Felix Naumann (HPI)
Sascha Sascha Szott (Zuse Institute)
Oliver Wonneberg ()
88. Load Balancing for MapReduce-based Entity Resolution
Lars Kolb (University of Leipzig)
Andreas Thor (University of Leipzig)
Erhard Rahm (Univ. of Leipzig)
212. Obfuscating the Topical Intention in Enterprise Text Search
HweeHwa Pang (Singapore Management Universit)
Xiaokui Xiao (Nanyang Technological University)
Jialie Shen ()
218. The Min-dist Location Selection Query
Jianzhong Qi (University of Melbourne)
Rui Zhang ()
Lars Kulik (University of Melbourne)
Dan Lin (Missouri University of Science and Technology)
Yuan Xue (University of Melbourne)
234. Energy Efficient Storage Management Cooperated with Large Data Intensive Applications
Norifumi Nishikawa (The University of Tokyo)
Miyuki Nakano (The University of Tokyo)
Masaru Kitsuregawa (The University of Tokio)
289. Load Balancing in MapReduce Based on Scalable Cardinality Estimates
Benjamin Gufler (TU München)
Nikolaus Augsten (Free University of Bolzano-Bozen)
Angelika Reiser (TU München)
Alfons Kemper (TU München)
314. Integrating Frequent Pattern Mining from Multiple Data Domains for Classification
Dhaval Patel (NUS)
Wynne Hsu (National University of Singapore)
Mong Li Lee (National University of Singapore)
358. Efficient Dual-Resolution Layer Indexing for Top-k Queries
Jongwuk Lee (POSTECH)
Hyunsouk Cho (POSTECH)
Seung-won Hwang ()
616. Horizontal Reduction: Instance-Level Dimensionality Reduction for Similarity Search in Large Document Databases
Min Soo Kim (KAIST)
Kyu-Young Whang ()
Yang-Sae Moon (Kangwon National University)