470 search results - page 15 / 94 » Privacy-Preserving Queries over Relational Databases |
DBPL
2007
Springer
14 years 21 days ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
We introduce the notion of a data topology and the problem of topology search over databases. A data topology summarizes the set of all possible relationships that connect a given...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
COMAD
2008
13 years 10 months ago
2008
In existing database systems there is a strong need for searching data according to many attributes. In commercial database platforms, the standard search over multiple attributes...
APWEB
2004
Springer
14 years 2 months ago
2004
Springer
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...