Akademische Ressourcen durchsuchen

Fachgebiete / Stichwörter: WIEDERHOLD, GIO; MCGRAW-HILL; 005.74 W644d

Fachgebiete / Stichwörter: ELBRA, TONY; NCC PUBLICATIONS; 005.74 E37d

Fachgebiete / Stichwörter: KROENKE, DAVID; SCIENCE RESEARCH ASSOCIATES; 005.74 K93d

In addition to maintaining the GenBank(R) nucleic acid sequence database, the National Center for Biotechnology Information (NCBI) provides data analysis and retrieval resources for the data in GenBank and other biologic...

"This article studies the analysis of moving object data collected by location-aware devices, such as GPS, using graph databases. Such raw trajectories can be transformed into so-called semantic trajectories, which are s...

Detection of atypical response trajectories in biomedical longitudinal databases Many health care professionals and institutions manage longitudinal databases, involving follow-ups for different patients over time. Longi...

"In current “Big Data” scenarios, graph databases are increasingly being used. Online Analytical Processing (OLAP) operations can expand the possibilities of graph analysis beyond the traditional graphbased computati...

Fachgebiete / Stichwörter: PRENTICE-HALL; 005.74 A244a

Fachgebiete / Stichwörter: DATE, C. J; ADDISON-WESLEY; 005.74 D232i2

Fachgebiete / Stichwörter: TEOREY, TOBY J; PRENTICE-HALL; 005.74 T314d

Fachgebiete / Stichwörter: ACADEMIC PRESS; 005.74 I34i

Fachgebiete / Stichwörter: LYON, JOHN K; JOHN WILEY & SONS; 658.05 L991d

We propose a framework for studying the effect of KDD on CRM in the Egyptian banking sector. We believe that the KDD process and applications may perform a significant role in Egyptian banks to improve CRM, in particular...

This article describes strategies devised to improve the efficiency of two classical index data structures for parallel textual databases. The design and cost evaluation is effected on top of the bulk-synchronous model o...

Information systems play an ever-increasing key role in our society. In particular, data intensive applications are in constant demand and there is need of computing environments with much more intelligent capabilities t...

The studies of Relational Data Base Management Systems and Databases constitute nowadays a main tren of investigation in large businesses and universities of the entire world. The creation of a data base engine keeps bei...

Manipulating and retrieving multimedia data has received increasing attention with the advent of cloud storage facilities. The ability of querying by similarity over large data collections is mandatory to improve storage...

In this work we will study the problem of the design of the "Integration Model for Distributed Database System". We particularly design the canonical model through the ontological handling of the information. The ontolog...

This book provides an excellent foundation for the principles of database and data management. It explains some of the more difficult concepts fairly well. The book is meant for an introductory course in database managem...

This paper describes two parallel algorithms for the eÆcient processing of relational database transactions and presents a performance analysis of them. These algorithms are built upon the bulk-synchronous parallel mode...

Minimization of query execution time is an important performance objective in distributed databases design. While total time is to be minimized for On Line Transaction Processing (OLTP) type queries, response time has to...

We discuss how data mining, patternbases and databases can be integrated into inductive databases, which make data mining an inductive query process. We propose a software architecture for such inductive databases, and e...

Part 1 The lexical database: nouns in WordNet, George A. Miller modifiers in WordNet, Katherine J. Miller a semantic network of English verbs, Christiane Fellbaum design and implementation of the WordNet lexical database...

An unsorted database contains N records, of which just one satisfies a particular property. The problem is to identify that one record. Any classical algorithm, deterministic or probabilistic, will clearly take O (N) ste...