Filters








341,818 Hits in 5.2 sec

How to Model a Real-Time Database?

Nizar Idoudi, Claude Duvallet, Rafik Bouaziz, Bruno Sadeg, Faiez Gargouri
2009 2009 IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing  
Real-time databases deal with time-constrained data and time-constrained transactions.  ...  In this paper, we give an overview about different aspects of real-time databases and we clarify requirements of their modeling.  ...  Introduction Real-time databases have to deal with time-constrained data and time-constrained transactions.  ... 
doi:10.1109/isorc.2009.17 dblp:conf/isorc/IdoudiDBSG09 fatcat:wbjbim2zr5egropwudrp3ub4b4

Security Management Methods in Relational Data

Suhasini Gurappa
2015 International Journal on Recent and Innovation Trends in Computing and Communication  
The paper demonstrate on accuracy constrained privacy-preserving access control mechanism for relation data framework with multilevel anonymization techniaues.  ...  We may access Relation Data in many ways ,fine grained access control for relational data eg., SQL [7] , For evaluating users queries, most concepts attain a Truman model [4] .  ...  Here Suppressed information of original table is used in the first level of anonymization , a generalized value is used in second level of anonymization.  ... 
doi:10.17762/ijritcc2321-8169.150438 fatcat:iqbohn2dojhpxpznv257a2t6ee

Bayes Networks for Supporting Query Processing Over Incomplete Autonomous Databases [article]

