11573 search results - page 187 / 2315 » Designing Relational Databases |
261
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
k-Anonymity protects privacy by ensuring that data cannot be linked to a single individual. In a k-anonymous dataset, any identifying information occurs in at least k tuples. Much...
166
click to vote
SIGMOD
1996
ACM
15 years 10 months ago
1996
ACM
We introduce the problem of mining association rules in large relational tables containing both quantitative and categorical attributes. An example of such an association might be...
155
click to vote
CONTEXT
2007
Springer
15 years 10 months ago
2007
Springer
The paper presents an approach for automatically extracting views from a relational database schema, based on the knowledge of the application domain. In order to achieve such resu...
162
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
286
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
As relational databases proliferate and become increasingly complex, both in their internal structure and in their interactions with other databases and applications, there is a g...