4113 search results - page 462 / 823 » Watermarking Relational Databases |
158
Voted
ICDT
2001
ACM
15 years 10 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
178
click to vote
ICC
2000
IEEE
15 years 10 months ago
2000
IEEE
—When a universal personal telecommunications (UPT) user visits a mobile network, both terminal mobility and personal mobility are involved and it may take a long time for UPT ca...
186
click to vote
DASFAA
1999
IEEE
15 years 10 months ago
1999
IEEE
A data warehouse stores materialized views over data from one or more sources in order to provide fast access to the integrated data, regardless of the availability of the data so...
149
click to vote
SIGMOD
1999
ACM
15 years 10 months ago
1999
ACM
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...
149
click to vote
EDBT
1998
ACM
15 years 10 months ago
1998
ACM
An importantuse of data warehousing is to provide temporal views over the history of source data that may itself be non-temporal. While recent work in view maintenance is applicab...