ACM SIGMOD City, Country, Year
sigmod pods logo

SIGMOD 2013: Accepted Research Papers

  • Cumulon: Optimizing Statistical Data Analysis in the Cloud
    Botong Huang, Duke University; Shivnath Babu, Duke University; Jun Yang, Duke University
  • Shark: SQL and Rich Analytics at Scale
    Reynold S Xin, UC Berkeley; Josh Rosen, UC Berkeley; Matei Zaharia, UC Berkeley; Michael J Franklin, UC Berkeley; Scott Shenker, UC Berkeley; Ion Stoica, UC Berkeley
  • Parallel Analytics as a Service 
    Petrie Wong, The Hong Kong Polytechnic University; Zhian He, The Hong Kong Polytechnic University; Eric Lo, The Hong Kong Polytechnic University
  • MESSIAH: Missing Element-Conscious SLCA Nodes Search in XML Data 
    Ba Quan Truong, Nanyang Technological University; Sourav S Bhowmick, Nanyang Technological University; Curtis Dyreson, Utah State University; Aixin Sun, Nanyang Technological University
  • Indexing for Subtree Similarity-Search using Edit Distance
    Sara Cohen, The Hebrew University of Jerusalem
  • Discovering XSD Keys from XML Data
    Marcelo Arenas, PUC Chile & University of Oxford; Jonny Daenen, Hasselt University & Transnational University of Limburg; Frank Neven, Hasselt University & Transnational University of Limburg; Martin Ugarte,PUC Chile; Jan Van den Bussche, Hasselt University & Transnational University of Limburg; Stijn Vansummeren Université Libre de Bruxelles (ULB)
  • A Scalable Lock Manager for Multicores 
    Hyungsoo Jung, NICTA; Hyuck Han, Samsung Electronics; Alan Fekete, University of Sdyney; Gernot Heiser, NICTA and UNSW; Heon Yeom, Seoul National University
  • Controlled Lock Violation 
    Goetz Graefe, Hewlett-Packard Laboratories; Mark Lillibridge, Hewlett-Packard Laboratories; Harumi Kuno, Hewlett-Packard Laboratories; Joseph Tucek, HewlettPackard Laboratories; Alistair Veitch, Hewlett-Packard Laboratories
  • X-FTL: Transactional FTL for SQLite Databases
    Woon-Hak Kang, Sungkyunkwan University; Sang-Won Lee, Sungkyunkwan University; Bongki Moon, Seoul National University; Gi-Hwan Oh, Sungkyunkwan University; Changwoo Min, Sungkyunkwan University
  • Optimal Splitters for Temporal and Multi-version Databases 
    Wangchao Le, University of Utah; Feifei Li, University of Utah; Yufei Tao, CUHK; Robert Christensen, University of Utah
  • Building an Efficient RDF Store Over a Relational Database 
    Mihaela A Bornea, IBM Research; Julian Dolby, IBM Research; Anastasios    Kementsietsidis, IBM Research; Kavitha Srinivas, IBM Research; Patrick Dantressangle, IBM Software Group; Octavian Udrea, IBM Research; Bishwaranjan Bhattacharjee, IBM Research 
  • Automatic Synthesis of Out-of-Core Algorithms 
    Yannis Klonatos, EPFL; Andres Nötzli EPFL; Andrej Spielmann, EPFL; Christoph Koch, EPFL; Viktor Kuncak, EPFL
  • InfoGather+: Semantic Matching and Annotation of Numeric and Time-Varying Attributes in Web Tables
    Meihui Zhang, NUS; Kaushik Chakrabarti, Microsoft Research
  • Value Invention in Data Exchange 
    Patricia Arocena, University of Toronto; Boris Glavic, Illinois Institute of Technology; Renee Miller, University of Toronto
  • Indexing Methods for Moving Object Databases: Games and Other Applications
    Hanan Samet, University of Maryland; Jagan Sankaranarayanan, NEC Labs America; Michael Auerbach, University of Maryland, College Park
  • I/O Efficient: Computing SCCs in Massive Graphs  
    Zhiwei Zhang, Chinese University of HK; Jeffrey Xu Yu, Chinese University of HK; Lu Qin, Chinese University of HK; Lijun Chang, CUHK; Xuemin Lin, The University of New South Wales
  • TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph 
    James Cheng, Chinese University of HK; Silu Huang, Chinese University of HK; Huanhuan Wu, Chinese University of HK; Ada Fu, Chinese University of Hong Kong
  • Efficiently Computing k-Edge Connected Components via Graph Decomposition 
    Lijun Chang, East China Normal University, University of New South Wales; Jeffrey Yu, Chinese University of HK; Lu Qin, Chinese University of HK; Xuemin Lin, UNSW; Chengfei Liu, Swinburne University of Technology; Weifa Liang, Australian National University
  • An Online Cost Sensitive Decision-Making Method in Crowdsourcing Systems
    Jinyang Gao, National Univ. of Singapore; Xuan Liu, National Univ. of Singapore; Beng Chin Ooi, National Univ. of Singapore; Haixun Wang, Microsoft Research Asia; Gang Chen, Zhejiang University
  • Leveraging Transitive Relations for Crowdsourced Joins
    Jiannan Wang, Tsinghua University; Guoliang Li, Tsinghua University; Tim Kraska, Brown University; Michael Franklin, AMPLab, UC Berkeley; Jianhua Feng, Tsinghua University
  • Crowd Mining 
    Yael Amsterdamer, Tel Aviv University; Yael Grossman, Tel Aviv University; Tova Milo, Tel Aviv University; Pierre Senellart, Télécom ParisTech
  • Efficient Sentiment Correlation for Large-scale Demographics 
    Mikalai Tsytsarau, University of Trento; Sihem Amer-Yahia, Laboratoire d'Informatique de Grenoble; Themis Palpanas, University of Trento
  • EBM - An Entropy-Based Model to Infer Social Strength from Spatiotemporal Data 
    Huy Pham, USC; Cyrus Shahabi, USC; Yan Liu, USC
  • Online Search of Overlapping Communities
    Wanyun Cui, Fudan University; Yanghua Xiao, Fudan University; Haixun Wang, Microsoft Research Asia; Yiqi Lu, Fudan University; Wei Wang, Fudan University
  • BitWeaving: Fast Scans for Main Memory Data Processing 
    Yinan Li, Univ. of Wisconsin-Madison; Jignesh M. Patel, University of Wisconsin-Madison
  • Performance and Resource Modeling in Highly-Concurrent OLTP Workloads 
    Barzan Mozafari, MIT; Carlo Curino, Microsoft; Alekh Jindal, MIT, MIT; Samuel Madden, MIT
  • ODYS: An Approach to Building a Massively-Parallel Search Engine Using a DB-IR Tightly-Integrated Parallel DBMS for Higher-Level Functionality
    Kyu-Young Whang, KAIST; Tae-Seob Yun, KAIST; Yeon-Mi Yeo, KAIST; Il-Yeol Song, Drexel University; Hyuk-Yoon Kwon, KAIST; In-Joong Kim, KAIST
  • Massive Graph Triangulation
    Xiaocheng Hu, CUHK; Yufei Tao, CUHK; Chin-Wan Chung, KAIST 
  • TurboISO: Towards Ultrafast and Robust Subgraph Isomorphism Search in Large Graph Databases 
    Wook-Shin Han, Kyungpook National University; Jinsoo Lee, Kyungpook National University; Jeong-Hoon Lee, Kyungpook National University 
  • Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling 
    Takuya Akiba, University of Tokyo; Yoichi Iwata, The University of Tokyo; Yuichi Yoshida, National Institute of Informatics & Preferred Infrastructure, Inc.
  • Improving Regular-Expression Matching on Strings Using Negative Factors
    Xiaochun Yang, Northeastern University; Bin Wang, Northeastern University; Tao Qiu, Northeastern University; Yaoshu Wang, Northeastern University; Chen Li, UC Irvine
  • String Similarity Measures and Joins with Synonyms 
    Jiaheng Lu, Renmin University of China; Chunbin Lin, Renmin University of China; Wei Wang, University of New South Wales; Chen Li, University of California, Irvine; Haiyong Wang, Renmin University of China
  • Efficient Top-k Algorithms for Approximate Substring Matching 
    Younghoon Kim, Seoul National University; Kyuseok Shim, Seoul National University
  • Towards High-Throughput Gibbs Sampling at Scale: A Study across Storage Managers 
    Ce Zhang, University of Wisconsin-Madison; Christopher Re, University of Wisconsin Madison
  • Latch-Free Data Structures for DBMS 
    Takashi Horikawa, NEC Corporation 
  • DBMS Metrology: Measuring Query Time 
    Sabah Currim, University of Arizona; Richard T. Snodgrass, University of Arizona; Young-Kyoon Suh, University of Arizona; Rui Zhang, Teradata Corporation; Matthew Wong Johnson, UCSD; Cheng Yi, University of Arizona
  • Quality and Efficiency for Kernel Density Estimates in Large Data  
    Yan Zheng, University of Utah; Jeffrey Jestes, University of Utah; Jeff M. Phillips, University of Utah; Feifei Li, University of Utah
  • Efficient Ad-hoc Search for Personalized PageRank 
    Yasuhiro Fujiwara, NTT; Makoto Nakatsuji, NTT; Hiroaki Shiokawa, NTT; Takeshi Mishima, NTT; Makoto Onizuka, NTT 
  • Provenance-based Dictionary Refinement in Information Extraction
    Sudeepa Roy, University of Washington; Laura Chiticariu, IBM Research, Almaden; Vitaly Feldman, IBM Research, Almaden; Frederick R. Reiss, IBM Research, Almaden; Huaiyu Zhu, IBM Research, Almaden
  • CS2: A New Database Synopsis for Query Estimation 
    Feng Yu, Southern Illinois University; Wen-Chi Hou, Southern Illinois University; Cheng    Luo, Coppin State University; Dunren Che, Southern Illinois University; Mengxia Zhu, Southern Illinois University 
  • Branch-and-Bound Algorithm for Reverse Top-k Queries 
    Akrivi Vlachou, Norwegian University of Science and Technology (NTNU); Christos Doulkeridis, University of Piraeus; Kjetil Nørvåg, NTNU; Yannis Kotidis, Athens University of Economics and Business (AUEB)
  • On the Correct and Complete Enumeration of the Core Search Space 
    Guido Moerkotte, University of Mannheim; Pit Fender, University of Mannheim; Marius Eich, University of Mannheim
  • Trinity: A Distributed Graph Engine on a Memory Cloud 
    Bin Shao, Microsoft Research; Haixun Wang, Microsoft Research Asia; Yatao Li, HKUST  
  • Characterizing Tenant Behavior for Placement and Crisis Mitigation in Multitenant DBMSs 
    Aaron J. Elmore, UC Santa Barbara; Sudipto Das, Microsoft Research; Alexander Pucher, UCSB; Divyakant Agrawal, UCSB; Amr El Abbadi, UCSB; Xifeng Yan, UCSB
  • Minimal MapReduce Algorithms 
    Yufei Tao, CUHK; Wenqing Lin, Nanyang Technological University; Xiaokui Xiao, Nanyang Technological University
  • NADEEF: A Commodity Data Cleaning System
    Michele Dallachiesa, University of Trento; Amr Ebaid, Purdue Universify; Ahmed Eldawy, University of Minnesota; Ahmed Elmagarmid, QCRI; Ihab F. Ilyas, Qatar Computing Research Institute; Mourad Ouzzani, Qatar Computing Res. Inst.; Nan Tang, QCRI 
  • Don't be SCAREd: Use SCalable Automatic REpairing with Maximal Likelihood and Bounded Changes 
    Mohamed Yakout, Microsoft Corp.; Laure Berti-Equille, Institut de Recherche pour le Développement; Ahmed Elmagarmid, QCRI 
  • Determining the Relative Accuracy of Attributes 
    Yang Cao, Beihang University; Wenfei Fan, University of Edinburgh; Wenyuan Yu, University of Edinburgh
  • Photon: Fault-tolerant and Scalable Joining of Continuous Data Streams
    Rajagopal Ananthanarayanan, Google; Venkatesh Basker, Google; Sumit Das, Google; Ashish Gupta, Google; Haifeng Jiang, Google; Tianhao Qiu, Google; Alexey Reznichenko, Max Planck Institute for Software Systems; Deomid Ryabkov, Google; Manpreet Singh, Google; Shivakumar Venkataraman, Google  
  • Utility-Maximizing Event Stream Suppression 
    Di Wang, Worcester Polytechnic Institut; Yeye He, Microsoft; Elke Rundensteiner, Worcester Polytechnic Institute; Jefferey F. Naughton University of Wisconsin-Madison
  • E-Matching: Event Processing over Noisy Sequences in Real Time 
    Zheng Li, University of Massachusetts, Lowell; Tingjian Ge, Univ. of Massachusetts, Lowell; Cindy X. Chen, University of Massachusetts, Lowell
  • Toward Practical Query Pricing with QueryMarket
    Paraschos Koutris, University of Washington; Prasang Upadhyaya, University of Washington; Magdalena Balazinska, University of Washington; Bill Howe, University of Washington; Dan Suciu, University of Washington 
  • Generalized Scale Independence Through Incremental Precomputation 
    Michael Armbrust, Google, Inc; Eric Liang, UC Berkeley; Tim Kraska, Brown University; Armando Fox, UC Berkeley; Michael J. Franklin, UC Berkeley; David A. Patterson, UC Berkeley
  • Simulation of Database-Valued Markov Chains Using SimSQL 
    Zhuhua Cai, Rice University; Zografoula Vagena, LogicBlox; Luis Perez, Rice University; Subramanian Arumugam, Rice University; Peter J. Haas, IBM Almaden; Christopher Jermaine, Rice
  • Recursive Mechanism: Towards Node Differential Privacy and Unrestricted Joins
    Shixi Chen, Fudan University; Shuigeng Zhou, Fudan University
  • PrivGene: Differentially Private Model Fitting Using Genetic Algorithms 
    Jun Zhang, Nanyang Technological Univ.; Xiaokui Xiao, Nanyang Technological University; Yin Yang, ADSC; Zhenjie Zhang, ADSC; Marianne Winslett, University of Illinois at Urbana-Champaign
  • Information Preservation in Statistical Privacy and Bayesian Estimation of Unattributed Histograms
    Bing-Rong Lin, Penn State; Daniel Kifer , Penn State
  • Collective Spatial Keyword Queries: A Distance Owner-Driven Approach
    Cheng Long, HKUST; Raymond Chi-Wing Wong, HKUST; Ke Wang, SFU; Ada Fu, Chinese University of Hong Kong 
  • TOUCH: In-Memory Spatial Join by Hierarchical Data-Oriented Partitioning 
    Sadegh Nobari, National University of Singapore; Farhan Tauheed, EPFL; Thomas Heinis, EPFL; Panagiotis Karras, Rutgers University; Stephane Bressan, National University of Singapore; Anastasia Ailamaki, EPFL
  • Finding Time Period-Based Most Frequent Path in Big Trajectory Data
    Wuman Luo, HKUST; Haoyu Tan, HKUST; Lei Chen, HKUST; Lionel M. Ni, HKUST
  • Integrating Scale Out and Fault Tolerance in Stream Processing using Operator State Management
    Raul Castro Fernandez, Imperial College London; Matteo Migliavacca, University of Kent; Evangelia Kalyvianaki, Imperial College London; Peter Pietzuch, Imperial College London 
  • Quantiles over Data Streams: An Experimental Study 
    Lu Wang, HKUST; Ge Luo, HKUST; Ke Yi, HKUST; Graham Cormode, AT&T Research 
  • An Efficient Query Indexing Mechanism for Filtering Geo-Textual Data 
    Lisi Chen, NTU; Gao Cong, NTU, Singapore; Xin Cao, NTU
  • Bolt-on Causal Consistency
    Peter Bailis, UC Berkeley; Ali Ghodsi, UC Berkeley, KTH; Joseph M. Hellerstein, UC Berkeley; Ion Stoica, UC Berkeley 
  • RTP: Robust Tenant Placement for Elastic In-Memory Database Clusters
    Jan Schaffner, Hasso Plattner Institute; Tim Januschowski, SAP AG; Megan Kercher, SAP AG; Tim Kraska, Brown University; Hasso Plattner, Hasso Plattner Institute; Michael J. Franklin, UC Berkeley; Dean Jacobs, SAP AG 
  • Inter-Media Hashing for Large-scale Retrieval from Heterogeneous Data Sources 
    Jingkuan Song, The University of Queensland; Yang Yang, The University of Queensland; Yi Yang, CMU; Zi Huang, The University of Queensland; Heng Tao Shen, The University of Queensland
  • Mind the Gap: Large-Scale Frequent Sequence Mining
    Iris Miliaraki, Max Planck Institute; Klaus Berberich, Max-Planck Institute; Rainer Gemulla, Max Planck Institute for Informatics; Spyros Zoupanos, Max Planck Institute for Informatics  
  • Reverse Engineering Complex Join Queries 
    Meihui Zhang, NUS; Hazem Elmeleegy, Turn, Inc.; Cecilia M Procopiuc, AT&T Labs-Research; Divesh Srivastava, AT&T Labs-Research 
  • A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery 
    Feida Zhu, Singapore Management University; Zequn Zhang, Singapore Management University; Qiang Qu, Aarhus University
  • Calibrating Trajectory Data for Similarity-based Analysis
    Han Su, University of Queensland; Kai Zheng, university of queensland; Haozhou Wang, University of Queensland; Jiamin Huang, Nanjing University; Xiaofang Zhou, U. of Queensland 
  • On Optimal Worst-Case Matching 
    Cheng Long, HKUST; Raymond Chi-Wing Wong, HKUST; Philip S. Yu, UIC; Minhao Jiang, HKUST
  • Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice
    Andy Diwen Zhu, Nanyang Technological University; Hui Ma, Nanyang Technological University; Xiaokui Xiao, Nanyang Technological University; Siqiang Luo, Fudan University; Youze Tang, Nanyang Technological University; Shuigeng Zhou, Fudan University
  • Fine-Grained Disclosure Control for App Ecosystems
    Gabriel Bender, Cornell University; Lucja Kot, Cornell University; Johannes Gehrke, Cornell University; Christoph Koch, EPFL
  • Lightweight Authentication of Linear Algebraic Queries on Data Streams 
    Stavros Papadopoulos, Hong Kong University of Science and Technology; Graham Cormode, AT&T Research; Antonios Deligiannakis, Technical University of Crete; Minos Garofalakis, Technical University of Crete
  • Column Imprints: A Secondary Index Structure
    Lefteris Sidirourgos, CWI; Martin Kersten, CWI
  • DeltaNI: An Efficient Labeling Scheme for Versioned Hierarchical Data
    Jan Finis, Technische Universität München; Robert Brunel, SAP; Alfons Kemper, Technische Universität München; Thomas Neumann, Technische Universität München; Franz Faerber, SAP AG; Norman May, SAP AG

Follow us: