分享

ACM SIGMOD/PODS Conference: Vancouver, 2008...

 wingate99 2008-05-19

ACM SIGMOD/PODS Conference: Vancouver, 2008

Below you'll find the titles and authors of accepted research papers and industrial papers for SIGMOD 2008. We congratulate these authors as well as all those who submitted. (NOTE: the papers are shown in an arbitrary order.)

 

Research Papers:

  • Configuration-Parametric Query Optimization for Physical Design Tuning
    Nicolas Bruno, Rimma Nehme
  • OLAP on Sequence Data
    Eric Lo, Ben Kao, Wai-Shing Ho, Sau Dan Lee, Chun Kit Chui, David Cheung
  • Relational-Style XML Query
    Taro Saito, Shinichi Morishita
  • Approximate Embedding-based Subsequence Matching of Time Series
    Vassilis Athitsos, Panagiotis Papapetrou, Michalis Potamias, George Kollios, Dimitrios Gunopulos
  • Graph Summarization with Bounded Error
    Nisheeth Shrivastava, Saket Navlakha, Rajeev Rastogi
  • Integrating Background Knowledge in Privacy Quantification
    Wenliang Du, Zhouxuan Teng, Zutao Zhu
  • Pay-as-you-go User Feedback for Dataspace Systems
    Shawn Jeffery, Michael Franklin, Alon Halevy
  • Monochromatic and Bichromatic Reverse Skyline Search over Uncertain Databases
    Xiang Lian, Lei Chen
  • EASE: Efficient and Adaptive Keyword Search on Unstructured, Semi-structured and Structured Data
    Guoliang Li, Beng Chin Ooi, Jianhua Feng, Jianyong Wang, Lizhu Zhou
  • Near-Optimal Algorithms for Shared Filter Evaluation in Data Stream Systems
    Zhen Liu, Srinivasan Parthasarathy, Anand Ranganathan, Hao Yang
  • A Graph Method for Keyword-based Selection of the top-K Databases
    Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, Anthony K. H. Tung
  • Optimizing Complex Queries with Multiple Relation Instances
    Yu Cao, Gopal Das, Chee-Yong Chan, Kian-Lee Tan
  • Cooperative XPath Caching
    Kostas Lillis, Evaggelia Pitoura
  • Sampling Time-Based Sliding Windows in Bounded Space
    Rainer Gemulla, Wolfgang Lehner
  • A PDMS's Path to Stardom: Calibrating the Potential
    Mihai Lupu, Beng Chin Ooi, Y.C. Tay
  • XML Query Optimization in the Presence of Side Effects
    Giorgio Ghelli, Nicola Onose, Kristoffer Rose, Jerome Simeon
  • Efficient Algorithms for Exact Ranked Twig Pattern Matching over Graphs
    Gang Gou, Rada Chirkova
  • Improving Suffix Array Locality for Fast Pattern Matching on Disk
    Ranjan Sinha, Simon Puglisi, Alistair Moffat, Andrew Turpin
  • Efficient Bulk Insertion into a Distributed Ordered Table
    Adam Silberstein, Brian Cooper, Utkarsh Srivastava, Erik Vee, Ramana Yerneni, Raghu Ramakrishnan
  • Relational Joins on Graphics Processors
    Bingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga Govindaraju, Qiong Luo, Pedro Sander
  • Capacity Constrained Assignment in Spatial Databases
    Leong Hou U, Man Lung Yiu, Kyriakos Mouratidis, Nikos Mamoulis
  • CRD: A General Framework Fast Co-clustering on Large Datasets Utilizing Sample-Based Matrix Decomposition
    Feng Pan, Xiang Zhang, Wei Wang
  • Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach
    Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
  • Bootstrapping Pay-As-You-Go Data Integration Systems
    Anish Das Sarma, Luna Dong, Alon Halevy
  • Self-Tunable Spatio-Temporal B+-tree for Moving Objects
    Su Chen, Beng Chin Ooi, Kian-Lee Tan, Mario Nascimento
  • Building a Database on S3
    Matthias Brantner, David Graf, Donald Kossmann, Tim Kraska
  • Efficient Provenance Storage
    Adriane Chapman, H.V. Jagadish, Prakash Ramanan
  • Private Queries in Location Based Services: Anonymizers are not Necessary
    Gabriel Ghinita, Panos Kalnis, Ali Khoshgozaran, Cyrus Shahabi, Kian-Lee Tan
  • Stream Firewalling of XML Constraints
    Michael Benedikt, Alan Jeffrey, Ruy Ley-Wild
  • Graphs-at-a-time: Query Language and Access Methods for Graph Databases
    Huahai He, Ambuj Singh
  • An efficient filter for approximate membership checking
    Kaushik Chakrabarti, Surajit Chaudhuri, Venkatesh Ganti, Dong Xin
  • On Efficient Top-k Query Processing in Highly Distributed Environments
    Akrivi Vlachou, Christos Doulkeridis, Kjetil Norvag, Michalis Vazirgiannis
  • Efficient EMD-based Similarity Search in Multimedia Databases via Flexible Dimensionality Reduction
    Marc Wichterich, Ira Assent, Philipp Kranen, Thomas Seidl
  • MCDB: A Monte Carlo Approach to Managing Uncertain Data
    Peter Haas, Mingxi Wu, Fei Xu, Ravinath Jampani, Christopher Jermaine, Luis Perez
  • Mining Significant Graph Patterns by Scalable Leap Search
    Xifeng Yan, Hong Cheng, Philip Yu, Jiawei Han
  • Towards Identity Anonymization on Graphs
    Kun Liu, Evimaria Terzi
  • Interactive Generation of Integrated Schemas
    Laura Chiticariu, Phokion Kolaitis, Lucian Popa
  • Generating Targeted Queries for Database Testing
    Chaitanya Mishra, Nick Koudas, Calisto Zuzarte
  • Mining Relationshps among Interval-based Events for Classification
    Dhaval Patel, Wynne Hsu, Mong Li Lee
  • Supporting OLAP Operations over Imperfectly Integrated Taxonomies
    Yan Qi, K.Selcuk Candan, Junichi Tatemura, Songting Chen, Fenglin Liao
  • Preservation of Proximity Privacy in Publishing Numerical Sensitive Data
    Jiexing Li, Yufei Tao, Xiaokui Xiao
  • Serializable isolation for snapshot databases
    Michael Cahill, Uwe Röhm, Alan Fekete
  • Finding Frequent Items in Probabilistic Data
    Qin Zhang, Feifei Li, Ke Yi
  • Sampling Cube: A Framework for Statistical OLAP over Sampling Data
    Xiaolei Li, Jiawei Han, Jae-Gil Lee, Zhijun Yin, Yizhou Sun
  • Event Queries on Correlated Probabilistic Streams
    Christopher Re, Julie Letchner, Magdalena Balazinska, Dan Suciu
  • iDisc: Discovering Topical Structures of Databases to Support Semantic Browsing & Large-Scale Data Integration
    Wensheng Wu, Berthold Reinwald, Yannis Sismanis, Rajesh Manjrekar
  • Query Efficiency in Probabilistic XML Models
    Benny Kimelfeld, Yuri Kosharovski, Yehoshua Sagiv
  • Scalable Regular Expression Matching on Data Streams
    Anirban Majumder, Rajeev Rastogi, Sriram Vanama
  • Keyword Proximity Search in Complex Data Graphs
    Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv
  • CSV: Visualizing and Mining Cohesive Subgraphs
    Nan Wan, Srinivasan Parthasarathy, Kian-Lee Tan, Anthony K. H. Tung
  • Ad-Hoc Aggregations of Ranked Lists in the Presence of Hierarchies
    Nilesh Bansal, Sudipto Guha, Nick Koudas
  • ARCube: Supporting Ranking Aggregate Queries in Partially Materialized Data Cubes
    Tianyi Wu, Dong Xin, Jiawei Han
  • Query Biased Snippet Generation in XML Search
    Yu Huang, Ziyang Liu, Yi Chen
  • Dynamic Anonymization: Accurate Statistical Analysis with Privacy Preservation
    Xiaokui Xiao, Yufei Tao
  • Dynamic Programming Strikes Back
    Guido Moerkotte, Thomas Neumann
  • Efficient Storage Scheme and Query Processing for Supply Chain Management using RFID
    Chun-Hee Lee, Chin-Wan Chung
  • Minimization of Tree Pattern Queries with Constraints
    Ding Chen, Chee-Yong Chan
  • Just-In-Time Query Retrieval Over Partially Indexed Data on Structured P2P Overlays
    Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan
  • Querying Continuous Functions in a Database System
    Arvind Thiagarajan, Sam Madden
  • Middleware-based Database Replication: The Gaps Between Theory and Practice
    Emmanuel Cecchet, George Candea, Anastasia Ailamaki
  • Angle-based Space Partitioning for Efficient Parallel Skyline Computation
    Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis
  • Efficient Aggregation for Graph Summarization
    Yuanyuan Tian, Richard Hankins, Jignesh Patel
  • Automatic Virtual Machine Configuration for Database Workloads
    Ahmed Soror, Umar Minhas, Ashraf Aboulnaga, Kenneth Salem, Peter Kokosielis, Sunil Kamath
  • Query-based Partitioning of Documents and Indexes for Information Lifecycle Management
    Soumyadeb Mitra, Marianne Winslett, Windsor Hsu
  • Efficiently Answering Reachability Query on Very Large Directed Graphs
    Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang
  • Column-Stores vs. Row-Stores: How Different Are They Really?
    Daniel Abadi, Sam Madden, Nabil Hachem
  • Categorical Skylines for Streaming Data
    Nikos Sarkas, Gautam Das, Nick Koudas, Anthony K. H. Tung
  • Efficient Pattern Matching over Event Streams
    Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Neil Iimmerman
  • Scalable Network Distance Browsing in Spatial Databases
    Hanan Samet, Jagan Sankaranarayanan, Houman Alborzi
  • Efficient Lineage Tracking For Scientific Workflows
    Thomas Heinis, Gustavo Alonso
  • Discovering Bucket Orders from Full Rankings
    Jianlin Feng, Qiong Fang, Wilfred Ng
  • Adding Magic to an Optimising Datalog Compiler
    Damien Sereni, Pavel Avgustinov, Oege De Moor
  • Toward Best-effort Information Extraction
    Warren Shen, Robert McCann, Pedro DeRose, Raghu Ramakrishnan, AnHai Doan
  • OLTP Through the Looking Glass, And What We Found There
    Stavros Harizopoulos, Daniel Abadi, Sam Madden, Michael Stonebraker
  • Cost-Based Gram Selection for String Collections to Support Approximate Queries Efficiently
    Xiaochun Yang, Bin Wang, Chen Li
  • SQAK: Doing More With Keywords
    Sandeep Tata, Guy Lohman
  • Skippy: a New Indexing Method for Long-Lived Snapshots in the Storage Manager
    Liuba Shrira, Ross Shaull, Hao Xu
  • Outlier-robust Clustering Using ICA
    Christian Boehm, Christos Faloutsos, Claudia Plant

