ADBIS
2001
Springer
13 years 8 months ago
2001
Springer
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are...
ADBIS
2001
Springer
13 years 9 months ago
2001
Springer
Data mining is an interactive and iterative process. It is very likely that a user will execute a series of similar queries differing in pattern constraints and mining parameters,...
ADBIS
2001
Springer
13 years 9 months ago
2001
Springer
ADBIS
2001
Springer
13 years 9 months ago
2001
Springer
One potential problem of active database applications is the non-termination of rules. Although algorithms have been proposed to detect non-termination, almost all provide a conser...
ADBIS
2001
Springer
13 years 9 months ago
2001
Springer
ADBIS
2001
Springer
13 years 9 months ago
2001
Springer
ADBIS
2001
Springer
13 years 9 months ago
2001
Springer
Three join algorithms are evaluated in an environment with distributed main-memory based mediators and data sources. A streamed ship-out join ships bulks of tuples to a mediator ne...
ADBIS
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we address an issue common in the frame of WWW, namely information entities that present di erent facets under di erent contexts (or worlds). Handling such multifacet...
ADBIS
2001
Springer
13 years 9 months ago
2001
Springer
ADBIS
2001
Springer
13 years 9 months ago
2001
Springer
Due to the rapid growth of the Web, there is an increasing need for methodologies that support the design of Web-based Information Systems (WIS). After investigating the applicatio...