jiajia4487的专栏

其中RunTime21.rar 是基于路网的生成器，可以在指定路网上产生指定数量指定时间内的移动对象。 里面有个我写的readme.txt使用说明，不懂可以再问。 SpatialDataGenerator是普通的数据产生器，里面的参数可以自己设。比如，对象产生的范围，数量，服从的分布，维度等等。是个可视化的工具

以前和大家分享过SIGMOD2009和2011的论文，朋友们都很感兴趣，现手里有ICDE2013的全部论文，再次和大家分享~ 一个包放不下，一共分成了4个包，包含142篇长文论文，还有64篇短文论文，朋友们可以挑选自己感兴趣的部分下载，我尽量把文章目录写得明白一些。 这是第四部分。 很抱歉，之前没太看明白，这四个包里的内容有点混淆，包中的论文是按照文章列表编号排序的，事实上，这三个包中的论文把所有的research papers, industry papers and short papers全部包含了，没有严格按照列表来。 备注：需要的朋友，可以把四个包的文章下载完整，再对照列表查询自己感兴趣的论文进行阅读，在列表中看到的论文，在四个包中一定能找得到，抱歉。

以前和大家分享过SIGMOD2009和2011的论文，朋友们都很感兴趣，现手里有ICDE2013的全部论文，再次和大家分享~ 一个包放不下，一共分成了4个包，包含142篇长文论文，还有64篇短文论文，朋友们可以挑选自己感兴趣的部分下载，我尽量把文章目录写得明白一些。 这是第三部分。 很抱歉，之前没太看明白，这四个包里的内容有点混淆，包中的论文是按照文章列表编号排序的，事实上，这三个包中的论文把所有的research papers, industry papers and short papers全部包含了，没有严格按照列表来。 备注：需要的朋友，可以把四个包的文章下载完整，再对照列表查询自己感兴趣的论文进行阅读，在列表中看到的论文，在四个包中一定能找得到，抱歉。

以前和大家分享过SIGMOD2009和2011的论文，朋友们都很感兴趣，现手里有ICDE2013的全部论文，再次和大家分享~ 一个包放不下，一共分成了4个包，包含142篇长文论文，还有64篇短文论文，朋友们可以挑选自己感兴趣的部分下载，我尽量把文章目录写得明白一些。 这是第二部分，共有50篇论文。 300. Finding Interesting Correlations with Conditional Heavy Hitters Katsiaryna Mirylenka Graham Cormode (AT&T Labs Research) Themis Palpanas (University of Trento, Italy) Divesh Srivastava (AT&T Labs) 302. Accurate and Efficient Private Release of Datacubes and Contingency Tables Graham Cormode (AT&T Labs Research) Cecilia Procopiuc (AT&T Labs-Research) Divesh Srivastava (AT&T Labs) Grigory Yaroslavtsev 329. Graph Stream Classification using Labeled and Unlabeled Graphs Shirui Pan (Univ. Technology Sydney) Xingquan Zhu Chengqi Zhang (QCIS, FEIT, UTS) Philip Yu (UIC) 330. Presenting Diverse Location Views with Real-time Near-duplicate Photo Elimination Jiajun Liu (The University of Queensland) Zi Huang (The University of Queensland) Heng Tao Shen (The University of Queensland) Hong Cheng (The Chinese Univerity of Hong Kong) Yueguo Chen (Renmin University of China) Yanchun Zhang (Victoria University) 351. An Efficient and Compact Indexing Scheme for Large-scale Data Store Peng Lu (National University of Singapo) Sai Wu (Zhejiang University) Lidan Shou (Zhejiang University) Kian-Lee Tan (National University of Singapore) 363. Attribute Extraction and Scoring: A Probabilistic Approach Taesung Lee (POSTECH) Zhongyuan Wang (Microsoft) Haixun Wang (Microsoft) Seung-won Hwang (POSTECH) 368. Enumerating Subgraph Instances Using Map-Reduce Foto Afrati (National Technical Uni Athens) Dimitris Fotakis Jeffrey Ullman 379. Top-K Oracle: A New Way to Present Top-K Tuples for Uncertain Data Chunyao Song (University of Massachusetts, Lowell) Zheng Li (University of Massachusetts, Lowell) Tingjian Ge (University of Massachusetts, Lowell) 395. Inverted Linear Quadtree : Efficient Top K Spatial Keyword Search chengyuan Zhang (UNSW) Ying Zhang (University of New South Wales) Wenjie Zhang (University of New South Wales) Xuemin Li

