DEFINITION An XML tuple-based algebra operates on a domain that consists of sets of tuples whose attribute values are items, i.e., atomic values or XML elements (and hence, possibly, XML trees). Operators receive one or more sets of tuples and produce a set, list or bag of tuples of items. It is common that the algebra has special operators for converting XML inputs into instances of the domain...

All-or-nothing transforms have been defined as bijective mappings on all s-tuples over a specified finite alphabet. These are required to satisfy certain “perfect security” conditions using entropies of the probability distribution input s-tuples. Alternatively, purely combinatorial definitions AONTs given, which involve kinds “unbiased arrays”. However, definition makes no reference definition...

Table constraints define an arbitrary constraint explicitly as a set of solutions (tuples) or non-solutions. Thus, space is proportional to number of tuples. Simple Tabular Reduction (STR), which dynamically reduces the table size by maintaining a table of only the valid tuples, has been shown to be efficient for enforcing Generalized Arc Consistency. The Cartesian product representation is ano...

A set of n tuples in a relation of a relational database design is tested tlpon the constraints of the join dependency. Some constraint equalities are found to be redundant. To remove thfs superEluity, the universe of atttbutes is partitioned into n dfsjolnt sets and a new notat.ion of join dependency is introduced. The checking time In each run of n tuples is significantly reduced by a factor ...

We present GDBR, Generalize DataBase Relation, an optimal, on-line O(n) algorithm for database relation generalization using concept hierarchies. The algorithm is a variant of attribute-oriented induction which generalizes database relations in either O(n log n) or O(np) time, where n is the number of input tuples and p is the number of tuples in the output relation. We augment the concept hier...

Extraction of structured information from text corpora involves identifying entities and the relationship between entities expressed in unstructured text. We propose a novel iterative pattern induction method to extract relation tuples exploiting lexical and shallow syntactic pattern of a sentence. We start with a single pattern to illustrate how the method explores additional paterns and tuple...

In this paper we introduce a distortion free invisible watermarking technique for relational databases. The main idea is to build the watermark after partitioning tuples with actual attribute values. Then, we build hash functions on top of this grouping and get a watermark as a permutation of tuples in the original table. As the ordering of tuples does not affect the original database, this tec...

Bursty and out-of-order tuple arrivals complicate the process of determining the content and boundary of sliding windows. To process windows over such streams, two issues need to be addressed: how to sort input tuples efficiently and how to estimate punctuations. In this paper, we focus on these issues to process sliding windows efficiently and accurately over disordered streams. Regarding the ...

Possibility theory is applied to introduce and reason about the fundamental notion of a key for uncertain data. Uncertainty is modeled qualitatively by assigning to tuples of data a degree of possibility with which they occur in a relation, and assigning to keys a degree of certainty which says to which tuples the key applies. The associated implication problem is characterized axiomatically an...

AESTRACT We introduce a new fault representation mechanism for digital circuits based on fault tuples. A fault tuple is a simple 3-element condition for a signal line, its value, and clock cyclle constraint. AND-OR expressions of fault tuples are used to represent arbitrary misbehaviors. A fault simulator based on fault tuples was used to conduct experiments on benchmark circuits. Simulation re...