Results 281 to 290 of about 51,655,942 (350)

On data dependencies in dataspaces

2011 IEEE 27th International Conference on Data Engineering, 2011
To study data dependencies over heterogeneous data in dataspaces, we define a general dependency form, namely comparable dependencies (CDs), which specifies constraints on comparable attributes. It covers the semantics of a broad class of dependencies in databases, including functional dependencies (FDs), metric functional dependencies (MFDs), and ...
Shaoxu Song, Lei Chen 0002, Philip S. Yu
openaire   +2 more sources

Sparse computation data dependence simplification for efficient compiler-generated inspectors

ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2019
This paper presents a combined compile-time and runtime loop-carried dependence analysis of sparse matrix codes and evaluates its performance in the context of wavefront parallellism. Sparse computations incorporate indirect memory accesses such as x[col[
M. Mohammadi, Tomofumi Yuki, Kazem Cheshmi, Eddie C. Davis, Mary W. Hall, M. Dehnavi, Payal Nandy, C. Olschanowsky, Anand Venkat, M. Strout   +9 more
semanticscholar   +1 more source

A Proof Procedure for Data Dependencies

Journal of the ACM, 1984
A class of dependencies, tuple and equality generating dependencies, is defined, and the chase process is generalized to deal with these dependencies. For total dependencies the chase is an exponential time decision procedure for the implication problem, and in some restricted cases it can be modified to run in polynomial time.
Catriel Beeri, Moshe Y. Vardi
openaire   +1 more source

Fragmentation in Presence of Data Dependencies

IEEE Transactions on Dependable and Secure Computing, 2014
Fragmentation has been recently proposed as a promising approach to protect the confidentiality of sensitive associations whenever data need to undergo external release or storage. By splitting attributes among different fragments, fragmentation guarantees confidentiality of the associations among these attributes under the assumption that such ...
Sabrina De Capitani di Vimercati, Sara Foresti, Sushil Jajodia, Giovanni Livraga, Stefano Paraboschi, Pierangela Samarati   +5 more
openaire   +4 more sources

DETECTING FINANCIAL DATA DEPENDENCE STRUCTURE BY AVERAGING MIXTURE COPULAS

Econometric Theory, 2018
A mixture copula is a linear combination of several individual copulas that can be used to generate dependence structures not belonging to existing copula families.
Guannan Liu, Wei Long, Xin-Yu Zhang, Qi Li   +3 more
semanticscholar   +1 more source

Fuzzy data dependencies and implication of fuzzy data dependencies

Fuzzy Sets and Systems, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Contexts and Data Dependencies: A Synthesis

IEEE Transactions on Pattern Analysis and Machine Intelligence, 1983
Two data-organization devices that have come out of AI re-search are data pools (``contexts'') and data dependencies. The latter are more flexible than the former, and have supplanted them. Data pools offer certain advantages of efficiency, however, so it is worth trying to make the two mechanisms compatible.
openaire   +2 more sources

Effectiveness of data dependence analysis

International Journal of Parallel Programming, 1995
Data dependence testing is the basic step in detecting loop level parallelism in numerical programs. The problem is undecidable in the general case. Therefore, work has been concentrated on a simplified problem, affine memory disambiguation. In this simpler domain, array references and loops bounds are assumed to be linear integer functions of loop ...
Dror E. Maydan, John L. Hennessy, Monica S. Lam   +2 more
openaire   +1 more source

Testing implications of data dependencies

Proceedings of the 1979 ACM SIGMOD international conference on Management of data - SIGMOD '79, 1979
Presented is a computation method—the chase —for testing implication of data dependencies by a set of data dependencies. The chase operates on tableaux similar to those of Aho, Sagiv, and Ullman. The chase includes previous tableau computation methods as special cases.
David Maier 0001, Alberto O. Mendelzon, Yehoshua Sagiv   +2 more
openaire   +2 more sources

On the expressive power of data dependencies

Acta Informatica, 1986
Since the language of data dependencies is a language for semantic specification of databases, it is highly desirable to know which classes of databases are axiomatizable by different kinds of data dependencies. As a decisive step towards a comprehensive theory, the paper under review gives characterizations of axiomatizability of (finite) databases by
Johann A. Makowsky, Moshe Y. Vardi
openaire   +2 more sources