LPAR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...
JAPLL
2010
13 years 10 months ago
2010
The relational model has recently been extended to so-called K-relations in which tuples are assigned a unique value in a semiring K. A query language, denoted by RAC K , similar ...
APLAS
2010
ACM
14 years 16 days ago
2010
ACM
We consider the problem of specifying data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data...
AMW
2009
14 years 1 months ago
2009
Conventional operators for data retrieval are either based on exact matching or on total order relationship among elements. Neither of them is appropriate to manage complex data, s...
TDM
2004
14 years 1 months ago
2004
This work may be seen as a further proof of the versatility of the relational database model. Here, we add XQuery to the catalog of languages which RDBMSs are able to "speak&...
CSREASAM
2006
14 years 1 months ago
2006
- In this paper, we propose a method to analyze the firewall policy or rule-set using Relational Algebra and Raining 2D-Box Model. It can discover all the anomalies in the firewall...
IQIS
2007
ACM
14 years 1 months ago
2007
ACM
Relational Database Systems often support activities like data warehousing, cleaning and integration. All these activities require performing some sort of data transformations. Si...
EDBTW
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Relational algebra has been a crucial foundation for relational database systems, and has played a large role in enabling their success. A corresponding XML algebra for X...
VLDB
1987
ACM
14 years 3 months ago
1987
ACM
A Datalog program can be translated into a system of fixpoint equations of relational algebra; this paper studies how such a system can be solved and optimized for a particular qu...
DBPL
1991
Springer
14 years 3 months ago
1991
Springer
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...