@article{HummWietek05InformatikSpektrum, title = {{Architektur von Data Warehouses und Business Intelligence Systemen}}, author = {Bernhard Humm and Frank Wietek}, journal = {Informatik-Spektrum}, number = 1, pages = {3-14}, volume = 28, year = 2005, url = {http://dx.doi.org/10.1007/s00287-004-0450-5}, timestamp = {2008.02.05}, issn = {0170-6012}, file = {SpringerLink:2005/HummWietek05InformatikSpektrum.pdf:PDF}, owner = {flint}, 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.}, biburl = {http://www.bibsonomy.org/bibtex/26388863f51ba97e615fd0b0ff11a1b07/flint63}, keywords = {recognition interface analysis enterprise business information springer v0805 pattern database data paper} } @book{LiuOezsu2008, title = {Encyclopedia of Database Systems}, address = {Berlin, Heidelberg}, editor = {Ling Liu and M. Tamer Özsu}, note = {to appear}, publisher = {Springer}, year = 2008, url = {http://refworks.springer.com/database-systems/}, timestamp = {2008.02.20}, owner = {flint}, 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.}, biburl = {http://www.bibsonomy.org/bibtex/28f4f92684fa8ecafe24dfd5d285f1f41/flint63}, keywords = {lexicon check v0805 general springer book database} } @inproceedings{balsters03, title = {Modelling database views with derived classes in the UML/OCL-framework}, address = {San Francisco}, author = {Hermann Balsters}, booktitle = {International Conference on the Unified Modeling Language (UML)}, month = {September}, pages = {295-309}, volume = 2863, year = 2003, url = {http://dx.doi.org/10.1007/b14063}, 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.}, biburl = {http://www.bibsonomy.org/bibtex/26578f97ca6da1c4b4dd65e5d33812adf/neilernst}, keywords = {OCL UML database} } @phdthesis{stillger:thesis, title = {{AQ}u{ES} - ein flexibles, verteiltes System zur Optimierung und Auswertung relationaler Anfragen}, address = {Berlin}, author = {Michael Stillger}, month = {21 January}, school = {Humboldt-University, Mathematisch-Naturwissenschaftliche Fakultat II}, year = 2000, url = {http://edoc.hu-berlin.de/dissertationen/stillger-michael-2000-01-21/PDF/Stillger.pdf}, notes = {In German}, size = {200+ pages}, abstract = {Zusammenfassung Die parallele Anfragebearbeitung f\x{00FC}r relationale Datenbankmanagementsysteme (RDBMS) ist wegen ihrer unterschiedlichen Arten der Ausf\x{00FC}hrungsparallelit\x{00E4}t und den Eigenschaften der zugrunde liegenden parallelen Architektur ein \x{00E4}usserst komplexes Problem. System\x{00E4}nderungen zur Laufzeit der Anfrage k\x{00F6}nnen zus\x{00E4}tzlich ein dynamisches Verhalten der ausf\x{00FC}hrenden Komponenten erfordern, um eine nahezu optimale Antwortzeit zu gew\x{00E4}hrleisten. Diese Arbeit stellt einen neuen, flexiblen Ansatz f\x{00FC}r die Optimierung und Abarbeitung von komplexen Anfragen vor, der besonders die dynamische Optimierung ber\x{00FC}cksichtigt. Insbesondere werden in der Arbeit folgende Teile pr\x{00E4}sentiert: 1. die Architektur eines neuen, verteilt-kooperierenden Komponentensystems beeinflusst von agenten-orientierten Konzepten; 2. der Entwurf und die Realisierung einer neuen Kommunikationsinfrastruktur f\x{00FC}r 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 Ausf\x{00FC}hrungskomponente unter besonderer Ber\x{00FC}cksichtigung der dynamischen Anfrageoptimierung. Bei der Entwicklung der Konzepte standen neben den spezifischen Anforderungen f\x{00FC}r RDBMS besonders die Konfigurierbarkeit und die Erweiterbarkeit des verteilten Systems im Vordergrund.}, biburl = {http://www.bibsonomy.org/bibtex/28d9a69258493a4f0b5208ce880fb2855/brazovayeye}, keywords = {Anfragebearbeitung, programming, agents, systems, Datenbankmanagementsystem, genetic optimization, management processing, Anfrageoptimierung, database Software-Agenten query algorithms, software} } @inproceedings{347186, title = {Evolutionary algorithms in data mining: multi-objective performance modeling for direct marketing}, address = {Boston, Massachusetts, United States}, author = {Siddhartha Bhattacharyya}, booktitle = {KDD '00: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining}, pages = {465--473}, publisher = {ACM Press}, year = 2000, url = {http://portal.acm.org/ft_gateway.cfm?id=347186&type=pdf&coll=GUIDE&dl=GUIDE&CFID=43813975&CFTOKEN=68162530}, address = {New York, NY, USA}, isbn = {1-58113-233-6}, notes = {p470 {"}, doi = {doi:10.1145/347090.347186}, size = {9 pages}, 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.}, biburl = {http://www.bibsonomy.org/bibtex/23953e66c911e452743ccd273c4c9e13b/brazovayeye}, keywords = {computation, genetic database Experimentation, Pareto-optimal data Design, marketing, Theory, Human objectives multiple Management, programming, Algorithms, mining, Performance, algorithms, evolutionary Factors, models, Measurement,} } @inproceedings{Choenni:1999:SGB, title = {On the Suitability of Genetic-Based Algorithms for Data Mining}, address = {Singapore}, author = {Sunil Choenni}, booktitle = {Advances in Database Technologies}, editor = {Yahiko Kambayashi and Dik Lun Lee and Ee-Peng Lim and Mukesh Kumar Mohania and Yoshifumi Masunaga}, month = {19-20 November 1998}, pages = {55--67}, publisher = {Springer-Verlag}, series = {LNCS}, volume = 1552, year = 1999, bibdate = {Tue Sep 14 06:09:05 MDT 1999}, issn = {0302-9743}, email = {choenni@nrl.nl}, acknowledgement = {}, isbn = {3-540-65690-1}, coden = {LNCSD9}, biburl = {http://www.bibsonomy.org/bibtex/2290d133bcf4dbcb793fb48aa97339765/brazovayeye}, keywords = {ADT, database conceptual management programming, modelling, data mobile access, genetic technologies, algorithms, spatio-temporal} } @incollection{ho:1994:gqo, title = {The Genetic Query Optimizer}, address = {Stanford, California, 94305-3079 USA}, author = {Alex Ho and George Lumpkin}, booktitle = {Genetic Algorithms at Stanford 1994}, editor = {John R. Koza}, month = {December}, pages = {67--76}, publisher = {Stanford Bookstore}, year = 1994, isbn = {0-18-187263-3}, organisation = {Stanford University}, 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{"}.}, biburl = {http://www.bibsonomy.org/bibtex/2d0e49a84bc4aa6ecf89c0febb250cdfd/brazovayeye}, keywords = {genetic Relational Oracle Query algorithms, Database Corporation,} } @techreport{langdon:1996:gpdb, title = {Genetic Programming and Databases}, address = {Gower Street, London WC1E 6BT, UK}, author = {W. B. Langdon}, institution = {University College London}, month = {11 February}, number = {IN/96/4}, type = {Internal Note}, year = 1996, url = {http://www.cs.ucl.ac.uk/staff/W.Langdon/gpdb.ps}, notes = {Short survey}, size = {3 pages}, biburl = {http://www.bibsonomy.org/bibtex/2f59d5789f681b3d3b8cff853a636af22/brazovayeye}, keywords = {programming, genetic algorithms, Database} } @article{wong:2000:dkm, title = {Discovering knowledge from medical databases using evolutionory algorithms}, author = {Man Leung Wong and Wai Lam and Kwong Sak Leung and Po Shun Ngan and Jack C. Y. Cheng}, journal = {IEEE Engineering in Medicine and Biology Magazine}, month = {July-August}, number = 4, pages = {45--55}, volume = 19, year = 2000, url = {http://ieeexplore.ieee.org/iel5/51/18543/00853481.pdf}, issn = {0739-5175}, size = {11 pages}, abstract = {Discusses learning roles and causal structures for capturing patterns and causality relationships. The authors present their approach for knowledge discovery from two specific medical databases. First, rules are learned to represent the interesting patterns of the data. Second, Bayesian networks are induced to act as causality relationship models among the attributes. The Bayesian network learning process is divided into two phases. In the first phase, a discretization policy is learned to discretize the continuous variables, and then Bayesian network structures are induced in the second phase. The authors employ advanced evolutionary algorithms such as generic genetic programming, evolutionary programming, and genetic algorithms to conduct the learning tasks. From the fracture database, they discovered knowledge about the patterns of child fractures. From the scoliosis database, they discovered knowledge about the classification of scoliosis. They also found unexpected rules that led to discovery of errors in the database. These results demonstrate that the knowledge discovery process can find interesting knowledge about the data, which can provide novel clinical knowledge as well as suggest refinements of the existing knowledge.}, biburl = {http://www.bibsonomy.org/bibtex/256a071c333eb10500364f3eb19a5451d/brazovayeye}, keywords = {discovery, networks, knowledge, models, programming, database, scoliosis errors management databases, database clinical relationship tasks, genetic knowledge network advanced variables, algorithms, fractures, process, classification, medical child learning novel systems, Bayesian fracture continuous causality evolutionary} } @book{datenbanksysteme, title = {Datenbanksysteme. Eine Einführung.}, author = {Alfons Kemper and Andre Eickler}, edition = 5, month = {February}, note = {ISBN-10: 3486273922ISBN-13: 978-3486273922}, publisher = {Oldenbourg}, year = 2004, description = {A compendium about DBMS - not for a specific database implementation, more about common concepts.}, biburl = {http://www.bibsonomy.org/bibtex/2ab7aa0449566e0460d530cb330f1e70f/michi}, keywords = {datenbank programming olap database sql datenbanksysteme} } @book{wordnet, title = {WordNet - An Electronic Lexical Database}, editor = {Christiane Fellbaum}, year = 1998, biburl = {http://www.bibsonomy.org/bibtex/2c1d1ce9bac3ba6b2e3ad6d00fc1a1838/awm08intentional}, keywords = {GoalIdentificationAWM08 WordNet awm2008 Database} } @inproceedings{KiJungLee:2007, title = {Semantic Mapping between RDBMS and Domain Ontology}, author = {Ki Jung Lee and Taeg Keun Whangbo}, booktitle = {Computers and Communications, 2007. ISCC 2007. 12th IEEE Symposium on}, pages = {1007-1012}, year = 2007, url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4381484}, issn = {1530-1346}, isbn = {978-1-4244-1521-2}, doi = {10.1109/ISCC.2007.4381484}, description = {IEEEXplore# Semantic Mapping between RDBMS and Domain Ontology}, abstract = {In general, although most data existing in the WWW are modeled as some type of relational database, characteristically even information in the same domain is often structured in different ways depending on the individual manager. In order to materialize a semantic Web, a method to efficiently map these different kinds of data is needed. This paper presents an algorithm for the matching between a relational database and domain ontology. Existing studies on the matching between a relational database and domain ontology were performed by extracting local ontology from a relational database. However the problem of losing domain information remains as a correlation with domain ontology is not used in the process of extracting local ontology. As a solution to this problem, we attempted to prevent the information loss through the measurement of similarity between the instances of the relational database and domain ontology, and increased the efficiency of the matching process by using information on the relation between tables in the relational database and also the relation between classes in ontology.}, biburl = {http://www.bibsonomy.org/bibtex/27d20d26c6e76b3ab90c400683179f43e/enterldestodes}, keywords = {database ontology} } @inproceedings{conf/vldb/BrunoC05, title = {Flexible Database Generators.}, author = {Nicolas Bruno and Surajit Chaudhuri}, booktitle = {VLDB}, crossref = {conf/vldb/2005}, editor = {Klemens Böhm and Christian S. Jensen and Laura M. Haas and Martin L. Kersten and Per-Åke Larson and Beng Chin Ooi}, pages = {1097-1107}, publisher = {ACM}, year = 2005, url = {http://dblp.uni-trier.de/db/conf/vldb/vldb2005.html#BrunoC05}, ee = {http://www.vldb2005.org/program/paper/wed/p1097-bruno.pdf}, isbn = {1-59593-177-5}, date = {2005-08-31}, description = {dblp}, biburl = {http://www.bibsonomy.org/bibtex/22ce6403b0d476ceb0a83b4cceb89cf16/devang83}, keywords = {database generation vldb microsoft} } @inproceedings{conf/compsac/ZhangXC01, title = {Automatic Generation of Database Instances for White-box Testing.}, author = {Jian Zhang and Chen Xu and S. C. Cheung}, booktitle = {COMPSAC}, crossref = {conf/compsac/2001}, pages = {161-165}, publisher = {IEEE Computer Society}, year = 2001, url = {http://dblp.uni-trier.de/db/conf/compsac/compsac2001.html#ZhangXC01}, ee = {http://doi.ieeecomputersociety.org/10.1109/CMPSAC.2001.960612}, isbn = {0-7695-1372-7}, date = {2007-07-25}, description = {dblp}, biburl = {http://www.bibsonomy.org/bibtex/20231ff00021975667b4b0ec87899967d/devang83}, keywords = {white-box database generation} } @inproceedings{conf/wosp/StephensP04, title = {MUDD: a multi-dimensional data generator.}, author = {John M. Stephens and Meikel Poess}, booktitle = {WOSP}, crossref = {conf/wosp/2004}, editor = {Jozo J. Dujmovic and Virgílio A. F. Almeida and Doug Lea}, pages = {104-109}, publisher = {ACM}, year = 2004, url = {http://dblp.uni-trier.de/db/conf/wosp/wosp2004.html#StephensP04}, ee = {http://doi.acm.org/10.1145/974044.974060}, date = {2006-02-15}, description = {dblp}, biburl = {http://www.bibsonomy.org/bibtex/210a5f77ab5ca6cb7d9679d5c16a168e1/devang83}, keywords = {database data-generation mudd} } @book{Dinter2008, title = {Integrierte Informationslogistik}, editor = {Barbara Dinter and Robert Winter}, publisher = {Springer}, year = 2008, biburl = {http://www.bibsonomy.org/bibtex/2491429d5f2a13331252259266a2c72bf/kochm}, keywords = {datawarehouse database} } @article{Zimmer1999, title = {On the Semantics of Complex Events in Active Database Management Systems}, address = {Los Alamitos, CA, USA}, author = {D. Zimmer and R. Unland}, journal = {icde}, pages = 392, publisher = {IEEE Computer Society}, volume = 00, year = 1999, biburl = {http://www.bibsonomy.org/bibtex/2a8f330e97a1893f1c795fbab411844fb/atrus}, keywords = {active CEP database event} } @inproceedings{Paton1995, title = {Formal Specification of Active Database Functionality: {A} Survey}, author = {N. W. Paton and J. Campin and A. A. A. Fernandes and M. H. Williams}, booktitle = {Proceedings of the 2nd International Workshop on Rules in Database Systems}, editor = {T. Sellis}, pages = {21--35}, publisher = {Springer}, volume = 985, year = 1995, url = {citeseer.ist.psu.edu/paton95formal.html}, biburl = {http://www.bibsonomy.org/bibtex/257f6a9fb9c0a2af412bad91a2313e23e/atrus}, keywords = {active database survey} } @inproceedings{McCarthy1989, title = {The architecture of an active database management system}, address = {New York, NY, USA}, author = {Dennis McCarthy and Umeshwar Dayal}, booktitle = {SIGMOD '89: Proceedings of the 1989 ACM SIGMOD international conference on Management of data}, pages = {215--224}, publisher = {ACM}, year = 1989, biburl = {http://www.bibsonomy.org/bibtex/2f12d53b8636dd63d2ebea3b908590249/atrus}, keywords = {HiPAC database active} } @article{Bassiliades1997, title = {DEVICE: Compiling production rules into event-driven rules using complex events}, author = {N. Bassiliades and I. Vlahavas}, journal = {{Information and Software Technology}}, number = 5, pages = {331--342}, volume = 39, year = 1997, url = {citeseer.ist.psu.edu/bassiliades97device.html}, biburl = {http://www.bibsonomy.org/bibtex/26a8183c983634ff1b358c3a5f470723b/atrus}, keywords = {Ariel DIPS active ADAM network rule discrimination database Rete EXACT} }