Rohit Raghunathan, Sushovan De, Subbarao Kambhampati
2012 arXiv   pre-print
A key challenge that these information mediators need to handle is the varying levels of incompleteness in the underlying databases in terms of missing attribute values.  ...  Our approach involves mining/"learning" Bayes networks from a sample of the database, and using it to do both imputation (predict a missing value) and query rewriting (retrieve relevant results with incompleteness  ...  Here we describe how BN-All-MB and BN-Beam can be extended to retrieve tuples with missing values on multiple query-constrained attributes. Let R (A 1 , A 2 , . ., An ) be a database relation.  ... 
arXiv:1208.5745v1 fatcat:o6ih7zdjnre7pnoxbm2uei7dv4

A framework to model real-time databases [article]

Nizar Idoudi , Bruno Sadeg
2010 arXiv   pre-print
Real-time databases deal with time-constrained data and time-constrained transactions.  ...  In this paper, we give an overview about different aspects of real-time databases and we clarify requirements of their modelling.  ...  Introduction Real-time databases have to deal with time-constrained data and time-constrained transactions.  ... 
arXiv:1001.1276v1 fatcat:pgyhkalpwbbjppf2z2sprip2cy

Spatial object aggregation based on data structure, local triangulation and hierarchical analyzing method

Liu Yaolin, Martien Molenaar, Menno-Jan Kraak, Liu Yanfang
2002 Geo-spatial Information Science  
The aggregation operation can be considered as a geometrical operation under the control of semantic and spatial relation of objects.  ...  The adjacent relation among connected objects and unconnected objects has been studied through constrained triangle as elementary processing unit in aggregation operation.  ...  We take similar value between objects from similarity matrix, compare their value size and select largest one for a group of objects having connectivity relation such as a 1 , a 2 , a 3 , a 4 .  ... 
doi:10.1007/bf02863494 fatcat:vc55ruk745c4db4unz27zmha3u

Bayesian networks for supporting query processing over incomplete autonomous databases

Rohit Raghunathan, Sushovan De, Subbarao Kambhampati
2013 Journal of Intelligent Information Systems  
A key challenge that these information mediators need to handle is the varying levels of incompleteness in the underlying databases in terms of missing attribute values.  ...  Our approach involves mining/"learning" Bayesian networks from a sample of the database, and using it to do both imputation (predict a missing value) and query rewriting (retrieve relevant results with  ...  5 , .., A n ) be a database relation.  ... 
doi:10.1007/s10844-013-0277-0 fatcat:ghxs4a4t6zgzfpcgt2kglizbou

Constrained Quantum Optimization for Resource Distribution Management

Sara El Gaily, Sándor Imre
2021 International Journal of Advanced Computer Science and Applications  
Keywords-Quantum computing; constrained quantum optimization algorithm; quantum extreme values searching algorithm; resource distribution management; cloud computing 42 | P a g e www.ijacsa.thesai.org  ...  In this work, we proposed a quantum optimization strategy that executes the tasks exponentially faster and with high accuracy named constrained quantum optimization algorithm (CQOA).  ...  The research reported in this paper was supported by the BME NC TKP2020 grant of NKFIH Hungary.  ... 
doi:10.14569/ijacsa.2021.0120806 fatcat:g2kapzshpzfijakvmrj7wqrthe

Artifact Configuration Across Different Design Levels [chapter]

N. Murtagh
1996 IFIP Advances in Information and Communication Technology  
Design of artifacts goes through several different stages as the initial design description is broken down and refined in the process of searching for a solution.  ...  This paper describes a flexible and easily maintainable system for configuration, using the layout design of an elevator shaft as a practical example.  ...  MaxCarWidth node with a + relation type. ( + implies that the value of the constrained node increases with the value of the constraining node.)  ... 
doi:10.1007/978-0-387-34930-5_10 fatcat:f743scwxergxroieh3shrjuhpe

An intensional approach to the specification of test cases for database applications

David Willmor, Suzanne M. Embury
2006 Proceeding of the 28th international conference on Software engineering - ICSE '06  
In this paper, we propose a new approach in which the database states required for testing are specified intensionally, as constrained queries, that can be used to prepare the database for testing automatically  ...  Current approaches either require exact database states to be specified in advance, or else generate a single initial state (under guidance from the user) that is intended to be suitable for execution  ...  David Willmor is supported by a research studentship from the UK Engineering and Physical Sciences Research Council.  ... 
doi:10.1145/1134285.1134301 dblp:conf/icse/WillmorE06 fatcat:4ddtwzdyrvg75e3le7szr3v5t4

Constrained Closed Datacubes [chapter]

Sébastien Nedjar, Alain Casali, Rosine Cicchetti, Lotfi Lakhal
2010 Lecture Notes in Computer Science  
This paper focuses on borders and lossless representations for Constrained Datacubes of database relations, which can represent manyvalued contexts.  ...  Therefore, by using the concept of cube closure, from a FCA perspective, we define three new information lossless representations for Constrained Datacubes: the L-Constrained Closed Datacube, the U -Constrained  ...  Constrained Datacube FrameworkLet us consider a database relation r (which can represent a many-valued context[11]) with a set of attributes dimensions D (denoted by D 1 , D 2 , . . . , D n ) and a set  ... 
doi:10.1007/978-3-642-11928-6_13 fatcat:si6vre62n5ardnxhifft4yfeti

The View-Update Problem for Indefinite Databases [chapter]

Luciano Caroprese, Irina Trubitsyna, Mirosław Truszczyński, Ester Zumpano
2012 Lecture Notes in Computer Science  
An indefinite database is a database with null values that are represented, following the standard database approach, by a single null constant.  ...  They narrow down the space of alternative ways to fulfill the view-update request to those that are grounded, in a certain strong sense, in the database, the view and the view-update request.  ...  Indefinite Databases We consider a finite set Π of relation symbols and a set Dom of constants that includes a designated element ⊥, called the null value. We define Dom d = Dom \ {⊥}.  ... 
doi:10.1007/978-3-642-33353-8_11 fatcat:cnrtmpvhnvhyzmerwyhazcl4ka

Reflective Programming in the Relational Algebra

Jan Van den Bussche, Dirk van Gucht, Gottfried Vossen
1996 Journal of computer and system sciences (Print)  
We first show that this extension, which we call the reflective algebra, can serve as a unifying formalization of various forms of procedural data management which have been considered in database systems  ...  This paper introduces a reflective extension of the relational algebra.  ...  ACKNOWLEDGMENTS We are indebted to Victor Vianu, who suggested to us a possible connection between recursive reflection and unbounded looping, and to Manoj Jain, who contributed to the proof of Theorem  ... 
doi:10.1006/jcss.1996.0040 fatcat:mr2juh4h4rcv3gor6ot6amefgm

On Constrained Open-World Probabilistic Databases [article]

Tal Friedman, Guy Van den Broeck
2019 arXiv   pre-print
Recent work on open-world probabilistic databases strengthens the semantics of these probabilistic databases by discarding the assumption that any information not present in the data must be false.  ...  One approach is to use a probabilistic database, a model with strong assumptions that allow for efficiently answering many interesting queries.  ...  This work is partially supported by NSF grants #IIS1657613, #IIS-1633857, #CCF-1837129, DARPA XAI grant #N66001-17-2-4032, NEC Research and a gift from Intel.  ... 
arXiv:1902.10677v2 fatcat:k4sytuw64jhc3n34h7tf7tkbhy

Grammars++ for modelling information in text

Airi Salminen, Frank Wm. Tompa
1999 Information Systems  
Grammars provide a convenient means to describe the set of valid strings in a language, and thus they seem natural for describing the set of valid instances in a text database.  ...  It is well-known that a given language can be described by many grammars, and similarly text database designers have a choice of grammar for specifying valid documents.  ...  As for relational databases, in using a filter for a view definition, the resulting tree may be either a virtual structure (similar to that produced by a query) or materialized (similar to an update).  ... 
doi:10.1016/s0306-4379(99)00002-2 fatcat:7wzimlcehfe55dagyzkij4qu7y

Cube Lattices: a Framework for Multidimensional Data Mining [chapter]

Alain Casali, Rosine Cicchetti, Lotfi Lakhal
2003 Proceedings of the 2003 SIAM International Conference on Data Mining  
In addition, we propose condensed representations of the constrained cube lattice which is a convex space.  ...  In this paper we propose a foundation for various multidimensional data mining problems by introducing a new algebraic structure called cube lattice which characterizes the search space to be explored.  ...  the original database relation.  ... 
doi:10.1137/1.9781611972733.35 dblp:conf/sdm/CasaliCL03 fatcat:chr5hbivlrcdbmo4evdcrse7bq
« Previous Showing results 1 — 15 out of 341,818 results