以前和大家分享过SIGMOD2009的论文，朋友们都很感兴趣，现手里有SIGMOD211的全部论文，再次和大家分享~ 一个包放不下，一共分成了3个包，包含百余篇论文，朋友们可以挑选自己感兴趣的部分下载，我尽量把文章目录写得明白一些。 这是第二部分。 Nearest Keyword Search in XML Documents (Page 589) Yufei Tao (Chinese University of Hong Kong) Stavros Papadopoulos (Chinese University of Hong Kong) Cheng Sheng (Chinese University of Hong Kong) Kostas Stefanidis (Chinese University of Hong Kong) Efficient and Generic Evaluation of Ranked Queries (Page 601) Wen Jin (Independent Consultant) Jignesh M. Patel (University of Wisconsin - Madison) (Return to Top) Session 13: Stream and Complex Event Processing Changing Flights in Mid-Air: A Model for Safely Modifying Continuous Queries (Page 613) Kyumars Sheykh Esmaili (ETH Zurich) Tahmineh Sanamrad (ETH Zurich) Peter M. Fischer (ETH Zurich) Nesime Tatbul (ETH Zurich) How Soccer Players Would Do Stream Joins (Page 625) Jens Teubner (ETH Zurich) Rene Mueller (IBM Almaden Research Group) BE-Tree: An Index Structure to Efficiently Match Boolean Expressions Over High-Dimensional Discrete Space (Page 637) Mohammad Sadoghi (University of Toronto) Hans-Arno Jacobsen (University of Toronto) TI: An Efficient Indexing Mechanism for Real-Time Search on Tweets (Page 649) Chun Chen (Zhejiang University) Feng Li (National University of Singapore) Beng Chin Ooi (National University of Singapore) Sai Wu (National University of Singapore) (Return to Top) Session 14: Query Processing More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets (Page 661) K. Tuncay Tekle (LogicBlox, Inc.) Yanhong A. Liu (State University of New York at Stony Brook) Entangled Queries: Enabling Declarative Data-Driven Coordination (Page 673) Nitin Gupta (Cornell University) Lucja Kot (Cornell University) Sudip Roy (Cornell University) Gabriel Bender (Cornell University) Johannes Gehrke (Cornell University) Christoph Koch (École Polytechnique Fédérale de Lausanne) Data Generation Using Declarative Constraints (Page 685) Arvind Arasu (Microsoft Research) Raghav