Industrial Papers:

  • Helping Satisfy Multiple Objectives during a Service Desk Conversation
    Ullas Nambiar, Himanshu Gupta, Raju Balakrishnan, Mukesh Mohania
  • Multi-Tenant Databases for Software as a Service
    Stefan Aulbach, Torsten Grust, Dean Jacobs, Alfons Kemper, Jan Rittinger
  • Query-Aware Partitioning for Monitoring Massive Network Data Streams
    Vladislav Shkapenyuk, Ted Johnson, Oliver Spatscheck, S. Muthukrishnan
  • SPADE: The System S Declarative Stream Processing Engine
    Bugra Gedik, Henrique Andrade, Kun-Lung Wu, Philip Yu, Myungcheol Doo
  • Handling Data Skew in Parallel Joins in Shared-Nothing Systems
    Yu Xu, Pekka Kostamaa, Xin Zhou, Liang Chen
  • A Case for Flash Memory SSD in Enterprise Database Applications
    Bongki Moon, Chanik Park, Sang-Won Lee
  • Supporting Table Partitioning By Reference in Oracle
    George Eadon, Eugene Chong, Shrikanth Shankar, Ananth Raghavan, Jagannathan Srinivasan, Souripriya Das
  • Efficient and Scalable Statistics Gathering for Large Databases in Oracle 11g
    Sunil Chakkappen, Thierry Cruanes, Benoit Dageville, Linan Jiang, Uri Shaft, Hong Su, Mohamed Zait
  • Damia: Data Mashups for Intranet Applications
    David Simmen, Mehmet Altinel, Volker Markl, Sriram Padmanabhan, Ashutosh Singh
  • Oracle Database Replay
    Leonidas Galanis, Karl Dias, Yujun Wang, Romain Colle, Supiti Buranawatanachoke, Venkateshwaran Venkataramani
  • Pig Latin: A Not-So-Foreign Language for Data Processing
    Christopher Olston, Benjamin Reed, Utkarsh Srivastava, Ravi Kumar, Andrew Tomkins
  • .NET Database Programmability and Extensibility in Microsoft SQL Server
    Vineet Rao, Jose Blakeley, Adam Prout, Isaac Kunen, Christian Kleinerman, Mat Henaire, Brad Richards
  • Grouping and Optimization of XPath Expressions in DB2 pureXML
    Andrey Balmin, Fatma Ozcan, Ashutosh Singh, Edison Ting
  • Effective and Efficient Semantic Web Data Management over DB2
    Li Ma, Chen Wang, Feng Cao, Yue Pan
  • Spatial Indexing in Microsft SQL Server 2008
    Yi Fang, Marc Friedman, Giri Nair, Michael Rys, Ana-Elisa Schmidt

    本站是提供个人知识管理的网络存储空间,所有内容均由用户发布,不代表本站观点。请注意甄别内容中的联系方式、诱导购买等信息,谨防诈骗。如发现有害或侵权内容,请点击一键举报。
    转藏 分享 献花(0

    0条评论

    发表

    请遵守用户 评论公约

    类似文章 更多