EDBT
2012
ACM
12 years 1 months ago
2012
ACM
The range searching problem is fundamental in a wide spectrum of applications such as radio frequency identification (RFID) networks, location based services (LBS), and global po...
EDBT
2012
ACM
12 years 1 months ago
2012
ACM
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...
ICDT
2012
ACM
12 years 1 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
ICDT
2012
ACM
12 years 1 months ago
2012
ACM
The problems of query containment, equivalence, and minimization are recognized as very important in the context of query processing, specifically of query optimization. In their...
ICDT
2012
ACM
12 years 1 months ago
2012
ACM
We introduce a new normal form, called essential tuple normal form (ETNF), for relations in a relational database where the constraints are given by functional dependencies and jo...
ICDT
2012
ACM
12 years 1 months ago
2012
ACM
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
ICDT
2012
ACM
12 years 1 months ago
2012
ACM
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...
ICDT
2012
ACM
12 years 1 months ago
2012
ACM
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
ICDT
2012
ACM
12 years 1 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
ICDE
2012
IEEE
12 years 1 months ago
2012
IEEE
—Traditional clustering algorithms identify just a single clustering of the data. Today’s complex data, however, allow multiple interpretations leading to several valid groupin...