以前和大家分享过SIGMOD2009的论文，朋友们都很感兴趣，现手里有SIGMOD211的全部论文，再次和大家分享~ 一个包放不下，一共分成了3个包，包含百余篇论文，朋友们可以挑选自己感兴趣的部分下载，我尽量把文章目录写得明白一些。 这是第一部分。 Session 1: Databases on New Hardware LazyFTL: A Page-Level Flash Translation Layer Optimized for NAND Flash Memory (Page 1) Dongzhe Ma (Tsinghua University) Jianhua Feng (Tsinghua University) Guoliang Li (Tsinghua University) Operation-Aware Buffer Management in Flash-Based Systems (Page 13) Yanfei Lv (Peking University) Bin Cui (Peking University) Bingsheng He (Nanyang Technological University) Xuexuan Chen (Peking University) SkimpyStash: RAM Space Skimpy Key-Value Store on Flash-based Storage (Page 25) Biplob Debnath (EMC Corporation) Sudipta Sengupta (Microsoft Research) Jin Li (Microsoft Research) Design and Evaluation of Main Memory Hash Join Algorithms for Multi-Core CPUs (Page 37) Spyros Blanas (University of Wisconsin-Madison) Yinan Li (University of Wisconsin-Madison) Jignesh M. Patel (University of Wisconsin-Madison) (Return to Top) Session 2: Query Processing and Optimization Query Optimization Techniques for Partitioned Tables (Page 49) Herodotos Herodotou (Duke University) Nedyalko Borisov (Duke University) Shivnath Babu (Duke University) CrowdDB: Answering Queries with Crowdsourcing (Page 61) Michael J. Franklin (University of California, Berkeley) Donald Kossmann (ETH Zurich) Tim Kraska (University of California, Berkeley) Sukriti Ramesh (ETH Zurich) Reynold Xin (University of California, Berkeley) Skyline Query Processing Over Joins (Page 73) Akrivi Vlachou (Norwegian University of Science and Technology (NTNU)) Christos Doulkeridis (Norwegian University of Science and Technology (NTNU)) Neoklis Polyzotis (UC Santa Cruz) Efficient Parallel Skyline Processing Using Hyperplane Projections (Page 85) Henning Köhler (The University of Queensland) Jing Yang (Renmin University of China) Xiaofang Zhou (The University of Queensland & Renmin University of China) (Return to Top) Session 3: Schema Mapping and Data Integration Scalable Query Rewriting: A Graph-Based Approach (Page 97) George Konstantinidis (Information Sciences Institute / University of Southern California) José Luis Ambite (Information Sciences Institute / University of Southern California) Automatic Discovery of Attributes in Relational Databases (Page 109) Meihui Zhang (National University of Singapore) Marios Hadjieleftheriou (AT&T Labs - Research) Beng Chin Ooi (National University of Singapore) Cecilia M. Procopiuc (AT&T Labs - Research) Divesh Srivastava (AT&T Labs - Research) Leveraging Query Logs for Schema Mapping Generation in U-MAP (Page 121) Hazem Elmeleegy (AT&T Labs - Research) Ahmed Elmagarmid (Qatar Computing Research Institute, Qatar Foundation) Jaewoo Lee (Purdue University) Designing and Refining Schema Mappings via Data Examples (Page 133) Bogdan Alexe (University of California, Santa Cruz) Balder ten Cate (University of California, Santa Cruz) Phokion G. Kolaitis (University of California, Santa Cruz and IBM Research - Almaden) Wang-Chiew Tan (IBM Research - Almaden and University of California, Santa Cruz) (Return to Top) Session 4: Data on the We Apples and Oranges: A Comparison of RDF Benchmarks and Real RDF Datasets (Page 145) Songyun Duan (IBM Research - T.J. Watson Research Center) Anastasios Kementsietsidis (IBM Research - T.J. Watson Research Center) Kavitha Srinivas (IBM Research - T.J. Watson Research Center) Octavian Udrea (IBM Research - T.J. Watson Research Center) Efficient Query Answering in Probabilistic RDF Graphs (Page 157) Xiang Lian (Hong Kong University of Science and Technology) Lei Chen (Hong Kong University of Science and Technology) Facet Discovery for Structured Web Search: A Query-Log Mining Approach (Page 169) Jeffrey Pound (University of Waterloo) Stelios Paparizos (Microsoft Research) Panayiotis Tsaparas (Microsoft Research) Schema-As-You-Go: On Probabilistic Tagging and Querying of Wide Tables (Page 181) Meiyu Lu (National University of Singapore) Divyakant Agrawal (University of California at Santa Barbara) Bing Tian Dai (National University of Singapore) Anthony K. H. Tung (National University of Singapore) (Return to Top) Session 5: Data Privacy and Security No Free Lunch in Data Privacy (Page 193) Daniel Kifer (Penn State University) Ashwin Machanavajjhala (Yahoo! Research) TrustedDB: A Trusted Hardware Based Database with Privacy and Data Confidentiality (Page 205) Sumeet Bajaj (Stony Brook University) Radu Sion (Stony Brook University) Differentially Private Data Cubes: Optimizing Noise Sources and Consistency (Page 217) Bolin Ding (University of Illinois at Urbana-Champaign) Marianne Winslett (Advanced Digital Sciences Center & University of Illinois at Urbana-Champaign) Jiawei Han (University of Illinois at Urbana-Champaign) Zhenhui Li (University of Illinois at Urbana-Champaign) iReduct: Differential Privacy with Reduced Relative Errors (Page 229) Xiaokui Xiao (Nanyang Technological University) Gabriel Bender (Cornell University) Michael Hay (Cornell University) Johannes Gehrke (Cornell University) (Return to Top) Session 6: Data Consistency and Parallel DB A Latency and Fault-Tolerance Optimizer for Online Parallel Query Plans (Page 241) Prasang Upadhyaya (University of Washington) YongChul Kwon (University of Washington) Magdalena Balazinska (University of Washington) ArrayStore: A Storage Manager for Complex Parallel Array Processing (Page 253) Emad Soroush (University of Washington) Magdalena Balazinska (University of Washington) Daniel Wang (SLAC National Accelerator Laboratory) Fast Checkpoint Recovery Algorithms for Frequently Consistent Applications (Page 265) Tuan Cao (Cornell University) Marcos Vaz Salles (Cornell University) Benjamin Sowell (Cornell University) Yao Yue (Cornell University) Alan Demers (Cornell University) Johannes Gehrke (Cornell University) Walker White (Cornell University) Warding off the Dangers of Data Corruption with Amulet (Page 277) Nedyalko Borisov (Duke University) Shivnath Babu (Duke University) Nagapramod Mandagere (IBM Almaden Research) Sandeep Uttamchandani (IBM Almaden Research) (Return to Top) Session 7: Service Oriented Computing, Data Management in the Cloud Schedule Optimization for Data Processing Flows on the Cloud (Page 289) Herald Kllapi (University of Athens) Eva Sitaridi (University of Athens) Manolis M. Tsangaris (University of Athens) Yannis Ioannidis (University of Athens) Zephyr: Live Migration in Shared Nothing Databases for Elastic Cloud Platforms (Page 301) Aaron J. Elmore (University of California, Santa Barbara) Sudipto Das (University of California, Santa Barbara) Divyakant Agrawal (University of California, Santa Barbara) Amr El Abbadi (University of California, Santa Barbara) Workload-Aware Database Monitoring and Consolidation (Page 313) Carlo Curino (Massachusetts Institute of Technology) Evan P. C. Jones (Massachusetts Institute of Technology) Samuel Madden (Massachusetts Institute of Technology) Hari Balakrishnan (Massachusetts Institute of Technology) Predicting Cost Amortization for Query Services (Page 325) Verena Kantere (Cyprus University of Technology) Debabrata Dash (ArcSight) Georgios Gratsias (ELCA Informatique SA) Anastasia Ailamaki (École Polytechnique Fédérale de Lausanne) Performance Prediction for Concurrent Database Workloads (Page 337) Jennie Duggan (Brown University) Ugur Cetintemel (Brown University) Olga Papaemmanouil (Brandeis University) Eli Upfal (Brown University) (Return to Top) Session 8: Spatial and Temporal Data Management Reverse Spatial and Textual k Nearest Neighbor Search (Page 349) Jiaheng Lu (Renmin University of China) Ying Lu (Renmin University of China) Gao Cong (Nanyang Technological University) Location-Aware Type Ahead Search on Spatial Databases: Semantics and Efficiency (Page 361) Senjuti Basu Roy (University of Texas at Arlington) Kaushik Chakrabarti (Microsoft Research) Collective Spatial Keyword Querying (Page 373) Xin Cao (Nanyang Technological University) Gao Cong (Nanyang Technological University) Christian S. Jensen (Aarhus University) Beng Chin Ooi (National University of Singapore) Finding Semantics in Time Series (Page 385) Peng Wang (Fudan University & Microsoft Research Asia) Haixun Wang (Microsoft Research Asia) Wei Wang (Fudan University) Querying Contract Databases Based on Temporal Behavior (Page 397) Elio Damaggio (University of California, San Diego) Alin Deutsch (University of California, San Diego) Dayou Zhou (University of California, San Diego) (Return to Top) Session 9: Shortest Paths and Sequence Data Neighborhood-Privacy Protected Shortest Distance Computing in Cloud (Page 409) Jun Gao (Peking University) Jeffery Xu Yu (Chinese University of Hong Kong) Ruoming Jin (Kent State University) Jiashuai Zhou (Peking University) Tengjiao Wang (Peking University) Dongqing Yang (Peking University) On k-Skip Shortest Paths (Page 421) Yufei Tao (Chinese University of Hong Kong) Cheng Sheng (Chinese University of Hong Kong) Jian Pei (Simon Fraser University) Finding Shortest Path on Land Surface (Page 433) Lian Liu (The Hong Kong University of Science and Technology) Raymond Chi-Wing Wong (The Hong Kong University of Science and Technology) WHAM: A High-Throughput Sequence Alignment Method (Page 445) Yinan Li (University of Wisconsin-Madison) Allison Terrell (University of Wisconsin-Madison) Jignesh M. Patel (University of Wisconsin-Madison) A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union (Page 457) Wook-Shin Han (Kyungpook National University) Jinsoo Lee (Kyungpook National University) Yang-Sae Moon (Kangwon National University) Seung-won Hwang (Pohang University of Science and Technology) Hwanjo Yu (Pohang University of Science and Technology) (Return to Top) Session 10: Data Provenance, Workflow and Cleaning Interaction Between Record Matching and Data Repairing (Page 469) Wenfei Fan (University of Edinburgh & Harbin Institute of Technology) Jianzhong Li (Harbin Institute of Technology) Shuai Ma (Beihang University) Nan Tang (University of Edinburgh) Wenyuan Yu (University of Edinburgh) We Challenge You to Certify Your Updates (Page 481) Su Chen (National University of Singapore) Xin Luna Dong (AT&T Labs-Research) Laks V.S. Lakshmanan (University of British Columbia) Divesh Srivastava (AT&T Labs-Research) Labeling Recursive Workflow Executions On-the-Fly (Page 493) Zhuowei Bao (University of Pennsylvania) Susan B. Davidson (University of Pennsylvania) Tova Milo (Tel Aviv University) Tracing Data Errors with View-Conditioned Causality (Page 505) Alexandra Meliou (University of Washington) Wolfgang Gatterbauer (University of Washington) Suman Nath (Microsoft Research) Dan Suciu (University of Washington) (Return to Top) Session 11: Information Extraction Hybrid In-Database Inference for Declarative Information Extraction (Page 517) Daisy Zhe Wang (University of California, Berkeley) Michael J. Franklin (University of California, Berkeley) Minos Garofalakis (Technical University of Crete) Joseph M. Hellerstein (University of California, Berkeley) Michael L. Wick (University of Massachusetts, Amherst) Faerie: Efficient Filtering Algorithms for Approximate Dictionary-Based Entity Extraction (Page 529) Guoliang Li (Tsinghua University) Dong Deng (Tsinghua University) Jianhua Feng (Tsinghua University) Joint Unsupervised Structure Discovery and Information Extraction (Page 541) Eli Cortez (Universidade Federal do Amazonas) Daniel Oliveira (Universidade Federal do Amazonas) Altigran S. da Silva (Universidade Federal do Amazonas) Edleno S. de Moura (Universidade Federal do Amazonas) Alberto H. F. Laender (Universidade Federal de Minas Gerais) Attribute Domain Discovery for Hidden Web Databases (Page 553) Xin Jin (George Washington University) Nan Zhang (George Washington University) Gautam Das (University of Texas at Arlington) (Return to Top) Session 12: Keyword Search and Ranked Queries Keyword Search Over Relational Databases: A Metadata Approach (Page 565) Sonia Bergamaschi (University of Modena and Reggio Emilia, Italy) Elton Domnori (University of Modena and Reggio Emilia, Italy) Francesco Guerra (University of Modena and Reggio Emilia, Italy) Raquel Trillo Lado (University of Zaragoza) Yannis Velegrakis (University of Trento) Sharing Work in Keyword Search Over Databases (Page 577) Marie Jacob (University of Pennsylvania) Zachary Ives (University of Pennsylvania)

