Gültekin Özsoyoğlu, Z. Meral Özsoyoğlu · IEEE Transactions on Software Engineering · 1985
Databases that are mainly used for statistical analysis are called statistical databases (SDB). A statistical database management system (SDBMS) may be defined as a database management system that provides capabilities 1) to model, store, and manipulate data in a manner suitable for the needs of SDB users, and 2) to apply statistical data analysis techniques that range from simple summary statistics to advanced procedures. This paper surveys the existing and proposed SDB data definition and data manipulation (i.e., query) languages.
Cited by 42
Timos Sellis, Leonard Shapiro · 1985
Article Free Access Share on Optimization of extended database query languages Authors: Timos K. Sellis Department of Electrical Engineering and Computer, Science, Unversity of California, Berkeley, CA Department of Electrical Engineering and Computer, Science, Unversity of California, Berkeley, CAView Profile , Leonard Shapiro Department of Computer Science, North Dakota, State University, Fargo, ND Department of Computer Science, North Dakota, State University, Fargo, NDView Profile Authors Info & Claims SIGMOD '85: Proceedings of the 1985 ACM SIGMOD international conference on Management of dataMay 1985 Pages 424–436https://doi.org/10.1145/318898.318993Published:01 May 1985Publication History 13citation279DownloadsMetricsTotal Citations13Total Downloads279Last 12 Months15Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Cited by 14
Duane Szafron, M. TAMER ÖZSU, John Li · University of Alberta Library · 1995
Cited by 2Open access
John Z. Li, M. Tamer Özsu, Duane Szafron · 1995
Declarative query languages are an important feature of database management systems and have played an important role in their success. As database management technology enters the multimedia information system area, the availability of special-purpose query languages for multimedia applications will be equally important. In this report, we survey multimedia query languages and query models. Particularly, we look at those systems from the point of view of well-defined queries, fuzzy queries, visual queries, and query presentations. Several research issues, such as generic multimedia query languages, incremental queries, fuzzy queries, spatio-temporal queries, feature storage and organization, are also identified. In our opinion these are vital issues for the success and development of a multimedia query language.
Cited by 0
Patrick Valduriez, Scott Danforth · Elsevier eBooks · 1990
Cited by 12
Arnon Avron, Joram Hirshfeld · 2002
Using methods from model theory, the authors construct algorithms that, given any first-order predicate calculus query over a finite database, determine if they have a finite number of solutions or not, and if they do, list them all. This is done for languages that include function names (but no symbols for infinite relations) and for languages that include a name for the order of natural number or for the prefix order in a domain of strings over some alphabet (but no function symbols). The results prove some conjectures of M. Kiffer (Proc. Int. Conf. on Databases and Knowledge Bases, 1988, p.405-415).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 10
Brown, S.A. · OpenGrey (Institut de l'Information Scientifique et Technique) · 1999
Cited by 0
Fritchman, Barry Lynn · VTechWorks (Virginia Tech) · 1983
The increasing prominence of large interactive database systems and the increasing numbers of non-computer professionals who use these systems have made human factors in query languages an area of major importance. Whereas early systems emphasized the power and efficiency of the retrieval mechanism, it is now generally acknowledged that the query language itself should be easy to learn and use, resistant to user errors, and satisfying to the user. Many also believe that query languages can and should be subjected to controlled experimentation to determine the degree to which they embody these features. This paper attempts to analyze the issue of language syntax as applied to human factors in relational query languages. It proposes three query languages which are designed to represent points along a continuum from formal, artificial language to natural language. The importance of scientific testing of relevant hypotheses is emphasized throughout, and experimental guidelines are proposed as a means of evaluating the languages. The purpose of the paper is twofold: to develop design principles for the empirical investigation of query languages, and to apply these principles to the evaluation of specific languages.
Cited by 0
Gültekin Özsoyoğlu, H. Wang · Computer · 1993
Several user-friendly graphical database query languages that let users formulate a query by specifying a graphically aided example on the screen are compared. One of the earliest such languages, M.M. Zloof's (1977) Query-by-Example, is described. Other languages discussed are Aggregates-by-Example, Summary-Table-by-Example, and Query-by-Statistical-Relational-Table for statistical and scientific databases; Time-by-Example for historical databases; Generalized-Query-by-Example for relational, network, and hierarchical databases; Office-by-Example, Formanager, the Natural Forms Query Language, and System-for-Business-Automation for office environments; and Picquery and Query-by-Pictorial-Example for pictorial (image) databases. The basic features, query specification and interpretation, object manipulation, query language constructs, and query processing techniques used in each of the languages are discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 62
Timos Sellis, Leonard Shapiro · ACM SIGMOD Record · 1985
In this paper we examme the problem of query optlrmzatlon for extended data mampulation languages We propose a set of tactics that can be used m optlmzmg sequences of data base operations and descnbe the corresponding transformation procedures These transformations result in new equivalent sequences w&h better space and time performance The proposed techniques are especially useful in artificial mtelhgence and engmeermg apphcatlons where sequences of commands are executed over high volume databases
Cited by 1Open access
Jan Chomicki, David Toman · Encyclopedia of Database Systems · 2009
Cited by 3
M. TAMER ÖZSU, John Li, Duane Szafron · University of Alberta Library · 1997
Cited by 5Open access
Alexandra Poulovassilis, Carol Small · The VLDB Journal · 1996
Cited by 14
Floris Geertsa, Antonella Poggib · 2015
The relational model has recently been extended to so-called K-relations in which tuples are assigned a unique value in a semiringK. A query language, denoted byRACK, similar to the classical positive relational algebra, allows for the querying of K-relations. In this paper, we define more expressive query languages for K-relations that extend RACK with the difference and constant annotations operations on annotated tuples. These operations are natural extensions of the difference and duplicate elimination operations in the relational algebra on sets and bags, respectively. We investigate conditions on semirings under which these operations can be added to RACK in a natural way, and establish basic properties of the resulting query languages. Moreover, we show how the provenance semiring of Green et al. can be extended to record provenance of data in the presence of difference and constant annotations. Finally, we investigate the completeness of RACK and extensions thereof in the sense of Bancilhon and Paredaens (BP). 1.
Cited by 0
Floris Geerts, Antonella Poggi · Journal of Applied Logic · 2009
Cited by 82
Sequences And Data, Yan-nei Law, Haixun Wang et al. · 2004
We study the fundamental limitations of relational algebra (RA) and SQL in supporting sequence and stream queries, and present effective query language and data model enrichments to deal with them. We begin by observing the well-known limitations of SQL in application domains which are important for data streams, such as sequence queries and data mining. Then we present a formal proof that, for continuous queries on data streams, SQL su#ers from additional expressive power problems. We begin by focusing on the notion of nonblocking (NB) queries that are the only continuous queries that can be supported on data streams. We characterize the notion of nonblocking queries by showing that they are equivalent to monotonic queries. Therefore the notion of for RA can be formalized as its ability to express all monotonic queries expressible in RA using only the monotonic operators of RA. We show that RA is not NB-complete, and SQL is not more powerful than RA for monotonic queries.
Cited by 0
Raju Halder, Matteo Zanioli, Agostino Cortesi · 2014
In this work, we extend language-based information-flow security analysis to the case of database applications embedding query languages. The analysis is performed by (i) computing an overapproximation of variables' dependences, in the form of propositional formula, occurred up to each program point, (ii) checking the satisfiability on assigning truth values to variables, (iii) analyzing the application over a numerical abstract domain, and finally, (iv) enhancing the analysis using the reduced product of the propositional formulae domain and the numerical abstract domain.
Cited by 16
David J. Greenblatt, Jerry Waxman · 1978
Cited by 70
Chung-sing Yeung · ThinkTech (Texas Tech University) · 1986
Time is an important dimension in databases. In a conventional database, out-of-ate information is usually replaced by current information to keep the database up-to-date. In many applications, discarding old information is inappropriate. A temporal database incorporates the notion of time. Objects in a temporal database are not deleted. On the contrary, they are retained and time-stamped to indicate their periods of existence in the real world. Over the last few years, a number of temporal relational database models have been proposed. This thesis reviews these models and proposes a heterogeneous model. We also develop a relational algebra and a tuple calculus for this model and prove their equivalence. The model and query languages capture the concept of "always" and "sometime" in natural language. In addition, they provide powerful operations with respect to temporal properties of information contained in tuples. When compared to existing approaches, fewer operations are needed to express complex queries. As a result, fewer intermediate scratch pads will be used during query execution. Consequently the space and time complexity introduced by the temporal dimension in temporal databases will be reduced.
Cited by 6Open access
SIAU, Keng · Singapore Management University Institutional Knowledge (InK) (Singapore Management University) · 1997
Cited by 0Open access