| Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
|---|---|---|---|---|---|
| Balsters, H. | Modelling database views with derived classes in the UML/OCL-framework | 2003 | International Conference on the Unified Modeling Language (UML) | inproceedings | URL |
| Abstract: One of the central notions in database modelling is the notion of a database view. A database view closely corresponds to the notion of derived class in UML. This paper will show how the notion of a relational database view can be correctly expressed as a derived class in UML/OCL (version 2.0). A central part of our investigation concerns the generality of our manner of representing relational views in OCL. Since, in general terms, a database view closely corresponds to the notion of a named query, an important problem that we address in our paper is the expressiveness of OCL as a query language. In particular, we will discuss the relational completeness of OCL (w.r.t the relational algebra). We will show that OCL (version 2.0) is relationally complete in a minimal sense, but not in a (desired) maximal sense. As a consequence, we will argue for certain language extensions in OCL in order to achieve that OCL is maximally relationally complete. | |||||
BibTeX:
@inproceedings{balsters03,
author = {Hermann Balsters},
title = {Modelling database views with derived classes in the UML/OCL-framework},
booktitle = {International Conference on the Unified Modeling Language (UML)},
year = {2003},
volume = {2863},
pages = {295-309},
url = {http://dx.doi.org/10.1007/b14063}
}
|
|||||
| Belleau, F., Nolin, M., Tourigny, N., Rigault, P. & Morissette, J. | Bio2RDF: Towards a mashup to build bioinformatics knowledge systems | 2008 | Journal of Biomedical Informatics | article | URL |
| Abstract: Presently, there are numerous bioinformatics databases available on different websites. Although RDF was proposed as a standard format for the web, these databases are still available in various formats. With the increasing popularity of the semantic web technologies and the ever growing number of databases in bioinformatics, there is a pressing need to develop mashup systems to help the process of bioinformatics knowledge integration. Bio2RDF is such a system, built from rdfizer programs written in JSP, the Sesame open source triplestore technology and an OWL ontology. With Bio2RDF, documents from public bioinformatics databases such as Kegg, PDB, MGI, HGNC and several of NCBI's databases can now be made available in RDF format through a unique URL in the form of http://bio2rdf.org/namespace:id. The Bio2RDF project has successfully applied the semantic web technology to publicly available databases by creating a knowledge space of RDF documents linked together with normalized URIs and sharing a common ontology. Bio2RDF is based on a three-step approach to build mashups of bioinformatics data. The present article details this new approach and illustrates the building of a mashup used to explore the implication of four transcription factor genes in Parkinson's disease. The Bio2RDF repository can be queried at http://bio2rdf.org. | |||||
BibTeX:
@article{keyhere,
author = {Fran�ois Belleau and Marc-Alexandre Nolin and Nicole Tourigny and Philippe Rigault and Jean Morissette},
title = {Bio2RDF: Towards a mashup to build bioinformatics knowledge systems},
journal = {Journal of Biomedical Informatics},
year = {2008},
volume = {In Press, Corrected Proof},
pages = {--},
url = {http://www.sciencedirect.com/science/article/B6WHD-4S3S2HJ-2/2/e60cdd078bdf86af287bc5926bcd1254}
}
|
|||||
| Bhattacharyya, S. | Evolutionary algorithms in data mining: multi-objective performance modeling for direct marketing | 2000 | KDD '00: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining | inproceedings | DOIURL |
| Abstract: Predictive models in direct marketing seek to identify individuals most likely to respond to promotional solicitations or other intervention programs. While standard modelling approaches embody single objectives, real-world decision problems often seek multiple performance measures. Decision-makers here desire solutions that simultaneously optimise on multiple objectives, or obtain an acceptable tradeoff amongst objectives. Multi-criteria problems often characterise a range of solutions, none of which dominate the others with respect to the multiple objectives - these specify the Pareto-frontier of nondominated solutions, each offering a different level of tradeoff. This paper proposes the use of evolutionary computation based procedures for obtaining a set of nondominated models with respect to multiple stated objectives. The targeting depth-of-file presents a crucial real-world criterion in direct marketing, and models here are tailored for specified file-depths. Decision-makers are thus able to obtain a set of models along the Pareto-frontier, for a specific file-depth. The choice of a model to implement can be thus based on observed tradeoffs in the different objectives, based on possibly subjective and problem specific judgements. Given distinct models tailored for different file-depths, the implementation decision can also consider performance tradeoffs at the different depths-offile. Empirical results from a real-world problem illustrate the benefits of the proposed approach. Both linear and nonlinear models obtained by genetic search are examined. | |||||
BibTeX:
@inproceedings{347186,
author = {Siddhartha Bhattacharyya},
title = {Evolutionary algorithms in data mining: multi-objective performance modeling for direct marketing},
booktitle = {KDD '00: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining},
publisher = {ACM Press},
year = {2000},
pages = {465--473},
url = {http://portal.acm.org/ft_gateway.cfm?id=347186&type=pdf&coll=GUIDE&dl=GUIDE&CFID=43813975&CFTOKEN=68162530},
doi = {doi:10.1145/347090.347186}
}
|
|||||
| Choenni, S. | On the Suitability of Genetic-Based Algorithms for Data Mining [BibTeX] |
1999 | Advances in Database Technologies | inproceedings | |
BibTeX:
@inproceedings{Choenni:1999:SGB,
author = {Sunil Choenni},
title = {On the Suitability of Genetic-Based Algorithms for Data Mining},
booktitle = {Advances in Database Technologies},
publisher = {Springer-Verlag},
year = {1999},
volume = {1552},
pages = {55--67}
}
|
|||||
| Heckenberger, M., Maurer, H. P., Melchinger, A. E. & Frisch, M. | The Plabsoft database: a comprehensive database management system for integrating phenotypic and genomic data in academic and commercial plant breeding programs | 2008 | EUPHYTICA | article | |
| Abstract: Besides phenotypic data from field trials and molecular data from lab experiments, modern plant breeding programs generate a wide variety of data, for instance pedigree, randomization, geostatistical or climate data. Due to the lack of an integrated database system, breeders generally exploit only part of these data for selection decisions or retrieve only part of the information present in the data. Most approaches in genomics, however, develop their full power only when they are based on analyses of large numbers of genotypes from multiple crosses and current as well as past generations. We have developed a flexible data management and -analyses system for storage and quality control of plant breeding data. It is implemented using the PostgreSQL database management system and linked to the R software environment for integrated statistical analyses of phenotypic and genomic data. The database structure is capable of managing the following types of data observed in breeding programs of all major crops: (a) germplasm data of any species including pedigree data, (b) phenotypic data of any trait and trait complexity, (c) trial management data for any field and trial design, (d) molecular marker data for all common types of markers, as well as (e) project and study management data. | |||||
BibTeX:
@article{ISI:000254877800016,
author = {Martin Heckenberger and Hans Peter Maurer and Albrecht E. Melchinger and Matthias Frisch},
title = {The Plabsoft database: a comprehensive database management system for integrating phenotypic and genomic data in academic and commercial plant breeding programs},
journal = {EUPHYTICA},
year = {2008},
volume = {161},
number = {1-2},
pages = {173-179}
}
|
|||||
| Ho, A. & Lumpkin, G. | The Genetic Query Optimizer | 1994 | Genetic Algorithms at Stanford 1994 | incollection | |
| Abstract: "For complex queries, we find that the genetic algorithm produces more efficient query plans in a running time comparable to that of conventional methods". | |||||
BibTeX:
@incollection{ho:1994:gqo,
author = {Alex Ho and George Lumpkin},
title = {The Genetic Query Optimizer},
booktitle = {Genetic Algorithms at Stanford 1994},
publisher = {Stanford Bookstore},
year = {1994},
pages = {67--76}
}
|
|||||
| Humm, B. & Wietek, F. | Architektur von Data Warehouses und Business Intelligence Systemen | 2005 | Informatik-Spektrum | article | URL |
| Abstract: Business Intelligence (BI) ist der Prozess der Umwandlung von Daten in Informationen und weiter in Wissen. Entscheidungen und Prognosen stützen sich auf dieses Wissen und schaffen dadurch Mehrwert für ein Unternehmen. Ein Data Warehouse (DW) bildet in vielen Fällen die technische Basis zur Implementierung einer BI-Lösung. | |||||
BibTeX:
@article{HummWietek05InformatikSpektrum,
author = {Bernhard Humm and Frank Wietek},
title = {{Architektur von Data Warehouses und Business Intelligence Systemen}},
journal = {Informatik-Spektrum},
year = {2005},
volume = {28},
number = {1},
pages = {3-14},
url = {http://dx.doi.org/10.1007/s00287-004-0450-5}
}
|
|||||
| Seltzer, M. | Beyond Relational Databases | 2008 | Communications of the ACM | article | URL |
| Abstract: There is more to data access than SQL. | |||||
BibTeX:
@article{Seltzer08cacm,
author = {Margo Seltzer},
title = {Beyond Relational Databases},
journal = {Communications of the ACM},
year = {2008},
volume = {51},
number = {7},
pages = {52-58},
url = {http://dx.doi.org/10.1145/1364782.1364797}
}
|
|||||
| Stillger, M. | AQuES - ein flexibles, verteiltes System zur Optimierung und Auswertung relationaler Anfragen | 2000 | School: Humboldt-University, Mathematisch-Naturwissenschaftliche Fakultat II | phdthesis | URL |
| Abstract: Zusammenfassung Die parallele Anfragebearbeitung f00FCr relationale Datenbankmanagementsysteme (RDBMS) ist wegen ihrer unterschiedlichen Arten der Ausf00FChrungsparallelit00E4t und den Eigenschaften der zugrunde liegenden parallelen Architektur ein 00E4usserst komplexes Problem. System00E4nderungen zur Laufzeit der Anfrage k00F6nnen zus00E4tzlich ein dynamisches Verhalten der ausf00FChrenden Komponenten erfordern, um eine nahezu optimale Antwortzeit zu gew00E4hrleisten. Diese Arbeit stellt einen neuen, flexiblen Ansatz f00FCr die Optimierung und Abarbeitung von komplexen Anfragen vor, der besonders die dynamische Optimierung ber00FCcksichtigt. Insbesondere werden in der Arbeit folgende Teile pr00E4sentiert: 1. die Architektur eines neuen, verteilt-kooperierenden Komponentensystems beeinflusst von agenten-orientierten Konzepten; 2. der Entwurf und die Realisierung einer neuen Kommunikationsinfrastruktur f00FCr die identifizierten Systemkomponenten; 3. der Entwurf und die Implementierung eines flexiblen Anfrageoptimierers mit einem neuen, zufallsbasierten Algorithmus; und 4. der Entwurf und die Realisierung einer parallel arbeitenden Ausf00FChrungskomponente unter besonderer Ber00FCcksichtigung der dynamischen Anfrageoptimierung. Bei der Entwicklung der Konzepte standen neben den spezifischen Anforderungen f00FCr RDBMS besonders die Konfigurierbarkeit und die Erweiterbarkeit des verteilten Systems im Vordergrund. | |||||
BibTeX:
@phdthesis{stillger:thesis,
author = {Michael Stillger},
title = {{AQ}u{ES} - ein flexibles, verteiltes System zur Optimierung und Auswertung relationaler Anfragen},
school = {Humboldt-University, Mathematisch-Naturwissenschaftliche Fakultat II},
year = {2000},
url = {http://edoc.hu-berlin.de/dissertationen/stillger-michael-2000-01-21/PDF/Stillger.pdf}
}
|
|||||
| Encyclopedia of Database Systems | 2008 | book | URL | ||
| Abstract: The Encyclopedia of Database Systems will be a comprehensive reference to topics in database systems for students, researchers and practitioners who need a quick and authoritative reference to the subject of databases, data management, and database systems, such as basic concept definition, data processing algorithms, key results to date, and references to source materials. The encyclopedia will feature an alphabetical organization of nearly 1000 entries, covering both topics of current interest and key research results of historical significance in all the main areas of database systems. Publication by Springer is planned for 2008; the Encyclopedia of Database Systems will be available as a printed volume and an online reference work. |
|||||
BibTeX:
@book{LiuOezsu2008,,
title = {Encyclopedia of Database Systems},
publisher = {Springer},
year = {2008},
note = {to appear},
url = {http://refworks.springer.com/database-systems/}
}
|
|||||
Created by JabRef export filters on 08/09/2008 by the social publication management platform BibSonomy