Sciweavers

3377 search results - page 219 / 676
» Describing differences between databases
Sort
View
SAC
2004
ACM
15 years 9 months ago
A new algorithm for gap constrained sequence mining
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
Salvatore Orlando, Raffaele Perego, Claudio Silves...
MIDDLEWARE
2004
Springer
15 years 9 months ago
Ganymed: Scalable Replication for Transactional Web Applications
Data grids, large scale web applications generating dynamic content and database service providing pose significant scalability challenges to database engines. Replication is the ...
Christian Plattner, Gustavo Alonso
VLDB
1991
ACM
146views Database» more  VLDB 1991»
15 years 7 months ago
An Evaluation of Non-Equijoin Algorithms
A non-equijoin of relations R and S is a band join if the join predicate requires values in the join attribute of R to fall within a speci ed band about the values in the join att...
David J. DeWitt, Jeffrey F. Naughton, Donovan A. S...
128
Voted
FGCS
2007
86views more  FGCS 2007»
15 years 4 months ago
A grid-based approach for enterprise-scale data mining
Abstract— We describe a grid-based approach for enterprisescale data mining that leverages database technology for I/O parallelism, and on-demand compute servers for compute para...
Ramesh Natarajan, Radu Sion, Thomas Phan
ICDE
2009
IEEE
194views Database» more  ICDE 2009»
16 years 5 months ago
Effective XML Keyword Search with Relevance Oriented Ranking
Abstract-- Inspired by the great success of information retrieval (IR) style keyword search on the web, keyword search on XML has emerged recently. The difference between text data...
Zhifeng Bao, Tok Wang Ling, Bo Chen, Jiaheng Lu