当前期刊: ACM SIGMOD Record Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Massively Parallel Join Algorithms
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-12-17
    Xiao Hu; Ke Yi

    Due to the rapid development of massively parallel data processing systems such as MapReduce and Spark, there have been revived interests in designing algorithms in a massively parallel computational model. Computing multi-way joins, as one of the central algorithmic problems in databases, has received much attention recently. This paper surveys some of the recent algorithms, as well as lower bounds

    更新日期:2020-12-18
  • Data Preparation: A Survey of Commercial Tools
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-12-17
    Mazhar Hameed; Felix Naumann

    Raw data are often messy: they follow different encodings, records are not well structured, values do not adhere to patterns, etc. Such data are in general not fit to be ingested by downstream applications, such as data analytics tools, or even by data management systems. The act of obtaining information from raw data relies on some data preparation process. Data preparation is integral to advanced

    更新日期:2020-12-18
  • Goetz Graefe Speaks Out on (Not Only) Query Optimization
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-12-17
    Marianne Winslett; Vanessa Braganholo

    Welcome to ACM SIGMOD Record's series of interviews with distinguished members of the database community. I'm Marianne Winslett, and today we are at the 2017 SIGMOD and PODS conference in Chicago. I have here with me Goetz Graefe, who is the recipient of the SIGMOD Innovations Award, the SIGMOD Test of Time Award, the ICDE Distinguished Paper Award, and the ACM Software System Award, all for his work

    更新日期:2020-12-18
  • Applied Research Lessons from CloudViews Project
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-12-17
    Alekh Jindal

    Industry research has a rich legacy in computer science [9]. However, as opposed to the blue-sky approach to research, increasingly there is a trend to align industry research more closely with the products. This is manifested in several new trends in industry research: (i) emphasis on product impact, e.g., improving existing products or seeing new ones coming around the bend, (ii) popularity of blended

    更新日期:2020-12-18
  • Advice from SIGMOD/PODS 2020
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-12-17
    David Maier; Rachel Pottinger; AnHai Doan; Eduard Dragut; Bill Howe; Joanne Lateulere; John Lateulere; Mostafa Milani; Tilmann Rabl; Dan Suciu; Yufei Tao; Wang-Chiew Tan; Kristin Tufte

    This document collects the experiences and advice from the organizers of the SIGMOD/PODS 2020, which shifted on short notice to an online-only conference. It is mainly intended for others who are organizing online conferences, but some of it may be of use in the future to people organizing ?live? conferences with an online component.

    更新日期:2020-12-18
  • Poly'19 Workshop Summary: GDPR
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-12-17
    Michael Stonebraker; Timothy Mattson; Tim Kraska; Vijay Gadepally

    Data privacy within the context of heterogenous data and data management systems continues to be an important issue. At the Poly?19 workshop, held in conjunction with VLDB 2019 in Los Angeles, CA, one of the major themes explored was the implication of data privacy regulations such as GDPR to systems composed of multiple heterogenous databases. This summary outlines some of the major approaches and

    更新日期:2020-12-18
  • The Expressive Power of Graph Neural Networks as a Query Language
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-12-09
    Pablo Barceló; Egor V. Kostylev; Mikaël Monet; Jorge Pérez; Juan L. Reutter; Juan-Pablo Silva

    In this paper we survey our recent results characterizing various graph neural network (GNN) architectures in terms of their ability to classify nodes over graphs, for classifiers based on unary logical formulas- or queries. We focus on the language FOC2, a well-studied fragment of FO. This choice is motivated by the fact that FOC2 is related to theWeisfeiler-Lehman (WL) test for checking graph isomorphism

    更新日期:2020-12-10
  • Sketches of Dynamic Complexity
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-12-09
    Thomas Schwentick; Nils Vortmeier; Thomas Zeume

    How can the result of a query be updated after changing a database? This is a fundamental task for database management systems which ideally takes previously computed information into account. In dynamic complexity theory, it is studied from a theoretical perspective where updates are specified by rules written in first-order logic. In this article we sketch recent techniques and results from dynamic

    更新日期:2020-12-10
  • Making AI Machines Work for Humans in FoW
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-12-09
    Sihem Amer-Yahia; Senjuti Basu Roy; Lei Chen; Atsuyuki Morishima; James Abello Monedero; Pierre Bourhis; François Charoy; Marina Danilevsky; Gautam Das; Gianluca Demartini; Shady Elbassuoni; David Gross-Amblard; Emilie Hoareau; Munenari Inoguchi; Jared Kenworthy; Itaru Kitahara; Dongwon Lee; Yunyao Li; Ria Mae Borromeo; Paolo Papotti; Raghav Rao; Sudeepa Roy; Pierre Senellart; Keishi Tajima; Saravanan

    The Future of Work (FoW) is witnessing an evolution where AI systems (broadly machines or businesses) are used to the benefit of humans. Work here refers to all forms of paid and unpaid labor in both physical and virtual workplaces and that is enabled by AI systems. This covers crowdsourcing platforms such as Amazon Mechanical Turk, online labor marketplaces such as TaskRabbit and Qapa, but also regular

    更新日期:2020-12-10
  • Provenance in Collaborative in Silico Scientific Research: a Survey
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-12-09
    Eduardo Jandre; Bruna Diirr; Vanessa Braganholo

    Science is a collaborative activity by definition. Research is usually conducted by several scientists working together, and this behavior has been intensified in recent years. Furthermore, experiments are increasingly performed in silico, which demands proper support tools. Provenance-aware Workflow Management Systems and script-based tools have been popular ways of running in silico experiments,

    更新日期:2020-12-10
  • Susan Davidson Speaks Out on Collaborating with Other Research Areas and Balancing Work and Family
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-12-09
    Susan Davidson

    Welcome to ACM SIGMOD Records series of interviews with distinguished members of the database community. I'm Marianne Winslett, and today we're at the 2017 SIGMOD and PODS conference in Chicago. I have with me Susan Davidson, who's a professor at the University of Pennsylvania. Sue is an ACM Fellow, a Corresponding Fellow of the Royal Society of Edinburgh, and the recipient of the 2017 IEEE Technical

    更新日期:2020-12-10
  • Report on the Second International Workshop on Semantic Web Meets Health Data Management (SWH 2019)
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-12-09
    Haridimos Kondylakis; Kostas Stefanidis; Praveen Rao; Dave Parry

    The advancements in health-care have brought to the foreground the need for flexible access to health-related information and created an ever-growing demand for efficient data management infrastructures. To this direction, many challenges must be first overcome, enabling seamless, effective and efficient access to several health data sets and novel methods for exploiting the existing information. The

    更新日期:2020-12-10
  • Technical Perspective: Checking Invariant Confluence, In Whole or In Parts
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Johannes Gehrke

    Never make a promise - you may have to keep it. - Neil Jordan Database systems were known to provide strong consistency guarantees. As an example, database textbook defines the ACID guarantees as "four important properties of transactions to maintain data in the face of concurrent access and system failures" [2]. Beyond atomicity, consistency, and durability, the "I" in ACID is loosely defined as "Users

    更新日期:2020-09-05
  • Checking Invariant Confluence, In Whole or In Parts
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Michael Whittaker; Joseph M. Hellerstein

    Strongly consistent distributed systems are easy to reason about but face fundamental limitations in availability and performance. Weakly consistent systems can be implemented with very high performance but place a burden on the application developer to reason about complex interleavings of execution. Invariant confluence provides a formal framework for understanding when we can get the best of both

    更新日期:2020-09-05
  • Technical Perspective of Concurrent Prefix Recovery: Performing CPR on a Database
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Philip A. Bernstein

    Where do novel database system research results come from? In the 1970's, most systems research papers proposed mechanisms to support abstractions that were being explored for the first time, such as data translation, indexing, query optimization, high performance transactions, distributed databases, heterogeneous databases, and replicated databases. Novelty was easy to come by. These abstractions

    更新日期:2020-09-05
  • Concurrent Prefix Recovery: Performing CPR on a Database
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Guna Prasaad; Badrish Chandramouli; Donald Kossmann

    This paper proposes a new recovery model based on group commit, called concurrent prefix recovery (CPR). CPR differs from traditional group commit implementations in two ways: (1) it provides a semantic description of committed operations, of the form "all operations until time ti from session i"; and (2) it uses asynchronous incremental checkpointing instead of a WAL to implement group commit in a

    更新日期:2020-09-05
  • Technical Perspective: Constant-Delay Enumeration for Nondeterministic Document Spanners
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Benny Kimelfeld

    The challenge of extracting structured information from text, or sequential data in general, is prevalent across a multitude of data-science domains. This challenge, known as Information Extraction (IE), instantiates to core components in text analytics, and a plethora of IE paradigms have been developed over the past decades. Rules and rule systems have consistently been key components in such paradigms

    更新日期:2020-09-05
  • Constant-Delay Enumeration for Nondeterministic Document Spanners
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Antoine Amarilli; Pierre Bourhis; Stefan Mengel; Matthias Niewerth

    One of the classical tasks in information extraction is to extract subparts of texts through regular expressions. In the database theory literature, this approach has been generalized and formalized as document spanners. In this model, extraction is performed by evaluating a particular kind of automata, called a sequential variable-set automaton (VA). The efficiency of this task is then measured in

    更新日期:2020-09-05
  • Technical Perspective: Database Repair Meets Algorithmic Fairness
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Lise Getoor

    There has been an explosion of interest in fairness in machine learning. In large part, this has been motivated by societal issues highlighted in a string of well publicized cases such as gender biased job recommendation and racially biased criminal risk prediction algorithms. Both the recognition of the potential disparate impacts of machine learning due to historical bias in the data and the realization

    更新日期:2020-09-05
  • Database Repair Meets Algorithmic Fairness
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Babak Salimi; Bill Howe; Dan Suciu

    Fairness is increasingly recognized as a critical component of machine learning systems. However, it is the underlying data on which these systems are trained that often reflect discrimination, suggesting a database repair problem. Existing treatments of fairness rely on statistical correlations that can be fooled by anomalies, such as Simpson's paradox. Proposals for causality-based definitions of

    更新日期:2020-09-05
  • Technical Perspective: Declarative Recursive Computation on an RDBMS
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Matthias Boehm

    From a historical perspective, relational database management systems (RDBMSs) have integrated many specialized systems and data models back into the RDBMS over time. New workloads motivated specialized systems for performance, but over time, general-purpose RDBMSs absorbed this functionality to avoid boundary crossing. We already witnessed this process for object-relational functionality, XML and

    更新日期:2020-09-05
  • Declarative Recursive Computation on an RDBMS: or, Why You Should Use a Database For Distributed Machine Learning
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Dimitrije Jankov; Shangyu Luo; Binhang Yuan; Zhuhua Cai; Jia Zou; Chris Jermaine; Zekai J. Gao

    We explore the close relationship between the tensor-based computations performed during modern machine learning, and relational database computations. We consider how to make a very small set of changes to a modern RDBMS to make it suitable for distributed learning computations. Changes include adding better support for recursion, and optimization and execution of very large compute plans. We also

    更新日期:2020-09-05
  • Technical Perspective: Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Reinhard Pichler

    Traditionally, by query answering we mean the problem of finding all answers to a given query over a given database. But what happens if the number of answers is prohibitively big - which may easily occur in a Big Data context? In such situations, it seems preferable to have a mechanism that produces one answer after the other with certain guarantees on the time between any two outputs and to let the

    更新日期:2020-09-05
  • Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Marcelo Arenas; Luis Alberto Croquevielle; Rajesh Jayaram; Cristian Riveros

    We study two simple yet general complexity classes, which provide a unifying framework for efficient query evaluation in areas like graph databases and information extraction, among others. We investigate the complexity of three fundamental algorithmic problems for these classes: enumeration, counting and uniform generation of solutions, and show that they have several desirable properties in this

    更新日期:2020-09-05
  • Technical Perspective: Query Optimization for Faster Deep CNN Explanations
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Sebastian Schelter

    Machine learning (ML) is increasingly used to automate decision making in various domains. In recent years, ML has not only been applied to tasks that use structured input data, but also, tasks that operate on data with less strictly defined structure such as speech, images and videos. Prominent examples are speech recognition for personal assistants or face recognition for boarding airplanes.

    更新日期:2020-09-05
  • Query Optimization for Faster Deep CNN Explanations
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Supun Nakandala; Arun Kumar; Yannis Papakonstantinou

    Deep Convolutional Neural Networks (CNNs) now match human accuracy in many image prediction tasks, resulting in a growing adoption in e-commerce, radiology, and other domains. Naturally, "explaining" CNN predictions is a key concern for many users. Since the internal workings of CNNs are unintuitive for most users, occlusion-based explanations (OBE) are popular for understanding which parts of an image

    更新日期:2020-09-05
  • Technical Perspective: Revealing Every Story of Data in Blockchain Systems
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Yaron Kanza

    For many applications, data are worthy only if they are trustworthy. The concept of trust is sometimes elusive, and yet it is fundamental in data management. Even when not expressed explicitly, the correctness of computations and reliability of applications depend on trustworthy management of the data. These notions received new attention with the advent of blockchain and distributed ledger technology

    更新日期:2020-09-05
  • Revealing Every Story of Data in Blockchain Systems
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-09-04
    Pingcheng Ruan; Tien Tuan Anh Dinh; Qian Lin; Meihui Zhang; Gang Chen; Beng Chin Ooi

    The success of Bitcoin and other cryptocurrencies bring enormous interest to blockchains. A blockchain system implements a tamper-evident ledger for recording transactions that modify some global states. The system captures the entire evolution history of the states. The management of that history, also known as data provenance or lineage, has been studied extensively in database systems. However,

    更新日期:2020-09-05
  • Limit Datalog: A Declarative Query Language for Data Analysis
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-02-25
    Bernardo Cuenca Grau; Ian Horrocks; Mark Kaminski; Egor V. Kostylev; Boris Motik

    Motivated by applications in declarative data analysis, we study DatalogZ-an extension of Datalog with stratified negation and arithmetics over integers. Reasoning in this language is undecidable, so we present a fragment, called limit DatalogZ, that is powerful enough to naturally capture many important data analysis tasks. In limit DatalogZ, all intensional predicates with a numeric argument are

    更新日期:2020-02-25
  • Hardware-Conscious Stream Processing: A Survey
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-02-25
    Shuhao Zhang; Feng Zhang; Yingjun Wu; Bingsheng He; Paul Johns

    Data stream processing systems (DSPSs) enable users to express and run stream applications to continuously process data streams. To achieve realtime data analytics, recent researches keep focusing on optimizing the system latency and throughput. Witnessing the recent great achievements in the computer architecture community, researchers and practitioners have investigated the potential of adoption

    更新日期:2020-02-25
  • Domain- and Structure-Agnostic End-to-End Entity Resolution with JedAI
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-02-25
    George Papadakis; Leonidas Tsekouras; Emmanouil Thanos; George Giannakopoulos; Themis Palpanas; Manolis Koubarakis

    We present JedAI, a new open-source toolkit for endto- end Entity Resolution. JedAI is domain-agnostic in the sense that it does not depend on background expert knowledge, applying seamlessly to data of any domain with minimal human intervention. JedAI is also structure-agnostic, as it can process any type of data, ranging from structured (relational) to semi-structured (RDF) and un-structured (free-text)

    更新日期:2020-02-25
  • Natassa Ailamaki Speaks Out on How to be a Systems Researcher and How to Manage a Large Research Group
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-02-25
    Marianne Winslett; Vanessa Braganholo

    Welcome to ACM SIGMOD Record's series of interviews with distinguished members of the database community. I'm Marianne Winslett, and today we're at the 2017 SIGMOD and PODS conference in Chicago. I have here with me Anastasia Ailamaki, who's a professor at the Swiss Federal Institute of Technology, better known as EPFL. Before that, Natassa was a professor at Carnegie Mellon. She's an ACM Fellow, a

    更新日期:2020-02-25
  • The Seattle Report on Database Research
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-02-25
    Daniel Abadi; Anastasia Ailamaki; David Andersen; Peter Bailis; Magdalena Balazinska; Philip Bernstein; Peter Boncz; Surajit Chaudhuri; Alvin Cheung; AnHai Doan; Luna Dong; Michael J. Franklin; Juliana Freire; Alon Halevy; Joseph M. Hellerstein; Stratos Idreos; Donald Kossmann; Tim Kraska; Sailesh Krishnamurthy; Volker Markl; Sergey Melnik; Tova Milo; C. Mohan; Thomas Neumann; Beng Chin Ooi; Fatma

    Approximately every five years, a group of database researchers meet to do a self-assessment of our community, including reflections on our impact on the industry as well as challenges facing our research community. This report summarizes the discussion and conclusions of the 9th such meeting, held during October 9-10, 2018 in Seattle.

    更新日期:2020-02-25
  • Digital Libraries: Supporting Open Science
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2020-02-25
    Paolo Manghi; Leonardo Candela; Emma Lazzeri; Gianmaria Silvello

    The Italian Research Conference on Digital Libraries (IRCDL) is the annual Italian forum to discuss research topics on Digital Libraries and related technical, practical, and social issues. Along the years, IRCDL touched several aspects underlying the ?Digital Library" domain and promptly adapted to the evolution of the field. Today, the ?Digital Library" field includes theory and practices reflecting

    更新日期:2020-02-25
  • Foundations of Query Answering on Inconsistent Databases
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-12-20
    Jef Wijsen

    Notwithstanding the traditional view that database instances must respect all integrity constraints imposed on them, it is relevant to develop theories about how to handle database instances that violate some integrity constraints, and more particularly, how to cope with query answering in the presence of inconsistency. Such a theory developed over the past twenty years is currently known as consistent

    更新日期:2019-12-20
  • Report on the First International Workshop on Semantic Web Technologies for Health Data Management (SWH 2018)
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-12-20
    Haridimos Kondylakis; Kostas Stefanidis; Praveen Rao

    Better information management is the key to a more intelligent health and social system. To this direction, many challenges must be first overcome, enabling seamless, effective and efficient access to various health data sets and novel methods for exploiting the available information. The First International Workshop on Semantic Web Technologies for Health Data Management aimed at bringing together

    更新日期:2019-12-20
  • Michael Franklin Speaks Out on Data Science
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-12-20
    Marianne Winslett; Vanessa Braganholo

    Welcome to ACM SIGMOD Record series of interviews with distinguished members of the database community. I'm Marianne Winslett, and today we're at the 2017 SIGMOD and PODS conference in Chicago. I have here with me Mike Franklin, who is the chair of the Computer Science department at the University of Chicago. Before that, for many years, Mike was a professor at Berkeley where he also served as a chair

    更新日期:2019-12-20
  • Wilkinson's Tests and SQL Packages
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-12-20
    B. D. McCullough; Taha Mokfi; Mahsa Almaeenjad

    Wilkinson's Tests are used to benchmark the accuracy of some statistical functions in six SQL packages: Apache Hive, Microsoft Access, Microsoft SQL Server, MySQL, Oracle 11g SQL, and SAP Hana. Using the best choice of data type, we find that different packages use different rounding schemes, two packages use unreliable algorithms to compute the sample variance, one package returns the population standard

    更新日期:2019-12-20
  • Report on the First and Second Interdisciplinary Time Series Analysis Workshop (ITISA)
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-12-20
    Themis Palpanas; Volker Beckmann

    The analysis of time-series data associated with modernday industrial operations and scientific experiments is now pushing both computational power and resources to their limits. In order to analyze the existing and (more importantly) future very large time series collections, new technologies and the development of more efficient and smarter algorithms are required. The two editions of the Interdisciplinary

    更新日期:2019-12-20
  • A Guide to Designing Top-k Indexes
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-12-19
    Saladi Rahul; Yufei Tao

    Top-k search, which reports the k elements of the highest importance from all the elements in an underlying dataset that satisfy a certain predicate, has attracted significant attention from the database community. The search efficiency crucially depends on the quality of an index structure that can be utilized to filter the underlying data by both the user-specified predicate and the ranking of importance

    更新日期:2019-12-19
  • Richard Hipp Speaks Out on SQLite
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-12-19
    Marianne Winslett; Vanessa Braganholo

    Welcome to ACM SIGMOD Record Series of interviews with distinguished members of the database community. I'm Marianne Winslett, and today we are at the 2017 SIGMOD and PODS Conference in Chicago. I have here with me, Richard Hipp, who won the 2017 SIGMOD Systems Award and the 2005 Google O'Reilly Open Source Award for SQLite. Richard has his own consulting firm, Hwaci, and his Ph.D. is from Duke University

    更新日期:2019-12-19
  • False News On Social Media
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-12-19
    Francesco Pierri; Stefano Ceri

    In the past few years, the research community has dedicated growing interest to the issue of false news circulating on social networks. The widespread attention on detecting and characterizing deceptive information has been motivated by considerable political and social backlashes in the real world. As a matter of fact, social media platforms exhibit peculiar characteristics, with respect to traditional

    更新日期:2019-12-19
  • Build your own SQL-on-Hadoop Query Engine
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-12-19
    Stefanie Scherzinger

    This is a report on a course taught at OTH Regensburg in the summer term of 2018. The students in this course built their own SQL-on-Hadoop engine as a term project in just 8 weeks. miniHive is written in Python and compiles SQL queries into MapReduce workflows. These are then executed on Hadoop. miniHive performs generic query optimizations (selection and projection pushdown, or cost-based join reordering)

    更新日期:2019-12-19
  • The SIGMOD 2019 Research Track Reviewing System
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-12-19
    Anastasia Ailamaki; Periklis Chrysogelos; Amol Deshpande; Tim Kraska

    While organizing the submission evaluation process for the SIGMOD 2019 research track, we aim at maximizing the value of the reviews while minimizing the probability of misunderstandings due to factual errors, thereby valorizing impactful ideas. The objective is an educating and rewarding experience for both the authors and the reviewers. The actionable goals are: 1. Maximize review depth and breadth

    更新日期:2019-12-19
  • Efficient Query Processing for Dynamically Changing Datasets
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    Muhammad Idris; Martín Ugarte; Stijn Vansummeren; Hannes Voigt; Wolfgang Lehner

    The ability to efficiently analyze changing data is a key requirement of many real-time analytics applications. Traditional approaches to this problem were developed around the notion of Incremental View Maintenance (IVM), and are based either on the materialization of subresults (to avoid their recomputation) or on the recomputation of subresults (to avoid the space overhead of materialization). Both

    更新日期:2019-11-05
  • Technical Perspective for
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    Dan Suciu

    The main processing paradigm in data management is bulk processing. As introduced by Codd in the early 70's, under this paradigm relations are processed in bulk, one operator at a time. When applied to relations, this paradigm leads to relational algebra, and its variants, relational calculus, and SQL. Over the years, data management was faced with the challenge of extending bulk processing operators

    更新日期:2019-11-05
  • Technical Perspective
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    Graham Cormode

    When was the last time that you wrote code to implement a join algorithm? Chances are, it was during an undergraduate database class - if at all. The wide availability of database management systems in all their manifestations (admitting a wide definition, to encompass performing look-ups in a spreadsheet) mean that we do not have to (re)implement common operations over and over again. This brings

    更新日期:2019-11-05
  • Technical Perspective
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    Ke Yi

    Randoms sampling from data streams is a problem with a long history of studies, starting from the famous reservoir sampling algorithm that is at least 50 years old [2]. The reservoir sampling algorithm maintains a random sample over all data items that have ever been received from the stream. This is not suitable for many of today's applications on evolving data streams, where recent data is more important

    更新日期:2019-11-05
  • Research Highlights
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    Leonid Libkin

    Take a database conference paper and search for "in the real world" in it; chances are high you will find it. Of course what is real depends on one's perspective: for a pure theory paper it could be what one saw in a systems paper, for a systems paper it could be an issue that implementors of DBMSs had to deal with, and for the latter it may be what the customers need. But to sharpen our research tools

    更新日期:2019-11-05
  • Technical Perspective
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    Zachary G. Ives

    When problems are scaled to "big data," researchers must often come up with new solutions, leveraging ideas from multiple research areas - as we frequently witness in today's big data techniques and tools for machine learning, bioinformatics, and data visualization. Beyond these heavily studied topics, there exist other classes of general problems that need to be rethought at scale. One such problem

    更新日期:2019-11-05
  • Succinct Range Filters
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    Huanchen Zhang; Hyeontaek Lim; Viktor Leis; David G. Andersen; Kimberly Keeton; Andrew Pavlo

    We present the Succinct Range Filter (SuRF), a fast and compact data structure for approximate membership tests. Unlike traditional Bloom filters, SuRF supports both single-key lookups and common range queries. SuRF is based on a new data structure called the Fast Succinct Trie (FST) that matches the point and range query performance of state-of-the-art order-preserving indexes, while consuming only

    更新日期:2019-11-05
  • Technical Perspective
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    Wim Martens

    The paper Efficient Query Processing for Dynamically Changing Datasets, by Muhammad Idris, Mart´n Ugarte, Stijn Vansummeren, Hannes Voigt, and Wolfgang Lehner studies two central aspects of answering queries: (1) enumerating the answers to a query and (2) changing data. It is based on two papers by the same authors or a subset thereof, namely The Dynamic Yannakakis Algorithm: Compact and Efficient

    更新日期:2019-11-05
  • Efficient Signal Reconstruction for a Broad Range of Applications
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    Abolfazl Asudeh; Jees Augustine; Azade Nazi; Saravanan Thirumuruganathan; Nan Zhang; Gautam Das; Divesh Srivastava

    The signal reconstruction problem (SRP) is an important optimization problem where the objective is to identify a solution to an under-determined system of linear equations AX = b that is closest to a given prior. It has a substantial number of applications in diverse areas including network traffic engineering, medical image reconstruction, acoustics, astronomy and many more. Most common approaches

    更新日期:2019-11-05
  • MATLANG
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    Robert Brijder; Floris Geerts; Jan Van den Bussche; Timmy Weerwag

    We investigate the expressive power of MATLANG, a formal language for matrix manipulation based on common matrix operations and linear algebra. The language can be extended with the operation inv for inverting a matrix. In MATLANG + inv we can compute the transitive closure of directed graphs, whereas we show that this is not possible without inversion. Indeed we show that the basic language can be

    更新日期:2019-11-05
  • Technical Perspective
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    Benny Kimelfeld; Wim Martens

    The challenge of entity matching is that of identifying when different data items (often referred to as records or mentions) refer to the same real-life entity. Popular instantiations of this problem include deduplication, where the items are database records that include duplicate representations of the same entity (e.g., duplicate profiles in a social network) [2], record linkage, where the items

    更新日期:2019-11-05
  • Technical Perspective
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    Stratos Idreos

    Data structures that filter data for point or range queries are prevalent across all data-driven applications, from analytics to transactions, and modern machine learning applications. The primary objective is simple: find whether one or more data items exist in the database. Yet, this simple task is exceptionally hard to perform efficiently, and surprisingly critical for the overall properties of

    更新日期:2019-11-05
  • How Do Humans and Data Systems Establish a CommonQuery Language?
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    Ben McCamish; Vahid Ghadakchi; Arash Termehchy; Liang Huang; Behrouz Touri

    As most users do not precisely know the structure and/or the content of databases, their queries do not exactly reflect their information needs. While database management systems (DBMS) may interact with users and use their feedback on the returned results to learn the information needs behind their queries, current query interfaces assume that users do not learn and modify the way way they express

    更新日期:2019-11-05
  • Technical Perspective
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    H. V. Jagadish

    We all structure information in our brains: without structure, we would not be able to deal with the huge quantities of highly heterogenous information we process. However, each of us structures this information slightly differently, often leading to misunderstandings or requiring additional rounds of dialog to clarify. Database schema are also designed by humans. The structure imposed on the information

    更新日期:2019-11-05
  • Bridging Theory and Practice with Query Log Analysis
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    Wim Martens; Tina Trautner

    Since large structured query logs have recently become available, we have a new opportunity to gain insights in the types of queries that users ask. Even though such logs can be quite volatile, there are various new observations that can be made about the structure of queries inside them, on which we report here. Furthermore, building on an extensive analysis that has been done on such logs, we were

    更新日期:2019-11-05
  • #8712;
    ACM SIGMOD Rec. (IF 0.711) Pub Date : 2019-11-05
    Dan Zhang; Ryan McKenna; Ios Kotsogiannis; George Bissias; Michael Hay; Ashwin Machanavajjhala; Gerome Miklau

    The adoption of differential privacy is growing but the complexity of designing private, efficient and accurate algorithms is still high. We propose a novel programming framework and system, ∈ktelo, for implementing both existing and new privacy algorithms. For the task of answering linear counting queries, we show that nearly all existing algorithms can be composed from operators, each conforming

    更新日期:2019-11-05
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
微生物研究
亚洲大洋洲地球科学
NPJ欢迎投稿
自然科研论文编辑
ERIS期刊投稿
欢迎阅读创刊号
自然职场,为您触达千万科研人才
spring&清华大学出版社
城市可持续发展前沿研究专辑
Springer 纳米技术权威期刊征稿
全球视野覆盖
施普林格·自然新
chemistry
物理学研究前沿热点精选期刊推荐
自然职位线上招聘会
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
阿拉丁试剂right
上海中医药大学
清华大学
复旦大学
南科大
北京理工大学
上海交通大学
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
清华大学-1
武汉大学
浙江大学
天合科研
x-mol收录
试剂库存
down
wechat
bug