在信息学竞赛中，有很多问题最终都能转化为区间问题：例如从若干个区间中选出一些满足一定条件的区间、将各个区间分配到一些资源中、或者将一些区间以某种顺序放置等。这类问题变化繁多，解法各异，需要用到贪心、动态规划等算法，并可以用一些数据结构优化算法。 本文将从几个方面对区间问题做一个简单的介绍，给出一些算法及其正确性的证明，具体分如下几个方面进行讨论： 1.最大区间调度问题 2.多个资源的调度问题 3.有最终期限的区间调度问题 4.最小区间覆盖问题 5.带权区间调度、覆盖问题 6.区间和点的有关问题 我们将对上述每个问题都给出基本模型、算法、证明及其实现，并从ACM-ICPC、CEOI、CTSC等比赛中选出了近10道相关例题，进行简要分析，有的例题还给出了各种不同的算法及其时间效率的分析。 本文中所讨论的问题主要由两个部分组成，一部分为近几年来各类竞赛题的归纳总结，另一部分来自于参考文献。

以前和大家分享过SIGMOD2009的论文，朋友们都很感兴趣，现手里有SIGMOD211的全部论文，再次和大家分享~ 一个包放不下，一共分成了3个包，包含百余篇论文，朋友们可以挑选自己感兴趣的部分下载，我尽量把文章目录写得明白一些。 这是第三部分 Emerging Trends in the Enterprise Data Analytics: Connecting Hadoop and DB2 Warehouse (Page 1161) Fatma Özcan (IBM Almaden Research Center) David Hoa (Silicon Valley Lab) Kevin S. Beyer (IBM Almaden Research Center) Andrey Balmin (IBM Almaden Research Center) Chuan Jie Liu (IBM China) Yu Li (IBM China) Efficient Processing of Data Warehousing Queries in a Split Execution Environment (Page 1165) Kamil Bajda-Pawlikowski (Hadapt Inc. & Yale University) Daniel J. Abadi (Hadapt Inc. & Yale University) Avi Silberschatz (Yale University) Erik Paulson (University of Wisconsin - Madison) SQL Server Column Store Indexes (Page 1177) Per-Åke Larson (Microsoft) Cipri Clinciu (Microsoft) Eric N. Hanson (Microsoft) Artem Oks (Microsoft) Susan L. Price (Microsoft) Srikumar Rangarajan (Microsoft) Aleksandras Surna (Microsoft) Qingqing Zhou (Microsoft) An Analytic Data Engine for Visualization in Tableau (Page 1185) Richard Wesley (Tableau Software) Matthew Eldridge (Tableau Software) Pawel Terlecki (Tableau Software) (Return to Top) Tutorials Learning Statistical Models from Relational Data (Page 1195) Lise Getoor (University of Maryland) Lilyana Mihalkova (University of Maryland) Web Data Management (Page 1199) Michael J. Cafarella (University of Michigan) Alon Y. Halevy (Google, Inc.) Privacy-Aware Data Management in Information Networks (Page 1201) Michael Hay (Cornell University) Kun Liu (Yahoo! Labs) Gerome Miklau (University of Massachusetts, Amherst) Jian Pei (Simon Fraser University) Evimaria Terzi (Boston University) Large-Scale Copy Detection (Page 1205) Xin Luna Dong (AT&T Labs-Research) Divesh Srivastava (AT&T Labs-Research) Data Management Over Flash Memory (Page 1209) Ioannis Koltsidas (IBM Research) Stratis D. Viglas (University of Edinburgh) Datalog and Emerging Applications: An Interactive Tutorial (Page 1213) Shan Shan Huang (LogicBlox, Inc.) Todd J. Green (University of California, Davis) Boon Thau Loo (University of Pennsylvania) (Return to Top) Demo Session 1: Systems and Performance One-Pass Data Mining Algorithms in a DBMS with UDFs (Page 1217) Carlos Ordonez (University of Houston) Sasi K. Pitchaimalai (University of Houston) Inspector Gadget: A Framework for Custom Monitoring and Debugging of Distributed Dataflows (Page 1221) Christopher Olston (Yahoo! Research) Benjamin Reed (Yahoo! Research) RAFT at Work: Speeding-Up MapReduce Applications Under Task and Node Failures (Page 1225) Jorge-Arnulfo Quiané-Ruiz (Saarland University) Christoph Pinkel (Saarland University) Jörg Schad (Saarland University) Jens Dittrich (Saarland University) WattDB: An Energy-Proportional Cluster of Wimpy Nodes (Page 1229) Daniel Schall (TU Kaiserslautern) Volker Hudlet (TU Kaiserslautern) BRRL: A Recovery Library for Main-Memory Applications in the Cloud (Page 1233) Tuan Cao (Cornell University) Benjamin Sowell (Cornell University) Marcos Vaz Salles (Cornell University) Alan Demers (Cornell University) Johannes Gehrke (Cornell University) A Data-Oriented Transaction Execution Engine and Supporting Tools (Page 1237) Ippokratis Pandis (Carnegie Mellon University & École Polytechnique Fédérale de Lausanne) Pinar Tözün (École Polytechnique Fédérale de Lausanne) Miguel Branco (École Polytechnique Fédérale de Lausanne) Dimitris Karampinas (University of Patras) Danica Porobic (École Polytechnique Fédérale de Lausanne) Ryan Johnson (University of Toronto) Anastasia Ailamaki (École Polytechnique Fédérale de Lausanne & Carnegie Mellon University) iGraph in Action: Performance Analysis of Disk-Based Graph Indexing Techniques (Page 1241) Wook-Shin Han (Kyungpook National University) Minh-Duc Pham (Kyungpook National University) Jinsoo Lee (Kyungpook National University) Romans Kasperovics (Kyungpook National University) Jeffrey Xu Yu (Chinese University of Hong Kong) StreamRec: A Real-Time Recommender System (Page 1243) Badrish Chandramouli (Microsoft Research) Justin J. Levandoski (University of Minnesota) Ahmed Eldawy (University of Minnesota) Mohamed F. Mokbel (University of Minnesota) (Return to Top) Demo Session 2: Ranking, the Web, and Social Media SkylineSearch: Semantic Ranking and Result Visualization for PubMed (Page 1247) Julia Stoyanovich (University of Pennsylvania) Mayur Lodha (Columbia University) William Mee (Columbia University) Kenneth A. Ross (Columbia University) A Cross-Service Travel Engine for Trip Planning (Page 1251) Gang Chen (Zhejiang University) Chen Liu (National University of Singapore) Meiyu Lu (National University of Singapore) Beng Chin Ooi (National University of Singapore) Shanshan Ying (National University of Singapore) Anthony K. H. Tung (National University of Singapore) Dongxiang Zhang (National University of Singapore) Meihui Zhang (National University of Singapore) WINACS: Construction and Analysis of Web-Based Computer Science Information Networks (Page 1255) Tim Weninger (University of Illinois Urbana-Champaign) Marina Danilevsky (University of Illinois Urbana-Champaign) Fabio Fumarola (Universitá degli Studi di Bari) Joshua Hailpern (University of Illinois Urbana-Champaign) Jiawei Han (University of Illinois Urbana-Champaign) Thomas J. Johnston (University of Illinois Urbana-Champaign) Surya Kallumadi (Kansas State University) Hyungsul Kim (University of Illinois Urbana-Champaign) Zhijin Li (University of Illinois Urbana-Champaign) David McCloskey (University of Illinois Urbana-Champaign) Yizhou Sun (University of Illinois Urbana-Champaign) Nathan E. TeGrotenhuis (Whitworth University) Chi Wang (University of Illinois Urbana-Champaign) Xiao Yu (University of Illinois Urbana-Champaign) Tweets as Data: Demonstration of TweeQL and TwitInfo (Page 1259) Adam Marcus (Massachusetts Institute of Technology) Michael S. Bernstein (Massachusetts Institute of Technology) Osama Badar (Massachusetts Institute of Technology) David R. Karger (Massachusetts Institute of Technology) Samuel Madden (Massachusetts Institute of Technology) Robert C. Miller (Massachusetts Institute of Technology) MOBIES: Mobile-Interface Enhancement Service for Hidden Web Database (Page 1263) Xin Jin (George Washington University) Aditya Mone (University of Texas at Arlington) Nan Zhang (George Washington University) Gautam Das (University of Texas at Arlington) Search Computing: Multi-Domain Search on Ranked Data (Page 1267) Alessandro Bozzon (Politecnico di Milano) Daniele Braga (Politecnico di Milano) Marco Brambilla (Politecnico di Milano) Stefano Ceri (Politecnico di Milano) Francesco Corcoglioniti (Politecnico di Milano) Piero Fraternali (Politecnico di Milano) Salvatore Vadacca (Politecnico di Milano) EnBlogue - Emergent Topic Detection in Web 2.0 Streams (Page 1271) Foteini Alvanaki (Saarland University) Michel Sebastian (Saarland University) Krithi Ramamritham (IIT Bombay) Gerhard Weikum (Max-Planck Institute Informatics) NOAM: News Outlets Analysis and Monitoring System (Page 1275) Ilias Flaounas (University of Bristol) Omar Ali (University of Bristol) Marco Turchi (European Commission) Tristan Snowsill (University of Bristol) Florent Nicart (Université de Rouen) Tijl De Bie (University of Bristol) Nello Cristianini (University of Bristol) (Return to Top) Demo Session 3: Data Integration and Probabilistic Databases Pay-As-You-Go Mapping Selection in Dataspaces (Page 1279) Cornelia Hedeler (The University of Manchester) Khalid Belhajjame (The University of Manchester) Norman W. Paton (The University of Manchester) Alvaro A. A. Fernandes (The University of Manchester) Suzanne M. Embury (The University of Manchester) Lu Mao (The University of Manchester) Chenjuan Guo (The University of Manchester) Exelixis: Evolving Ontology-Based Data Integration System (Page 1283) Haridimos Kondylakis (FORTH-ICS) Dimitris Plexousakis (FORTH-ICS) U-MAP: A System for Usage-Based Schema Matching and Mapping (Page 1287) Hazem Elmeleegy (AT&T Labs - Research) Jaewoo Lee (Purdue University) El Kindi Rezig (Purdue University) Mourad Ouzzani (Purdue University) Ahmed Elmagarmid (Qatar Computing Research Institute, Qatar Foundation) The System T IDE: An Integrated Development Environment for Information Extraction Rules (Page 1291) Laura Chiticariu (IBM Research - Almaden) Vivian Chu (IBM research - Almaden) Sajib Dasgupta (IBM Research - Almaden) Thilo W. Goetz (IBM Software - Germany) Howard Ho (IBM Research - Almaden) Rajasekar Krishnamurthy (IBM Research - Almaden) Alexander Lang (IBM Software - Germany) Yunyao Li (IBM Research - Almaden) Bin Liu (University of Michigan) Frederick R. Reiss (IBM Research - Almaden) Shivakumar Vaithyanathan (IBM Research - Almaden) Huaiyu Zhu (IBM Research - Almaden) ProApproX: A Lightweight Approximation Query Processor over Probabilistic Trees (Page 1295) Pierre Senellart (Institut Télécom; Télécom ParisTech) Asma Souihli (Institut Télécom; Télécom ParisTech) SPROUT²: A Squared Query Engine for Uncertain Web Data (Page 1299) Robert Fink (University of Oxford) Andrew Hogue (Google Inc.) Dan Olteanu (University of Oxford) Swaroop Rath (University of Oxford) Fuzzy Prophet: Parameter Exploration in Uncertain Enterprise Scenarios (Page 1303) Oliver Kennedy (École Polytechnique Fédérale de Lausanne) Steve Lee (Microsoft Corporation) Charles Loboz (Microsoft Corporation) Slawek Smyl (Microsoft Corporation) Suman Nath (Microsoft Research) LinkDB: A Probabilistic Linkage Database System (Page 1307) Ekaterini Ioannou (Technical University of Crete) Wolfgang Nejdl (L3S Research Center) Claudia Niederée (L3S Research Center) Yannis Velegrakis (University of Trento) (Return to Top) Demo Session 4: User Support and Development Environments CONFLuEnCE: CONtinuous workFLow ExeCution Engine (Page 1311) Panayiotis Neophytou (University of Pittsburgh) Panos K. Chrysanthis (University of Pittsburgh) Alexandros Labrinidis (University of Pittsburgh) Demonstration of Qurk: A Query Processor for Human Operators (Page 1315) Adam Marcus (Massachusetts Institute of Technology) Eugene Wu (Massachusetts Institute of Technology) David R. Karger (Massachusetts Institute of Technology) Samuel Madden (Massachusetts Institute of Technology) Robert C. Miller (Massachusetts Institute of Technology) Automatic Example Queries for Ad Hoc Databases (Page 1319) Bill Howe (University of Washington) Garret Cole (University of Washington) Nodira Khoussainova (University of Washington) Leilani Battle (University of Washington) (Return to Top) NetTrails: A Declarative Platform for Maintaining and Querying Provenance in Distributed Systems (Page 1323) Wenchao Zhou (University of Pennsylvania) Qiong Fei (University of Pennsylvania) Shengzhi Sun (University of Pennsylvania) Tao Tao (University of Pennsylvania) Andreas Haeberlen (University of Pennsylvania) Zachary Ives (University of Pennsylvania) Boon Thau Loo (University of Pennsylvania) Micah Sherr (Georgetown University) GBLENDER: Visual Subgraph Query Formulation Meets Query Processing (Page 1327) Changjiu Jin (Nanyang Technological University) Sourav S. Bhowmick (Nanyang Technological University) Xiaokui Xiao (Nanyang Technological University) Byron Choi (Hong Kong Baptist University) Shuigeng Zhou (Fudan University) Coordination Through Querying in the Youtopia System (Page 1331) Nitin Gupta (Cornell University) Lucja Kot (Cornell University) Gabriel Bender (Cornell University) Sudip Roy (Cornell University) Johannes Gehrke (Cornell University) Christoph Koch (École Polytechnique Fédérale de Lausanne) DBWiki: A Structured Wiki for Curated Data and Collaborative Data Management (Page 1335) Peter Buneman (University of Edinburgh) James Cheney (University of Edinburgh) Sam Lindley (University of Edinburgh) Heiko Müller (CSIRO) Rapid Development of Web-Based Query Interfaces for XML Datasets with QURSED (Page 1339) Abhijith Kashyap (SUNY at Buffalo) Michalis Petropoulos (SUNY at Buffalo)

