Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems最新文献_第4页

The input/output complexity of triangle enumeration 三角形枚举的输入/输出复杂度

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems Pub Date : 2013-12-02 DOI: 10.1145/2594538.2594552

R. Pagh, Francesco Silvestri

引用次数: 63

Beyond worst-case analysis for joins with minesweeper 超越与扫雷舰连接的最坏情况分析

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems Pub Date : 2013-02-04 DOI: 10.1145/2594538.2594547

H. Ngo, D. Nguyen, C. Ré, A. Rudra

{"title":"Beyond worst-case analysis for joins with minesweeper","authors":"H. Ngo, D. Nguyen, C. Ré, A. Rudra","doi":"10.1145/2594538.2594547","DOIUrl":"https://doi.org/10.1145/2594538.2594547","url":null,"abstract":"We describe a new algorithm, Minesweeper, that is able to satisfy stronger runtime guarantees than previous join algorithms (colloquially ``beyond worst-case'' guarantees) for data in indexed search trees. Our first contribution is developing a framework to measure this stronger notion of complexity, which we call \"certificate complexity,\" that extends notions of Barbay et al. and Demaine et al.; a certificate is a set of propositional formulae that certifies that the output is correct. This notion captures a natural class of join algorithms. In addition, the certificate allows us to define a strictly stronger notion of runtime complexity than traditional worst-case guarantees. Our second contribution is to develop a dichotomy theorem for the certificate-based notion of complexity. Roughly, we show that Minesweeper evaluates $beta$-acyclic queries in time linear in the certificate plus the output size, while for any $beta$-cyclic query, there is some instance that takes superlinear time in the certificate (and for which the output is no larger than the certificate size). We also extend our certificate-complexity analysis to queries with bounded treewidth and the triangle query. We present empirical results that certificates can be much smaller than the input size, which suggests that ideas in minesweeper might lead to faster algorithms in practice.","PeriodicalId":302451,"journal":{"name":"Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122639585","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 48

A dynamic I/O-efficient structure for one-dimensional top-k range reporting 用于一维top-k范围报告的动态I/ o高效结构

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems Pub Date : 2012-08-22 DOI: 10.1145/2594538.2594543

Yufei Tao

引用次数: 8

Session details: Awards session 会话细节:奖励会话

Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems Pub Date : 2012-05-21 DOI: 10.1145/3255782

R. Hull, W. Fan, Floris Geerts, Dan Suciu

引用次数: 0