International Workshop/Symposium on Database Programming Languages最新文献

{"title":"Degrees of Monotonicity of Spatial Transformations","authors":"B. Kuijpers","doi":"10.1007/3-540-64823-2_5","DOIUrl":"https://doi.org/10.1007/3-540-64823-2_5","url":null,"abstract":"","PeriodicalId":211031,"journal":{"name":"International Workshop/Symposium on Database Programming Languages","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123456779","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}

{"title":"Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions","authors":"L. Libkin, L. Wong","doi":"10.1007/3-540-64823-2_13","DOIUrl":"https://doi.org/10.1007/3-540-64823-2_13","url":null,"abstract":"","PeriodicalId":211031,"journal":{"name":"International Workshop/Symposium on Database Programming Languages","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122799116","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}

{"title":"Panel Session: Metadata for Database Interoperation","authors":"S. Cluet, R. Connor, R. Hull, D. Maier, F. Matthes, Dan Suciu","doi":"10.1007/3-540-64823-2_3","DOIUrl":"https://doi.org/10.1007/3-540-64823-2_3","url":null,"abstract":"","PeriodicalId":211031,"journal":{"name":"International Workshop/Symposium on Database Programming Languages","volume":"163 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134034152","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}

{"title":"Object Views and Database Restructuring","authors":"Z. Lacroix, C. Delobel, P. Brèche","doi":"10.1007/3-540-64823-2_11","DOIUrl":"https://doi.org/10.1007/3-540-64823-2_11","url":null,"abstract":"","PeriodicalId":211031,"journal":{"name":"International Workshop/Symposium on Database Programming Languages","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132333480","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}

{"title":"Investigating Extension Polymorphism","authors":"R. Connor, D. Balasubramaniam, R. Morrison","doi":"10.14236/EWIC/DBPL1995.7","DOIUrl":"https://doi.org/10.14236/EWIC/DBPL1995.7","url":null,"abstract":"","PeriodicalId":211031,"journal":{"name":"International Workshop/Symposium on Database Programming Languages","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130599226","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}

{"title":"Programming Constructs for Unstructured Data","authors":"P. Buneman, S. Davidson, Dan Suciu","doi":"10.14236/EWIC/DBPL1995.4","DOIUrl":"https://doi.org/10.14236/EWIC/DBPL1995.4","url":null,"abstract":"We investigate languages for querying and transforming unstructured data by which we mean languages than can be used without knowledge of the structure (schema) of the database. There are two reasons for wanting to do this. First, some data models have emerged in which the schema is either completely absent or only provides weak constraints on the data. Second, it is sometimes convenient, for the purposes of browsing, to query the database without reference to the schema. For example one may want to grep\" all character strings in the database, or one might want to nd the information associated with a certain eld name no matter where it occurs in the database. This paper introduces a labelled tree model of data and investigates various programming structures for querying and transforming such data. In particular, it considers various restrictions of structural recursion that give rise to well-de ned queries even when the input data contains cycles. It also discusses issues of observable equivalence of such structures.","PeriodicalId":211031,"journal":{"name":"International Workshop/Symposium on Database Programming Languages","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124129855","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}

{"title":"On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL","authors":"Guozhu Dong, L. Libkin, L. Wong","doi":"10.14236/EWIC/DBPL1995.10","DOIUrl":"https://doi.org/10.14236/EWIC/DBPL1995.10","url":null,"abstract":"We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanisms. In particular, we show that the transitive closure cannot be maintained in relational calculus under deletion of edges. We use new proof techniques to show this result. These proof techniques generalize to other languages, for example, to the language for nested relations that also contains a number of aggregate functions. Such a language is considered in this paper as a theoretical reconstruction of SQL. Our proof techniques also generalize to other recursive queries. Consequently, we show that a number of recursive queries cannot be maintained in an SQL-like language. We show that this continues to be true in the presence of certain auxiliary relations. We also relate the complexity of updating transitive closure to that of updating the samegeneration query and show that the latter is strictly harder than the former. Then we extend this result to that of updating queries based on context-free sets. 1 Problem Statement and Summary It is well known that relational calculus (equivalently, rst-order logic) cannot express recursive queries such as transitive closure [1]. However, in a real database system, it is reasonable to store both the relation and its transitive closure and update the latter whenever edges are added to or removed from the former. Doing this is known under the name of view maintenance. In this paper we consider the problem of whether the above update problem for maintaining transitive closure and other recursive queries can be accomplished using relational calculus or using its practical SQL-like extensions. We also compare the complexity of maintaining transitive closure against the complexity of maintaining same generation\" and context-free chain queries. In this paper, we use the letter R to denote a binary relation, and R to denote its transitive closure. It can be proved [6, 2] that given R, R, and a new edge (x; y) to be added to R, the transitive closure R +(x;y) of R [ f(x; y)g can be expressed in rst-order logic and thus in relational calculus. In particular, for all u and v, R +(x;y) (u; v) i R(u; v), or R(u; x) and y = v, or u = x and R(y; v), or R(u; x) and R(y; v). Thus transitive closure can be incrementally maintained in a relational database. The problem of updating the transitive closure after an edge has been removed is more di cult. The best positive solution so far is that of Dong and Su [5]. They proved that if R is acyclic, then the transitive closure R (x;y) of R with the edge (x; y) removed can be de ned in rst-order logic in terms of R, R , and (x; y). Thus transitive closure can be decrementally maintained in a relational database provided the relation involved is acyclic. But this is not satisfactory because acyclicity cannot be tested in relational calculus [10]. Database Programming Languages, 1995 1 On Impossibility of","PeriodicalId":211031,"journal":{"name":"International Workshop/Symposium on Database Programming Languages","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125582501","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}

{"title":"Scheduling Resource Usage in Object-Oriented Queries","authors":"Theodore W. Leung","doi":"10.14236/EWIC/DBPL1995.18","DOIUrl":"https://doi.org/10.14236/EWIC/DBPL1995.18","url":null,"abstract":"Query facilities in object-oriented databases lag behind their relational c ounterparts in performance. This paper identifies important sources of that performance difference, the random I/O problem and the re-reading problem. We propose three techniques for improving the execution of object-oriented database queries: reuse/out of order execution, memoization, and buffer replacement policy. Schedule level optimization is introduced as our framework for integrating these techniques into query processing systems.","PeriodicalId":211031,"journal":{"name":"International Workshop/Symposium on Database Programming Languages","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129273368","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}

{"title":"On Detecting Conflict Between Proposed Updates","authors":"M. Doherty, R. Hull, M. Derr, J. Durand","doi":"10.14236/EWIC/DBPL1995.9","DOIUrl":"https://doi.org/10.14236/EWIC/DBPL1995.9","url":null,"abstract":"In the Heraclitus paradigm, a delta value or more simply, delta, is a concrete value that corresponds to a difference between database states. This paper presents the Heraclitus[OO] (abbreviated H2O) DBPL, which provides a syntax and semantics for working with deltas in the context of object-oriented databases. The paper also considers the use of deltas in connection with detecting conflict between pairs of proposed updates to a database. This is useful in contexts where multiple users are each creating and choosing between multiple possible updates. A semantically based notion of potential conflict between proposed updates is developed, along with several conservative approximations based on the use of different kinds of delta.","PeriodicalId":211031,"journal":{"name":"International Workshop/Symposium on Database Programming Languages","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115806693","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}

{"title":"An Algebraic Framework for Physical OODB Design","authors":"L. Fegaras, D. Maier","doi":"10.14236/EWIC/DBPL1995.11","DOIUrl":"https://doi.org/10.14236/EWIC/DBPL1995.11","url":null,"abstract":"Physical design for object-oriented databases is still in its infancy. Implementation decisions often intrude into the conceptual design (such as inverse links and object decomposition). Furthermore, query optimizers do not always take full advantage of physical design information. This paper proposes a formal framework for physical database design that automates the query translation process. In this framework, the physical database design is specified in a declarative manner. This specification is used for generating an efficient query transformer that translates logical queries into programs that manipulate the physical database. Alternative access paths to physical data are captured as simple rewrite rules that are used for generating alternative plans for a query.","PeriodicalId":211031,"journal":{"name":"International Workshop/Symposium on Database Programming Languages","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116909707","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}