Buscar
Mostrando ítems 21-30 de 56160
A Comparison between a Relational Database and a Graph Database in the context of a Personalized Cancer Treatment Application
(2016)
This paper presents a performance comparison between a relational database (implemented in MySQL) and a graph database (implemented in Neo4j). Unlike traditional benchmarks, this comparison is made in the context of a real ...
A Comparison between a Relational Database and a Graph Database in the context of a Personalized Cancer Treatment Application
(2016)
This paper presents a performance comparison between a relational database (implemented in MySQL) and a graph database (implemented in Neo4j). Unlike traditional benchmarks, this comparison is made in the context of a real ...
A FAST ALGORITHM ON AVERAGE FOR ALL-AGAINST-ALL SEQUENCE MATCHING
(IEEE TECHNICAL COMMITTEE ON DATA ENGINEERING, 1999)
We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. ...
The Animated Database Courseware (ADbC) and the Database Design Module
(Instituto de Informática - Universidade Federal do Rio Grande do Sul, 2010)
FPGAS and Database Engines Integration
(ITESO, 2017-08)
FPGAS and Database Engines Integration
(ITESO, 2017-08)
Specifying active databases in the situation calculus
(IEEE, 1998)
The paper provides a predicate logic based semantics for active rules in active databases. Previous work has been done to provide the semantics of execution of active rules. In part, this work has been directed towards ...
Multi-relational algorithm for mining association rules in large databases
(2011-12-01)
Multi-relational data mining enables pattern mining from multiple tables. The existing multi-relational mining association rules algorithms are not able to process large volumes of data, because the amount of memory required ...