Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems最新文献

筛选
英文 中文
Managing conflicts between rules (extended abstract) 管理规则之间的冲突(扩展抽象)
H. Jagadish, A. Mendelzon, Inderpal Singh Mumick
{"title":"Managing conflicts between rules (extended abstract)","authors":"H. Jagadish, A. Mendelzon, Inderpal Singh Mumick","doi":"10.1145/237661.237710","DOIUrl":"https://doi.org/10.1145/237661.237710","url":null,"abstract":"Rules are used as a programming paradigm in several application domains, including active databases, planning, expert systems, and billing. For example, active databases have rules that execute upon the occurrence of particular events if specified condition predicates are satisfied. It is often the case that multiple rules are fireable when a particular event occurs. We propose a declarative mechanism to control the interaction and execution of multiple rules. The mechanism is based upon logical meta-rules that can express various types of relationships between rules. The meta-rules allow us to reason statically about the rule behavior. We can determine, in polynomial time, if a rule will never execute, whether two rules can ever be executed together, and whether a rule system is guaranteed to have a unique execution set for all possible rules that become fireable. In this paper, we illustrate our techniques using rules in an active database. A system based upon the metarules and the static analysis presented here has been found to be of value in a billing application at AT&T to control interactions between discount plans, and is presently being implemented within the application.","PeriodicalId":107913,"journal":{"name":"Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126336221","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}
引用次数: 19
Integrating information by outerjoins and full disjunctions (extended abstract) 外连接与全析取的信息集成(扩展抽象)
A. Rajaraman, J. Ullman
{"title":"Integrating information by outerjoins and full disjunctions (extended abstract)","authors":"A. Rajaraman, J. Ullman","doi":"10.1145/237661.237717","DOIUrl":"https://doi.org/10.1145/237661.237717","url":null,"abstract":"Our motivation is the piecing together of tidbits of information found on the “web” into a usable information structure. The problem is related to that of computing the natural outerjoin of many relations in a way that preserves all possible connections among facts. Such a computation has been termed a “full disjunction” by Galindo-Legaria. We are thus led to ask the question of when a full disjunction can be computed by some sequence of natural outerjoins. The answer involves a concept of from Fagin [1983] called “~-acyclic hypergraphs.” We prove that there is a natural outerjoin sequence producing the full disjunction if and only if the set of relation schemes forms a connected, -y-acyclic hypergraph.","PeriodicalId":107913,"journal":{"name":"Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116434667","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}
引用次数: 39
Topological queries in spatial databases 空间数据库中的拓扑查询
C. Papadimitriou, Dan Suciu, V. Vianu
{"title":"Topological queries in spatial databases","authors":"C. Papadimitriou, Dan Suciu, V. Vianu","doi":"10.1145/237661.237683","DOIUrl":"https://doi.org/10.1145/237661.237683","url":null,"abstract":"Handling spatial information is required by many database applications, and each poses different requirements on query languages. In many cases the precise size of the regions is important, while in other applications we may only be interested in the TOPOLOGICAL relations- hips between regions — intuitively, those that pertain to adjacency and connectivity properties of the regions, and are therefore invariant under homeomorphisms. Such differences in scope and emphasis are crucial, as they affect the data model, the query language, and performance. This talk focuses on queries targeted towards topological information for two- dimensional spatial databases, where regions are specified by polynomial inequalities with integer coeficients. We focus on two main aspects: (i) languages for expressing topological queries, and (ii) the representation of topological information. In regard to (i), we study several languages geared towards topological queries, building upon well-known topologi- cal relationships between pairs of planar regions proposed by Egenhofer. In regard to (ii), we show that the topological information in a spatial database can be precisely summarized by a finite relational database which can be viewed as a topological annotation to the raw spatial data. All topological queries can be answered using this annotation, called to- pological invariant. This yields a potentially more economical evaluation strategy for such queries, since the topological invariant is generally much smaller than the raw data. We examine in detail the problem of transla- ting topological queries against the spatial database into queries against the topological invariant. The languages considered are first-order on the spatial database side, and fixpoint and first-order on the topological in- variant side. In particular, it is shown that fixpoint expresses precisely the PTIME queries on topological invariants. This suggests that topolo- gical invariants are particularly well-behaved with respect to descriptive complexity. (Based on joint work with C.H.Papadimitriou, D. Suciu and L. Segoufin.)","PeriodicalId":107913,"journal":{"name":"Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128848281","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}
引用次数: 114
Recovery for transaction failures in object-based databases 恢复基于对象的数据库中的事务失败
M. Wong
{"title":"Recovery for transaction failures in object-based databases","authors":"M. Wong","doi":"10.1145/237661.237703","DOIUrl":"https://doi.org/10.1145/237661.237703","url":null,"abstract":"for Transaction Failures in Object-Based Databases","PeriodicalId":107913,"journal":{"name":"Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125555268","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}
引用次数: 1
Linear vs. order constraint queries over rational databases (extended abstract) 对理性数据库的线性与顺序约束查询(扩展抽象)
A. P. Stolboushkin, M. A. Taitslin
{"title":"Linear vs. order constraint queries over rational databases (extended abstract)","authors":"A. P. Stolboushkin, M. A. Taitslin","doi":"10.1145/237661.237669","DOIUrl":"https://doi.org/10.1145/237661.237669","url":null,"abstract":"We consider relational databases organized over an ordered domain with some additional relations—a typical example is the ordered domain of rational numbers together with the ternary relation + of addition. In the focus of our study are the first order queries that are invariant under order-preserving “permutations’’-such queries are called (order-) generic. We show that for an arbitrary ordered divisible Abelian group order-generic queries fail to express more than pure order queries, and that, moreover, the generic queries can be effectively translated into pure order queries. For example, every order-generic query over rational numbers with + can be effectively rewritten without +. An important difference of this paper from a recent series of related papers (see, for example, [PVV95, BDLW96]) is that we generalize all notions to the case of finitely representable database states—as opposed to finite states— and develop a general lifting technique that, essentially, allows us to extend any result of the kind we are interested in, from finite to finitely-representable states, and thus all the results in this paper are proved for the general case of constraint databases. This lifting technique relies upon a geometrically clear representation of finitely representable (but possibly infinite) relations over ,m arbitrary ordered domain in the form of finite relations. The translation of one representation into another is shown to be uniform first order. The value of these results is not limited to the specific set of problems considered in this paper, as a matter of fact, they show that order-constraint and finite databases are equally powerful— although the constraint representation does provide a more *This work has been partially supported by NSF Grant CCR 9403809. t A part of this research wss carried out while the author was visiting UCLA and supported in part by NSF Grant CCR 9403809, and while the author was visiting DIMACS and Princeton and supported in part by a grant from Princeton University. Permission to make digitsl/hsrd copies of all or part of this msterial for personal or classroom use is granted without fee pmvidr.d that the copies sorenot made or distributed for profit or commercial advsntage, the copyright notice, the title of the publication and its date appear, and notice is given that copyright is by permission of the ACM, Inc. To copy otbemvise, to republish, to post on servers or to redistribute to lists, requires specific perrniasion and/or fee. PODS ’96, Montreal Quebec Canada @1996 ACM 0-89791-781-2/96/06. .$3.50 Michael A. Taitslint Department of Computer Science Tver State University","PeriodicalId":107913,"journal":{"name":"Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131216927","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}
引用次数: 13
Towards practical constraint databases (extended abstract) 面向实用约束数据库(扩展抽象)
S. Grumbach, Jianwen Su
{"title":"Towards practical constraint databases (extended abstract)","authors":"S. Grumbach, Jianwen Su","doi":"10.1145/237661.237672","DOIUrl":"https://doi.org/10.1145/237661.237672","url":null,"abstract":"We develop a framework for (real) constraint databases based on finite precision arithmetic which fulfills the main requirements of practical constraint databases. Ftrst, it allows the manipulation of approximate values, standard in scientific applications. More importantly, it permits the extension of the relational calculus with aggregate functions, while preserving the fundamental property of closed form evaluation with PTIME data complexity. This is an important step since the inttial model of [KKR90] cannot be extended to aggregate functions. Moreover, finite precision computation plays a central role in efficient query processing. We introduce the finite precision semantics of queries and prove expressive power results concerning it. We then present a new constraint query language, CALCF, which includes aggregate and analytical functions, and show that it admits a closed form evaluation in PTIME.","PeriodicalId":107913,"journal":{"name":"Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126481576","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}
引用次数: 6
Mining optimized association rules for numeric attributes 挖掘数字属性的优化关联规则
T. Fukuda, Y. Morimoto, S. Morishita, T. Tokuyama
{"title":"Mining optimized association rules for numeric attributes","authors":"T. Fukuda, Y. Morimoto, S. Morishita, T. Tokuyama","doi":"10.1145/237661.237708","DOIUrl":"https://doi.org/10.1145/237661.237708","url":null,"abstract":"Tokyo Research Laboratory, IBM Research, 1623-14 Shimo-tsuruma, Yamato City, Kanagawa 242, JapanE-mail: ttoku\u0014trl.ibm.co.jpReceived November 13, 1996; revised April 14, 1998Given a huge database, we address the problem of finding associa-tion rules for numeric attributes, such as(Balance # I)O(CardLoan=yes),which implies that bank customers whose balances fall in a range I arelikely to use card loan with a probability greater than p. The above ruleis interesting only if the range I has some special feature with respect tothe interrelation between Balance and CardLoan. It is required that thenumber of customers whose balances are contained in I (called thesupport of I) is sufficient and also that the probability p of the conditionCardLoan=yes being met (called the confidence ratio) be muchhigher than the average probability of the condition over all the data.Our goal is to realize a system that finds such appropriate rangesautomatically. We mainly focus on computing two optimized ranges:one that maximizes the support on the condition that the confidenceratio is at least a given threshold value, and another that maximizes theconfidence ratio on the condition that the support is at least a giventhreshold number.Using techniques from computational geometry, we present novelalgorithms that compute the optimized ranges in linear time if the dataare sorted. Since sorting data with respect to each numeric attribute isexpensive in the case of huge databases that occupy much more spacethan the main memory, we instead apply randomized bucketing as thepreprocessing method and thus obtain an efficient rule-finding system.Tests show that our implementation is fast not only in theory but alsoin practice. The efficiency of our algorithm enables us to computeoptimizedrules for all combinationsof hundreds ofnumericand Booleanattributes in a reasonable time.","PeriodicalId":107913,"journal":{"name":"Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129124014","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}
引用次数: 320
Answering queries using limited external query processors (extended abstract) 使用有限的外部查询处理器回答查询(扩展抽象)
A. Halevy, A. Rajaraman, J. Ullman
{"title":"Answering queries using limited external query processors (extended abstract)","authors":"A. Halevy, A. Rajaraman, J. Ullman","doi":"10.1145/237661.237716","DOIUrl":"https://doi.org/10.1145/237661.237716","url":null,"abstract":"When answering queries using external information sources, their contents can be described by views. To answer a query, we must rewrite it using the set of views presented by the sources. When the external information sources also have the ability to answer some (perhaps limited) sets of queries that require performing operations on their data, the set of views presented by the source may be infinite (albeit encoded in some finite fashion). Previous work on answering queries using views has only considered the case where the set of views is finite. In order to exploit the ability of information sources to answer more complex queries, we consider the problem of answering conjunctive queries using infinite sets of views. Our first result is that an infinite set of views can be partitioned into a finite number of equivalence classes, such that picking one view from every nonempty class is sufficient to determine whether the query can be answered using the views. Second, we show how to compute the set of equivalence classes for sets of views encoded by a datalog program. Furthermore, we extend our results to the case when the query and the views use the built-in predicates <, s, =, and #, and they are interpreted over a dense domain. Finally, we extend our results to conjunctive queries and views with the built-in predicates <, s, and = interpreted over the integers. In doing so we present a result of independent interest, namely, an algorithm to minimize such queries. *The work of the second and third authors was supported by NSF grant IRI–92–23405, ARO grant DAAH04-95–1-0192, and USAF contract F3361 5–93–1–1339. Permission to make digitsl/hard copies of all or part of thk material for personal or classroom use is grsnted without fee provided that the copies are not made or ~stributed for profit or commercial advantage, the. copyright notice, the title of the publication and its date appear, and notwe is given that copyright is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires specific permission and/or fee. PODS ’96, Montreal Quebec Canada @1996 ACM ()+9791 .781.2/9 fj/@j. .$3.50","PeriodicalId":107913,"journal":{"name":"Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115220069","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}
引用次数: 52
Tables as a paradigm for querying and restructuring (extended abstract) 表作为查询和重组的范型(扩展抽象)
M. Gyssens, L. Lakshmanan, Iyer N. Subramanian
{"title":"Tables as a paradigm for querying and restructuring (extended abstract)","authors":"M. Gyssens, L. Lakshmanan, Iyer N. Subramanian","doi":"10.1145/237661.237688","DOIUrl":"https://doi.org/10.1145/237661.237688","url":null,"abstract":"Tables are one of the most natural representations of real-life data. Previous table-based data models (such as relational, nested relational, and complex objects models) capture only a limited variety of real-life tables. In this paper, we study the foundations of tabular representations of data. We propose the tabular database model for handling a broad class of natural data represent at ions and develop tabular algebra as a language for querying and restructuring tabular data. We show that the tabular algebra is complete for a very general class of transformations and show that several languages designed for very different purposes can naturally be embedded into the tabular model, We also demonstrate the applicability of our model as a theoretical foundation for on-line analytical processing (OLAP), an emerging technology for complementing the robust data management and transaction processing of DBMS with powerful tools for data analysis.","PeriodicalId":107913,"journal":{"name":"Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130556841","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}
引用次数: 79
Verifiable properties of database transactions 数据库事务的可验证属性
Michael Benedikt, T. Griffin, L. Libkin
{"title":"Verifiable properties of database transactions","authors":"Michael Benedikt, T. Griffin, L. Libkin","doi":"10.1145/237661.237692","DOIUrl":"https://doi.org/10.1145/237661.237692","url":null,"abstract":"It is often necessary to ensure that database transactions preserve integrity constraints that specify valid database states. While it is possible to monitor for violations of constraints at run-time, rolling back transactions when violations are detected, it is preferable to verify correctness statically,beforetransactions are executed. This can be accomplished if we can verify transaction safety with respect to a set of constraints by means of calculatingweakest preconditions. We study properties of weakest preconditions for a number of transaction and specification languages. We show that some simple transactions do not admit weakest preconditions over first-order logic and some of its extensions such as first-order logic with counting and monadic?11. We also show that the class of transactions that admit weakest preconditions over first-order logic cannot be captured by any transaction language. We consider a strong local form of verifiability, and show that it is different from the general form. We define robustly verifiable transactions as those that can be statically analyzed regardless of extensions to the signature of the specification language, and we show that the class of robustly verifiable transactions over first-order logic is exactly the class of transactions that admit the local form of verifiability. We discuss the implications of these results for the design of verifiable transaction languages.","PeriodicalId":107913,"journal":{"name":"Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127138851","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}
引用次数: 37
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书