14 Continuous obstructed nearest neighbor queries in spatial databases Yunjun Gao, Baihua Zheng Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers the impact of obstacles on the distance between objects, ... 15 Optimizing complex extraction programs over evolving text data Fei Chen, Byron J. Gao, AnHai Doan, Jun Yang, Raghu Ramakrishnan Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evolve over time, and so to keep extracted information up to date we ... 16 Privacy preservation of aggregates in hidden databases: why and how? Arjun Dasgupta, Nan Zhang, Gautam Das, Surajit Chaudhuri Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data Many websites provide form-like interfaces which allow users to execute search queries on the underlying hidden databases. In this paper, we explain the importance of protecting sensitive aggregate information of hidden databases from being ... 17 Efficient approximate entity extraction with edit distance constraints Wei Wang, Chuan Xiao, Xuemin Lin, Chengqi Zhang Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respect to a large dictionary of known entities, as the domain ... 18 Large-scale uncertainty management systems: learning and exploiting your data Shivnath Babu, Sudipto Guha, Kamesh Munagala Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data The database community has made rapid strides in capturing, representing, and querying uncertain data. Probabilistic databases capture the inherent uncertainty in derived tuples as probability estimates. Data acquisition and stream systems can ... 19 Data warehouse technology by infobright Dominik Slezak, Victoria Eastwood Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data We discuss Infobright technology with respect to its main features and architectural differentiators. We introduce the upcoming research and development projects that may be of special interest to the academic and industry communities. ... 20 Detecting and resolving unsound workflow views for correct provenance analysis Peng Sun, Ziyang Liu, Susan B. Davidson, Yi Chen Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data Workflow views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is carefully designed, it may not preserve the dataflow ... 21 Indexing correlated probabilistic databases Bhargav Kanagal, Amol Deshpande Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc., effectively managing and querying them has become an important ... 22 Cross-tier, label-based security enforcement for web applications Brian J. Corcoran, Nikhil Swamy, Michael Hicks Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data This paper presents SELinks, a programming language focused on building secure multi-tier web applications. SELinks provides a uniform programming model, in the style of LINQ and Ruby on Rails, with language syntax for accessing objects ... 23 Exploiting context analysis for combining multiple entity resolution systems Zhaoqi Chen, Dmitri V. Kalashnikov, Sharad Mehrotra Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data Entity Resolution (ER) is an important real world problem that has attracted significant research interest over the past few years. It deals with determining which object descriptions co-refer in a dataset. Due to its practical significance for ... 24 Kernel-based skyline cardinality estimation Zhenjie Zhang, Yin Yang, Ruichu Cai, Dimitris Papadias, Anthony Tung Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data The skyline of a d-dimensional dataset consists of all points not dominated by others. The incorporation of the skyline operator into practical database systems necessitates an efficient and effective cardinality estimation module. ... 25 Scalable skyline computation using object-based space partitioning Shiming Zhang, Nikos Mamoulis, David W. Cheung Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data The skyline operator returns from a set of multi-dimensional objects a subset of superior objects that are not dominated by others. This operation is considered very important in multi-objective analysis of large datasets. Although a large ...

