654 search results - page 64 / 131 » Complexity of Answering Queries Using Materialized Views |
125
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views,...
138
click to vote
SIGSOFT
2007
ACM
16 years 4 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
143
click to vote
WISE
2002
Springer
15 years 8 months ago
2002
Springer
How to extract data from XML documents is an important issue for XML research and development. However, how to view XML documents determines how they can be queried. In this paper...
144
click to vote
DBKDA
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
158
click to vote
CIE
2007
Springer
15 years 7 months ago
2007
Springer
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...