• Part of
    Ubiquity Network logo
    Join Mailing List Publish with us

    Read Chapter
  • No readable formats available
  • Knossos: un database di scavo open source per l'archeologia

    Damiano Lotto, Francesco Biscani, Sebastiano Tibolla

    Chapter from the book: Costa S. & Pesce G. 2013. Open Source Free Software e Open Format nei processi di ricerca archeologica: Atti del II Workshop Genova 11 maggio 2007.

    Buy Paperback

    Il contributo ha lo scopo di presentare dal punto di vista sia metodologico che funzionale il processo di creazione di un ideale database open source indirizzato specfiicatamente all’impiego archeologico.Il programma presentato è basato su formati e standard open source:si tratta di un’applicazione programmata in C++ utilizzando le librerieQt (versione 4), multipiattaforma, con capacità di gestione e connessione ai più diusi database open source (tra i quali MySQL, Postgre-SQL, SQLite).

    This paper shows the development process of a ideal opensource database specially oriented to archaeological work, with the focus centered on the methodological approach and on the soware functionality. Knossos is based on open source formats; it’s developed in C++ with Qt libs (version 4) and is studied to be multiplatform, with the feature to connect to the most used open source databases, like MySQL,PostgreSQL, SQLite.

    Chapter Metrics:

    How to cite this chapter
    Lotto, D et al. 2013. Knossos: un database di scavo open source per l'archeologia. In: Costa S. & Pesce G (eds.), Open Source Free Software e Open Format nei processi di ricerca archeologica. London: Ubiquity Press. DOI: https://doi.org/10.5334/bae.c

    This is an Open Access chapter distributed under the terms of the Creative Commons Attribution 4.0 license (unless stated otherwise), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited. Copyright is retained by the author(s).

    Peer Review Information

    This book has been peer reviewed. See our Peer Review Policies for more information.

    Additional Information

    Published on July 31, 2013


    comments powered by Disqus