当前期刊: ACM Transactions on Database Systems Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Packing R-trees with Space-Filling Curves: Theoretical Optimality, Empirical Efficiency, and Bulk-loading Parallelizability
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-04-28
    Jianzhong Qi; Yufei Tao; Yanchuan Chang; Rui Zhang

    The massive amount of data and large variety of data distributions in the big data era call for access methods that are efficient in both query processing and index management, and over both practical and worst-case workloads. To address this need, we revisit two classic multidimensional access methods -- the R-tree and the space-filling curve. We propose a novel R-tree packing strategy based on space-filling

    更新日期:2020-07-02
  • Adaptive Asynchronous Parallelization of Graph Algorithms
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-04-28
    Wenfei Fan; Ping Lu; Jingbo Xu; Wenyuan Yu; Qiang Yin; Xiaojian Luo; Ruochun Jin

    This paper proposes an Adaptive Asynchronous Parallel (AAP) model for graph computations. As opposed to Bulk Synchronous Parallel (BSP) and Asynchronous Parallel (AP) models, AAP reduces both stragglers and stale computations by dynamically adjusting relative progress of workers. We show that BSP, AP and Stale Synchronous Parallel model (SSP) are special cases of AAP. Better yet, AAP optimizes parallel

    更新日期:2020-07-02
  • Incremental and Approximate Computations for Accelerating Deep CNN Inference
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-04-27
    Supun Chathuranga Nakandala; Kabir Nagrecha; 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. However, CNN inference is highly compute intensive and time consuming, which makes it unwieldy for interactive and/or resource-constrained use cases. In this work, we identify two popular CNN tasks which are highly resource-intensive

    更新日期:2020-07-02
  • Discovering Graph Functional Dependencies
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-04-28
    Wenfei Fan; Chunming Hu; Xueli Liu; Ping Lu

    This paper studies discovery of GFDs, a class of functional dependencies defined on graphs. We investigate the fixed-parameter tractability of three fundamental problems related to GFD discovery. We show that the implication and satisfiability problems are fixed-parameter tractable, but the validation problem is co-W[1]-hard in general. We introduce notions of reduced GFDs and their topological support

    更新日期:2020-07-02
  • Succinct Range Filters
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-06-21
    Huanchen Zhang; Hyeontaek Lim; Viktor Leis; David G. Andersen; Michael Kaminsky; 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: open-range queries, closed-range queries, and range counts. 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

    更新日期:2020-07-02
  • Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-06-27
    Mahmoud Abo Khamis; Hung Q. Ngo; Xuanlong Nguyen; Dan Olteanu; Maximilian Schleich

    Integrated solutions for analytics over relational databases are of great practical importance as they avoid the costly repeated loop data scientists have to deal with on a daily basis: select features from data residing in relational databases using feature extraction queries involving joins, projections, and aggregations; export the training dataset defined by such queries; convert this dataset into

    更新日期:2020-07-02
  • Catching Numeric Inconsistencies in Graphs
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-06-27
    Wenfei Fan; Xueli Liu; Ping Lu; Chao Tian

    Numeric inconsistencies are common in real-life knowledge bases and social networks. To catch such errors, we extend graph functional dependencies with linear arithmetic expressions and built-in comparison predicates, referred to as numeric graph dependencies (NGDs). We study fundamental problems for NGDs. We show that their satisfiability, implication, and validation problems are Σp2-complete, Πp2-complete

    更新日期:2020-07-02
  • Maintaining Triangle Queries under Updates
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-04-21
    ahmet kara; Hung Q Ngo; Milos Nikolic; Dan Olteanu; Haozhe Zhang

    We consider the problem of incrementally maintaining the triangle queries with arbitrary free variables under single-tuple updates to the input relations. We introduce an approach called IVMe that exhibits a tradeoff between the update time, the space, and the delay for the enumeration of the query result, such that the update time ranges from the square root to linear in the database size while the

    更新日期:2020-04-21
  • Synthesis of Incremental Linear Algebra Programs
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-04-09
    Amir Shaikhha; Mohammed ElSeidy; Daniel Espino; Stefan Mihaila; Christoph Koch

    This article targets the Incremental View Maintenance (IVM) of sophisticated analytics (such as statistical models, machine learning programs, and graph algorithms) expressed as linear algebra programs. We present Lago, a unified framework for linear algebra that automatically synthesizes efficient incremental trigger programs, thereby freeing the user from erroneous manual derivations, performance

    更新日期:2020-04-09
  • Efficient Discovery of Matching Dependencies
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-04-03
    Philipp Schirmer; Thorsten Papenbrock; Ioannis Koumarelas; Felix Naumann

    Matching dependencies (MDs) are data profiling results that are often used for data integration, data cleaning, and entity matching. They are a generalization of functional dependencies (FDs) matching similar rather than same elements. As their discovery is very difficult, existing profiling algorithms find either only small subsets of all MDs or their scope is limited to only small datasets. We focus

    更新日期:2020-04-03
  • Editorial
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-02-17
    Christian S. Jensen

    No abstract available.

    更新日期:2020-02-17
  • Computing Optimal Repairs for Functional Dependencies
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-02-17
    Ester Livshits; Benny Kimelfeld; Sudeepa Roy

    We investigate the complexity of computing an optimal repair of an inconsistent database, in the case where integrity constraints are Functional Dependencies (FDs). We focus on two types of repairs: an optimal subset repair (optimal S-repair), which is obtained by a minimum number of tuple deletions, and an optimal update repair (optimal U-repair), which is obtained by a minimum number of value (cell)

    更新日期:2020-02-17
  • A Game-theoretic Approach to Data Interaction
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-02-08
    Ben McCamish; Vahid Ghadakchi; Arash Termehchy; Behrouz Touri; Eduardo Cotilla-Sanchez; Liang Huang; Soravit Changpinyo

    As most users do not precisely know the structure and/or the content of databases, their queries do not exactly reflect their information needs. The database management system (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 they express their

    更新日期:2020-02-08
  • KTELO
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-02-08
    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

    更新日期:2020-02-08
  • Efficient Enumeration Algorithms for Regular Document Spanners
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-02-08
    Fernando Florenzano; Cristian Riveros; Martín Ugarte; Stijn Vansummeren; Domagoj Vrgoč

    Regular expressions and automata models with capture variables are core tools in rule-based information extraction. These formalisms, also called regular document spanners, use regular languages to locate the data that a user wants to extract from a text document and then store this data into variables. Since document spanners can easily generate large outputs, it is important to have efficient evaluation

    更新日期:2020-02-08
  • On the Language of Nested Tuple Generating Dependencies
    ACM Trans. Database Syst. (IF 2.927) Pub Date : 2020-02-06
    Phokion G. Kolaitis; Reinhard Pichler; Emanuel Sallinger; Vadim Savenkov

    During the past decade, schema mappings have been extensively used in formalizing and studying such critical data interoperability tasks as data exchange and data integration. Much of the work has focused on GLAV mappings, i.e., schema mappings specified by source-to-target tuple-generating dependencies (s-t tgds), and on schema mappings specified by second-order tgds (SO tgds), which constitute the

    更新日期:2020-02-06
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
胸部和胸部成像专题
自然科研论文编辑服务
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
鲁照永
华东师范大学
苏州大学
南京工业大学
南开大学
中科大
唐勇
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
中洪博元
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
广东实验室
南京大学
王杰
南科大
刘尊峰
湖南大学
清华大学
王小野
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug