4 search results - page 1 / 1 » Optimizing Queries with Universal Quantification in Object-O... |
VLDB
1997
ACM
13 years 9 months ago
1997
ACM
CINQ
2004
Springer
13 years 10 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
SIGMOD
1996
ACM
13 years 9 months ago
1996
ACM
Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods a...
IDEAS
2000
IEEE
13 years 9 months ago
2000
IEEE
Today many applications routinely generate large quantities of data. The data often takes the form of (time) series, or more generally streams, i.e. an ordered sequence of records...