We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
u s e s t h e p r i m a r y c o p y r e p l i c a t i o nAbstract technique [1, 26, 27]. In this method, client calls are directed to a single primary server, which communicatesThi...
Barbara Liskov, Robert Gruber, Paul Johnson, Liuba...
Abstract. To achieve acceptable query response times in data warehouse environments, the data have to be pre-aggregated according to the need of the applications and stored redunda...