DOCSLIB.ORG

Conference Program

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

CONFERENCE PROGRAM May 31 - June 4, 2015 Melbourne, Victoria, Australia http://www.sigmod2015.org/ ACM SIGMOD International Conference on Management of Data & ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems SIGMOD/PODS 2015 May 31 - June 4 Melbourne, Victoria, Australia http://www.sigmod2015.org/ Conference Program Copyright © 2015 Editors: Timos Sellis (RMIT University, Australia), Tova Milo (Tel Aviv University, Israel), Susan B. Davidson (University of Pennsylvania, USA), Zack Ives (University of Pennsylvania, USA), Diego Calvanese (Free University of Bozen-Bolzano, Italy), Huiping Cao (New Mexico State University), Xiang Lian (University of Texas - Pan American), Marco Montali (Free University of Bozen-Bolzano, Italy) Template: Yannis Velegrakis, Toronto 2004, Available for download at: http://db.disi.unitn.eu/pages/programBooklet Permission to use the template is granted, with the kind request to include the current notice in the booklet. TABLE OF CONTENTS Welcome Message From the SIGMOD Chairs Welcome Message From the PODS General and Program Chairs SIGMOD Conference Organization PODS Conference Organization Sponsors, Supporters, and Exhibitors Conference Venue Program at a Glance Session Contents Awards Keynotes Tutorials SIGMOD New Researcher Symposium SIGMOD Research Paper Abstracts SIGMOD Industrial Paper Abstracts SIGMOD Demonstration Abstracts PODS Paper Abstracts SIGMOD Travel Awards Ph.D. Workshop Participants Co-Located Workshops Local Information SIGMOD/PODS 2015 on Social Media WELCOME MESSAGE FROM THE SIGMOD CHAIRS Welcome to SIGMOD 2015 – officially, the 2015 ACM SIGMOD International Conference on the Management of Data! This year’s conference is being held in the beautiful cultural capital of Australia, Melbourne. During the Gold Rush period of the 19th Century, Melbourne was the richest city in the world, and as a result it is filled with many unique neighborhoods and distinctive buildings. In addition to wonderful neighborhoods to explore, the city has great museums and other cultural attractions, as well as a fine multi-cultural atmosphere. For those who would like to explore the outdoors, popular highlights are the Phillip Island Nature Park (90 minutes away), which features wild penguins who return in a parade each day at sunset, and the Great Ocean Road, one of the world's most scenic coastal drives, including the famous towering 12 Apostles. SIGMOD 2015’s exciting technical program reflects not only traditional topics, but the database community’s role in broader data science and data analytics. The keynote from Laura Haas, “The Power Behind the Throne: Information Integration in the Age of Data-Driven Discovery” highlights the role of database and data integration techniques in the growing field of data science. Jignesh Patel’s talk, “From Data to Insights @ Bare Metal Speed,” explains how hardware and software need to be co-evolved to support the needs of scalable data analytics. Jennifer Widom, winner of the 2015 ACM-W Athena Lecturer Award for fundamental contributions to computer science, will give her award talk, “Three Favorite Results,” on Tuesday. Christopher Ré will lead a panel on “Machine Learning and Databases: The Sound of Things to Come or a Cacophony of Hype?,” with participants Divyakant Agrawal, Magdalena Balazinska, Michael Cafarella, Michael Jordan, Tim Kraska, and Raghu Ramakrishnan. Of course, there are also 106 research paper presentations, 4 tutorials, 30 demonstrations, and 18 industrial papers. Papers will be presented both as talks during the research sessions, and as part of plenary Poster Sessions. SIGMOD 2015 is preceded by the PhD Workshop, as well as workshops on leading-edge topics like data analytics (DanaC), databases and the Web (WebDB), exploratory search (ExploreDB), managing and mining spatial data (GeoRich), and graph data (GRADES); the New Researcher Symposium will take place on Wednesday. The banquet will be held in a Melbourne landmark, the Town Hall. We are grateful to the many researchers who have shaped the conference program. Specific thanks go to the keynotes chair, Renée Miller; the panel chairs, Michael Franklin and Tova Milo; the tutorial chair, Wenfei Fan; the industrial program chairs, Sihem Amer-Yahia and Christopher Olston, as well as the industrial program committee members; the demonstrations chairs, Vanessa Braganholo and Juliana Freire, as well as the demonstration program committee members; the workshops chairs, Anastasia Ailamaki and Yi Chen; the undergraduate research chairs, Anisoara Nica and Anastasios Kementsietsidis; and the New Researcher Symposium chairs, Julia Stoyanovich and Alexandria Meliou. We would also like to express our immense gratitude to the members of the SIGMOD 2015 program committee and especially the “Group Leaders” who helped oversee the review process: Alin Deutsch, Yanlei Diao, Jens Dittrich, Luna Dong, Hank Korth, Alexandros Labrinidis, Feifei Li, Dan Olteanu, Jignesh Patel, Sunita Sarawagi, Pierre Senellart, Wang-Chiew Tan, Jun Yang, and Xiaofang Zhou. As in recent years, we had two submission deadlines for SIGMOD this year, one in August and one in November. The review process was journal-style, with multiple rounds of reviews coordinated by the Group Leaders. We accepted 34 of 137 papers from the first deadline and 72 of 278 from the second deadline. The total acceptance rate was about 25.5%, and we believe that the revision process has improved the quality of the technical program. We thank the members of the SIGMOD 2015 organizing committee, as well as the SIGMOD Executive Committee, for their invaluable help and guidance throughout the process leading up to the conference. The team includes the finance chair Xiuzhen Jenny Zhang, the publicity and social media chairs Egemen Tanin and Jagan Sankaranarayanan, the sponsorship chairs Nick Koudas and Mohamed Mokbel, the local arrangements chair Yanchun Zhang, the registration chair Arkady Zaslavsky, the demonstration and workshop local arrangements chair Benjamin Rubinstein, the web/information chair Kai (Kevin) Zheng, the travel award committee chairs Alexandra Meliou and Eugene Wu, the programming contest chair Thomas Neumann, and the wonderful team of ICE Australia who supported the whole organization. We also extend our appreciation to the student volunteers – the success of this conference is impossible without their 1 hard work and dedication. Finally, we benefited from a great deal of advice and help from Tamer Ozsu, as a former Program Chair, and K. Selçuk Candan, as both a liaison to the SIGMOD Executive and as a former SIGMOD General Chair. We are also grateful to the Microsoft Research Conference Management Toolkit (CMT) team for their extremely prompt and helpful support throughout the complex conference reviewing process. We thank the many SIGMOD 2015 supporters, whose contributions helped to keep the conference registration fees manageable, particularly for student attendees. Sponsors include: Platinum Level – Microsoft and Oracle; Gold Level – Facebook, Google, IBM Research, SAP, Tableau, and Twitter; and Silver Level – Intel and RMIT University. NEC has also supported SIGMOD 2015. In addition, Microsoft, Google, the National Science Foundation and the SIGMOD Executive Committee have generously funded the SIGMOD 2015 student travel award program. Google's donation enabled us to offer 2 travel awards, Microsoft's donation provided 18 travel awards, and the NSF grant covered another 18 travel awards. Finally, the SIGMOD EC provided 27 awards and covered all 65 free registrations for the student travel program awardees. Welcome to Melbourne, and we hope you enjoy the conference! Timos Sellis Susan Davidson and Zachary Ives Huiping Cao and Xiang Lian General Chair Program Co-Chairs Proceedings Co-Chairs 2 WELCOME MESSAGE FROM PODS GENERAL AND PROGRAM CHAIRS It is our great pleasure to welcome you to the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2015), held in Melbourne, Victoria, Australia, on May 31 – June 4, 2015, in conjunction with the 2015 ACM SIGMOD International Conference on Management of Data. Since the first edition of the symposium in 1982, the PODS papers are distinguished by a rigorous approach to widely diverse problems in data management, often bringing to bear techniques from a variety of different areas, including computational logic, finite model theory, computational complexity, algorithm design and analysis, programming languages, and artificial intelligence. The PODS Symposia study data management challenges in a variety of application contexts, including more recently probabilistic data, streaming data, graph data, information retrieval, ontology and semantic web, and data-driven processes and systems. PODS has a tradition of being the premier international conference on the theoretical and foundational aspects of data management, and the interested reader is referred to the PODS web pages at http://www.sigmod.org/the-pods-pages/ for information on the history of this conference series. This year’s symposium continues this tradition, but in addition the PODS Executive Committee decided to broaden the scope of PODS, and to explicitly invite for submission papers providing original, substantial contributions in one or more of the following categories: a) deep theoretical exploration of topical areas central to data management; b) new formal frameworks that aim at providing the basis for deeper theoretical investigation of important emerging issues in data management;
Recommended publications
  • Tarjan Transcript Final with Timestamps

    Tarjan Transcript Final with Timestamps

    A.M. Turing Award Oral History Interview with Robert (Bob) Endre Tarjan by Roy Levin San Mateo, California July 12, 2017 Levin: My name is Roy Levin. Today is July 12th, 2017, and I’m in San Mateo, California at the home of Robert Tarjan, where I’ll be interviewing him for the ACM Turing Award Winners project. Good afternoon, Bob, and thanks for spending the time to talk to me today. Tarjan: You’re welcome. Levin: I’d like to start by talking about your early technical interests and where they came from. When do you first recall being interested in what we might call technical things? Tarjan: Well, the first thing I would say in that direction is my mom took me to the public library in Pomona, where I grew up, which opened up a huge world to me. I started reading science fiction books and stories. Originally, I wanted to be the first person on Mars, that was what I was thinking, and I got interested in astronomy, started reading a lot of science stuff. I got to junior high school and I had an amazing math teacher. His name was Mr. Wall. I had him two years, in the eighth and ninth grade. He was teaching the New Math to us before there was such a thing as “New Math.” He taught us Peano’s axioms and things like that. It was a wonderful thing for a kid like me who was really excited about science and mathematics and so on. The other thing that happened was I discovered Scientific American in the public library and started reading Martin Gardner’s columns on mathematical games and was completely fascinated.
  • Qualitative and Quantitative Security Analyses for Zigbee Wireless Sensor Networks

    Qualitative and Quantitative Security Analyses for Zigbee Wireless Sensor Networks

    Downloaded from orbit.dtu.dk on: Sep 27, 2018 Qualitative and Quantitative Security Analyses for ZigBee Wireless Sensor Networks Yuksel, Ender; Nielson, Hanne Riis; Nielson, Flemming Publication date: 2011 Document Version Publisher's PDF, also known as Version of record Link back to DTU Orbit Citation (APA): Yuksel, E., Nielson, H. R., & Nielson, F. (2011). Qualitative and Quantitative Security Analyses for ZigBee Wireless Sensor Networks. Kgs. Lyngby, Denmark: Technical University of Denmark (DTU). (IMM-PHD-2011; No. 247). General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Qualitative and Quantitative Security Analyses for ZigBee Wireless Sensor Networks Ender Y¨uksel Kongens Lyngby 2011 IMM-PHD-2011-247 Technical University of Denmark Informatics and Mathematical Modelling Building 321, DK-2800 Kongens Lyngby, Denmark Phone +45 45253351, Fax +45 45882673 [email protected] www.imm.dtu.dk IMM-PHD: ISSN 0909-3192 Summary Wireless sensor networking is a challenging and emerging technology that will soon become an inevitable part of our modern society.
  • Finding Rising Stars in Co-Author Networks Via Weighted Mutual Influence

    Finding Rising Stars in Co-Author Networks Via Weighted Mutual Influence

    Finding Rising Stars in Co-Author Networks via Weighted Mutual Influence Ali Daud a,b Naif Radi Aljohani a Rabeeh Ayaz Abbasi a,c a Faculty of Computing and a Faculty of Computing and c Department of Computer Science, Information Technology, King Information Technology, King Quaid-i-Azam University, Islamabad, Abdulaziz University, Jeddah, Saudi Abdulaziz University, Jeddah, Saudi Pakistan Arabia Arabia [email protected] [email protected] [email protected] b b d Zahid Rafique Tehmina Amjad Hussain Dawood b Department of Computer Science b Department of Computer Science d Faculty of Computing and and Software Engineering, and Software Engineering, Information Technology, University International Islamic University, International Islamic University, of Jeddah, Jeddah, Saudi Arabia Islamabad, Pakistan Islamabad, Pakistan [email protected] [email protected] [email protected] a Khaled H. Alyoubi a Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah, Saudi Arabia [email protected] ABSTRACT KEYWORDS Finding rising stars is a challenging and interesting task which is Bibliographic databases; Citations; Author Order; Rising Stars; Mutual being investigated recently in co-author networks. Rising stars are Influence; Co-Author Networks authors who have a low research profile in the start of their career but may become experts in the future. This paper introduces a new method Weighted Mutual Influence Rank (WMIRank) for finding 1. INTRODUCTION rising stars. WMIRank exploits influence of co-authors’ citations, The rapid evolution of scientific research has created large order of appearance and publication venues. Comprehensive volumes of publications every year, and is expected to continue in experiments are performed to analyze the performance of near future [21].
  • Moshe Y. Vardi

    Moshe Y. Vardi

    MOSHE Y. VARDI Address Office Home Department of Computer Science 4515 Merrie Lane Rice University Bellaire, TX 77401 P.O.Box 1892 Houston, TX 77251-1892 Tel: (713) 348-5977 Tel: (713) 665-5900 Fax: (713) 348-5930 Fax: (713) 665-5900 E-mail: [email protected] URL: http://www.cs.rice.edu/∼vardi Research Interests Applications of logic to computer science: • database systems • complexity theory • multi-agent systems • specification and verification of hardware and software Education Sept. 1974 B.Sc. in Physics and Computer Science (Summa cum Laude), Bar-Ilan University, Ramat Gan, Israel May 1980 M.Sc. in Computer Science, The Feinberg Graduate School, The Weizmann Insti- tute of Science, Rehovoth, Israel Thesis: Axiomatization of Functional and Join Dependencies in the Relational Model. Advisors: Prof. C. Beeri (Hebrew University) Prof. P. Rabinowitz Sept 1981 Ph.D. in Computer Science, Hebrew University, Jerusalem, Israel Thesis: The Implication Problem for Data Dependencies in the Relational Model. Advisor: Prof. C. Beeri Professional Experience Nov. 1972 – June 1973 Teaching Assistant, Dept. of Mathematics, Bar-Ilan University. Course: Introduction to computing. 1 Nov. 1978 – June 1979 Programmer, The Weizmann Institute of Science. Assignments: implementing a discrete-event simulation package and writing input-output routines for a database management system. Feb. 1979 – Oct. 1980 Research Assistant, Inst. of Math. and Computer Science, The Hebrew University of Jerusalem. Research subject: Theory of data dependencies. Nov. 1980 – Aug. 1981 Instructor, Inst. of Math. and Computer Science, The Hebrew University of Jerusalem. Course: Advanced topics in database theory. Sep. 1981 – Aug. 1983 Postdoctoral Scholar, Dept. of Computer Science, Stanford Univer- sity.
  • Michael Oser Rabin Automata, Logic and Randomness in Computation

    Michael Oser Rabin Automata, Logic and Randomness in Computation

    Michael Oser Rabin Automata, Logic and Randomness in Computation Luca Aceto ICE-TCS, School of Computer Science, Reykjavik University Pearls of Computation, 6 November 2015 \One plus one equals zero. We have to get used to this fact of life." (Rabin in a course session dated 30/10/1997) Thanks to Pino Persiano for sharing some anecdotes with me. Luca Aceto The Work of Michael O. Rabin 1 / 16 Michael Rabin's accolades Selected awards and honours Turing Award (1976) Harvey Prize (1980) Israel Prize for Computer Science (1995) Paris Kanellakis Award (2003) Emet Prize for Computer Science (2004) Tel Aviv University Dan David Prize Michael O. Rabin (2010) Dijkstra Prize (2015) \1970 in computer science is not classical; it's sort of ancient. Classical is 1990." (Rabin in a course session dated 17/11/1998) Luca Aceto The Work of Michael O. Rabin 2 / 16 Michael Rabin's work: through the prize citations ACM Turing Award 1976 (joint with Dana Scott) For their joint paper \Finite Automata and Their Decision Problems," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept. ACM Paris Kanellakis Award 2003 (joint with Gary Miller, Robert Solovay, and Volker Strassen) For \their contributions to realizing the practical uses of cryptography and for demonstrating the power of algorithms that make random choices", through work which \led to two probabilistic primality tests, known as the Solovay-Strassen test and the Miller-Rabin test". ACM/EATCS Dijkstra Prize 2015 (joint with Michael Ben-Or) For papers that started the field of fault-tolerant randomized distributed algorithms.
  • Candidate for President (1 July 2018 – 30 June 2020) Jack Davidson

    Candidate for President (1 July 2018 – 30 June 2020) Jack Davidson

    Candidate for President (1 July 2018 – 30 June 2020) Jack Davidson Professor of Computer Science University of Virginia Charlottesville, VA U.S.A. BIOGRAPHY Education and Employment • B.A.S. (Computer Science) Southern Methodist University, 1975; M.S. (Computer Science) Southern Methodist University, 1977; Ph.D. (Computer Science) University of Arizona, 1981. • University of Virginia, Professor, 1982–present. • President, Zephyr Software, 2001–present. • Princeton University, Visiting Professor, 1992–1993. • Microsoft Research, Visiting Researcher, 2000–2001. • Programmer Analyst III, University of Texas Health Science Center at Dallas, 1993–1997. ACM and SIG Activities • ACM member since 1975. • ACM Publications Board Co-Chair, 2010–present; ACM Publications Board member, 2007–2010. • ACM Student Chapter Excellence Award Judge, 2010–2017. • ACM Student Research Competition Grand Finals Judge, 2011–2017. • Associate Editor, ACM TOPLAS, 1994–2000. Associate Editor, ACM TACO, 2005–2016. Member of SIGARCH, SIGBED, SIGCAS, SIGCSE, and SIGPLAN • SIGPLAN Chair, 2005–2007. • SIGPLAN Executive Committee, 1999–2001, 2003–2005. • SGB Representative to ACM Council, 2008–2010. • SGB Executive Committee, 2006–2008. Awards and Honors • DARPA Cyber Grand Challenge Competition, 2nd Place, $1M prize (2016) • ACM Fellow (2008). • IEEE Computer Society Taylor L. Booth Education Award (2008). • UVA ACM Student Chapter Undergraduate Teaching Award (2000). • NCR Faculty Innovation Award (1994). Jack Davidson’s research interests include compilers, computer architecture, system software, embedded systems, computer security, and computer science education. He is co-author of two introductory textbooks: C++ Program Design: An Introduction to Object Oriented Programming and Java 5.0 Program Design: An Introduction to Programming and Object-oriented Design. Professionally, he has helped organize many conferences across several fields.
  • David C. Parkes John A

    David C. Parkes John A

    David C. Parkes John A. Paulson School of Engineering and Applied Sciences, Harvard University, 33 Oxford Street, Cambridge, MA 02138, USA www.eecs.harvard.edu/~parkes December 2020 Citizenship: USA and UK Date of Birth: July 20, 1973 Education University of Oxford Oxford, U.K. Engineering and Computing Science, M.Eng (first class), 1995 University of Pennsylvania Philadelphia, PA Computer and Information Science, Ph.D., 2001 Advisor: Professor Lyle H. Ungar. Thesis: Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency Appointments George F. Colony Professor of Computer Science, 7/12-present Cambridge, MA Harvard University Co-Director, Data Science Initiative, 3/17-present Cambridge, MA Harvard University Area Dean for Computer Science, 7/13-6/17 Cambridge, MA Harvard University Harvard College Professor, 7/12-6/17 Cambridge, MA Harvard University Gordon McKay Professor of Computer Science, 7/08-6/12 Cambridge, MA Harvard University John L. Loeb Associate Professor of the Natural Sciences, 7/05-6/08 Cambridge, MA and Associate Professor of Computer Science Harvard University Assistant Professor of Computer Science, 7/01-6/05 Cambridge, MA Harvard University Lecturer of Operations and Information Management, Spring 2001 Philadelphia, PA The Wharton School, University of Pennsylvania Research Intern, Summer 2000 Hawthorne, NY IBM T.J.Watson Research Center Research Intern, Summer 1997 Palo Alto, CA Xerox Palo Alto Research Center 1 Other Appointments Member, 2019- Amsterdam, Netherlands Scientific Advisory Committee, CWI Member, 2019- Cambridge, MA Senior Common Room (SCR) of Lowell House Member, 2019- Berlin, Germany Scientific Advisory Board, Max Planck Inst. Human Dev. Co-chair, 9/17- Cambridge, MA FAS Data Science Masters Co-chair, 9/17- Cambridge, MA Harvard Business Analytics Certificate Program Co-director, 9/17- Cambridge, MA Laboratory for Innovation Science, Harvard University Affiliated Faculty, 4/14- Cambridge, MA Institute for Quantitative Social Science International Fellow, 4/14-12/18 Zurich, Switzerland Center Eng.
  • Acm Council on Women Hails Innovator in Information Retrieval

    Acm Council on Women Hails Innovator in Information Retrieval

    Contact: Virginia Gold 212-626-0505 [email protected] ACM COUNCIL ON WOMEN HAILS INNOVATOR IN INFORMATION RETRIEVAL Microsoft Research’s Dumais Changed the Way People Search for Information NEW YORK, April 8, 2014 – ACM-W (the Association for Computing Machinery’s Council on Women in Computing) today named Susan T. Dumais of Microsoft Research as the 2014-2015 Athena Lecturer. Dumais introduced novel algorithms and interfaces for interactive retrieval that have made it easier for people to find, use and make sense of information. Her research, at the intersection of human-computer interaction and information retrieval, has broad applications for understanding and improving searching and browsing from the Internet to the desktop. The Athena Lecturer award celebrates women researchers who have made fundamental contributions to computer science. It includes a $10,000 honorarium provided by Google Inc. “Dumais has helped us understand that the search is not the end goal,” said Mary Jane Irwin, who heads the ACM-W awards committee. “Her focus is on understanding when and why people search, and presenting results in context to help integrate those results into the larger search process. Her sustained contributions have shaped the thinking and direction of human-computer interaction and information retrieval, and influenced generations of student interns through collaborative projects with academic and industry partners.” Dumais’ initial research demonstrated that different people use different vocabulary to describe the same thing, and that this mismatch limits the success of traditional keyword-based information retrieval methods. To build search systems that avoided the vocabulary problem, she and her colleagues invented Latent Semantic Indexing (LSI).
  • ACM JDIQ) October 31, 2006

    ACM JDIQ) October 31, 2006

    PROPOSAL FOR A NEW ACM PUBLICATION: ACM Journal of Data and Information Quality (ACM JDIQ) October 31, 2006 Contacts for the proposed ACM Journal of Data and Information Quality (ACM JDIQ) Dr. Yang Lee Phone and email: MIS-EIC (617) 373-5052 Associate Professor (617) 739-9367 (fax) College of Business Administration [email protected] Northeastern University 214 Hayden Hall 360 Huntington Avenue Boston, MA 021115-5000 Dr. Stuart Madnick Phone and email: CS-EIC (617) 253-6671 J N Maguire Professor of Information Technology and (617) 253-3321 (fax) Professor of Engineering Systems [email protected] Massachusetts Institute of Technology Room E53-321 Cambridge, MA 02142 Dr. Elizabeth Pierce Phone and email: Managing Editor (501) 569-3488 Associate Professor (501) 569-7049 (fax) Department of Information Science [email protected] University of Arkansas at Little Rock ETAS Building, Room 258 2801 South University Avenue Little Rock, Arkansas 72204 1. JUSTIFICATION 1.1 Background for this Proposal Today’s organizations are increasingly investing in technology to collect, store, and process vast volumes of data. Even so, they often find themselves stymied in their efforts to translate this data into meaningful insights that can be used to improve business processes and to make better decisions. The reasons for this difficulty can often be traced to issues of quality. These involve both technical issues, such as that the data collected may be inconsistent, inaccurate, incomplete, or out-of-date as well as the fact that many organizations lack a cohesive strategy across the enterprise to ensure that the right stakeholders have the right information in the right format at the right place and time.
  • Datalog Unchained

    Datalog Unchained

    Datalog Unchained Victor Vianu UC San Diego & Inria [email protected] ABSTRACT robust class of fixpoint queries, previously defined by extensions of This is the companion paper of a talk in the Gems of PODS se- first-order logic with a fixpoint operator. ries, that reviews the development, starting at PODS 1988, of a The two PODS 1988 articles initiated a line of research [3, 6, 8, family of Datalog-like languages with procedural, forward chain- 14, 15, 104, 116] that extended the forward chaining approach to an ing semantics, providing an alternative to the classical declarative, entire family of Datalog-like languages, providing an alternative model-theoretic semantics. These languages also provide a unified paradigm for database queries, with natural counterparts to classical formalism that can express important classes of queries including query languages including the fixpoint and while queries, and all the fixpoint, while, and all computable queries. They can also incor- way to computable queries. The forward chaining approach turned porate in a natural fashion updates and nondeterminism. Datalog out to also be suitable for studying nondeterministic languages, variants with forward chaining semantics have been adopted in a yielding an appealing unifying formalism. The present paper tells variety of settings, including active databases, production systems, the story of this development. distributed data exchange, and data-driven reactive systems. After a brief review of classical query languages, we turn to Datalog and its extensions. We begin with an informal overview of ACM Reference Format: Datalog and Datalog: with stratified and well-founded semantics. Victor Vianu. 2021. Datalog Unchained.
  • Proposal) RA PTIME X⊆ + ⊇ X⊇ X X

    Proposal) RA PTIME X⊆ + ⊇ X⊇ X X

    U4U - Taming Uncertainty with Uncertainty-Annotated Databases Division: CISE/IIS/III Boris Glavic, Oliver Kennedy, Atri Rudra Keywords: Uncertainty; Incomplete Databases; Certain Answers survey 1 Overview AgeRange Zip Gender Commute Uncertainty is prevalent in data analysis, no matter 1 18-24 10003 M 1 hour what the size of the data, the application domain, or the 2 24-36 10003 M 90 3 37-45 10007 NULL 50 min type of analysis. Common sources of uncertainty include 4 0-18 10007 F 40 min missing values, sensor errors and noise, bias, outliers, 5 NULL 14260 F 1 mismatched data, and many more. If ignored, data uncer- 6 0-18 14260 Other 70 min tainty can result in hard to trace errors in analytical results, Figure 1: Example input with missing values which in turn can have severe real world implications like unfounded scientific discoveries, financial damages, or even effects on people’s physical well-being (e.g., medical decisions based on incorrect data). Example 1 Consider the example dataset survey in Figure1, which illustrates responses to a survey of com- muters, with one row per response. Several NULL values indicate omitted responses. Commute (duration) is a free-text response and follows multiple response formats. Several of these (in red) lack units, can not be parsed, and are consequently replaced with NULL. A data scientist explores this data with the query: SELECT Zip,AVG(Commute)FROM surveyWHERE Gender = 'F'GROUPBY Zip SQL’s NULL value semantics would silently exclude rows 2, 3 and 5 when computing results. Dropping records that contain missing data is one commonly used approach to managing uncertainty in data science, but by no means the only one.
  • SIGCHI Executive Committee Meeting Notes 2014/10

    SIGCHI Executive Committee Meeting Notes 2014/10

    SIGCHI EC agenda ­ Honolulu, Hawaii, USA October 9­11, 2014 October 9 Gerrit van der Veer, Allison Druin, Philippe Palanque, Rob Jacob, Fred Sampson, Gary Olson, Scooter Morris, Patrick Kelley, Zhengjie Liu, Ashley Cozzi, John Thomas, Jonathan Lazar, Dan Olsen Apologies: Elizabeth Churchill, Jenny Preece, John Karat, Jofish Kaye, Kia Hook, Tuomo Kujala Various Issues: ● Sig Governing Board retiree task force (and JohnT’s suggestion) ○ Draft from Jonathan Grudin, Ron Baecker, John Thomas: Seniors for CHI, CHI for Seniors Ron Baecker, Jonathan Grudin, John Thomas Gerrit to send email to EC­DONE Gerrit needs some feedback to bring to SIG Governing Board ● One of the SIGs have been developing “Playing cards of notable women in computing” This will be a kickstarter project, launching very soon (at Grace Hopper?) Details: http://www.cs.duke.edu/csed/wikipedia/cards.html Big: http://www.cs.duke.edu/csed/wikipedia/notableWomenWebPoster.jpg ● Publishing the minutes from the *May* Toronto meeting ○ Allison to work with Fred on re­doing Students and Leaders: ● Scholarships­ ○ Gary Marsden Honoring: ■ Work with/collaborate with University and check with Family ■ Gary Olson to lead this effort & will involve others (Matt Jones, Susan Dray) ○ NEED Conference Scholarships for all SIGCHI sponsored Conferences ■ Scooter to take it to the CMC ● Mentoring ○ John T to chair: Create a light­weight policy for mentoring proposal­ Allison & Scooter to help­DONE ● Awards ○ Actually looking for nominations (CHI Academy + others) – Nov 15th ○ Patrick to share this info with the rest of the SIGCHI community through social media ○ Rob & Dan to find out awards status from Loren ■ Two Turing awards continuing forward ■ Several ACM Fellows continuing forward ■ This is starting to operate organically within the community.