这是前面的13篇论文 1 Keyword search on structured and semi-structured data Yi Chen, Wei Wang, Ziyang Liu, Xuemin Lin Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data 2 Efficient type-ahead search on relational data: a TASTIER approach Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng 3 FlashLogging: exploiting flash devices for synchronous logging performance Shimin Chen 4 Query processing techniques for solid state drives Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul A. Shah, Janet L. Wiener, Goetz Graefe 5 A revised r*-tree in comparison with related index structures Norbert Beckmann, Bernhard Seeger 6 ZStream: a cost-based query processor for adaptively detecting composite events Yuan Mei, Samuel Madden Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of user-specified event patterns. Recently, they have gained more attention in a variety of areas due to their powerful and expressive ... 7 A comparison of flexible schemas for software as a service Stefan Aulbach, Dean Jacobs, Alfons Kemper, Michael Seibold Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data A multi-tenant database system for Software as a Service (SaaS) should offer schemas that are flexible in that they can be extended different versions of the application and dynamically modified while the system is on-line. This ... 8 Query optimizers: time to rethink the contract? Surajit Chaudhuri Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data Query Optimization is expected to produce good execution plans for complex queries while taking relatively small optimization time. Moreover, it is expected to pick the execution plans with rather limited knowledge of data and without any ... 9 Keyword search in databases: the power of RDBMS Lu Qin, Jeffrey Xu Yu, Lijun Chang Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the interconnected tuple structures in an RDB ... 10 ROX: run-time optimization of XQueries Riham Abdel Kader, Peter Boncz, Stefan Manegold, Maurice van Keulen Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data Optimization of complex XQueries combining many XPath steps and joins is currently hindered by the absence of good cardinality estimation and cost models for XQuery. Additionally, the state-of-the-art of even relational query optimization still ... 11 Query by output Quoc Trung Tran, Chee-Yong Chan, Srinivasan Parthasarathy Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data It has recently been asserted that the usability of a database is as important as its capability. Understanding the database schema, the hidden relationships among attributes in the data all play an important role in this context. Subscribing ... 12 Ranking distributed probabilistic data Feifei Li, Ke Yi, Jeffrey Jestes Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where uncertainty and fuzzy information arise, data are collected from ... 13 Authenticated join processing in outsourced databases Yin Yang, Dimitris Papadias, Stavros Papadopoulos, Panos Kalnis Jun. 2009 Proceedings of the 35th SIGMOD international conference on Management of data Database outsourcing requires that a query server constructs a proof of result correctness, which can be verified by the client using the data owner's signature. Previous authentication techniques deal with range queries on a single relation ...

英语科技论文撰写与投稿（任胜利） 国家自然科学基金委员会 《自然科学进展》编辑部 共96页的PPT

方向关系描述了对象间的空间顺序关系.近年来,方向关系查询处理逐渐受到空间数据挖掘和地理信息系统等空间数据库应用领域研究者的关注.方向关系查询处理需要执行方向连接操作,目前有关空间连接的研究主要集中在拓扑关系和距离关系方面,而较少考虑方向关系.研究了基于R树的方向关系查询处理方法,定义了四元组模型表示对象MBR间的方向关系,提出了基于R树的处理方向关系查询过滤(filter)步骤的方法,并将提炼(refinement)步骤细化为3种不同的操作.所提出的方法能够高效处理任意对象间的方向关系查询.考虑到空间数据挖掘中方向关系查询通常是在满足一定距离约束条件的对象之间进行,还提出了一种同时利用方向和距离约束限制R树搜索空间的查询处理算法.实验证明,与不利用R树的方向关系查询处理方法相比,所提出的方法在I/O开销和CPU开销两方面都具有很高的性能.