923 search results - page 26 / 185 » On the Computation of Relational View Complements |
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
3DIM
2005
IEEE
15 years 5 months ago
2005
IEEE
Nowadays, with the exponential growing of 3D object representations in private databases or on the web, it is all the more required to match these objects from some views. To impr...
VLDB
1998
ACM
15 years 4 months ago
1998
ACM
Semistructured data is not strictly typed like relational or object-oriented data and may be irregular or incomplete. It often arises in practice, e.g., when heterogeneous data so...
ACSC
2007
IEEE
15 years 6 months ago
2007
IEEE
Full hierarchical dependencies (FHDs) constitute a large class of relational dependencies. A relation exhibits an FHD precisely when it can be decomposed into at least two of its ...
171
click to vote
VLDB
2006
ACM
16 years 7 hour ago
2006
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...