<p>För databasutveckling finns en mängd regler och standarder framtagna för att databasen ska bli så effektiv och felfri som möjligt. Ibland följs inte dessa fullt ut av olika anledningar. Detta kan leda till problem som i värsta fall kan få konsekvenser för verksamheten som använder sig av den. Ett exempel på en databas där man avvikit från gällande designregler är den som var tänkt att införas för kalkningsverksamheten för Länsstyrelsen i Gävleborg. I det här arbetet har jag gjort en utredning kring denna databas, identifierat dessa avvikelser, utrett varför dessa uppstått och vad dessa har lett till eller eventuellt kan leda till i det här sammanhanget. Jag har också byggt en ny databas enligt gällande regler anpassad för Gävleborgs kalkningsverksamhet. Resultaten jag kommit fram till är att dessa standardavvikelser och felaktigheter troligen beror på en kombination av bristande gränssnitt i form av formulär samt okunskap om databasdesign och administration hos personalen.</p>

<p>Many of the network applications today are demanding QoS guaranteed paths which the best effort routing protocols e.g. OSPF cannot calculate, because these protocols are topology driven, do not address many of the constraints by these applications and only calculate shortest paths. In this thesis offline constraint based routing is studied for Open Shortest Path First (OSPFv2) protocol single area network and an offline server is proposed for QoS guaranteed routing. The server builds traffic engineering (TE) database and calculates QoS guaranteed paths on behalf of all the routers in that area. The client routers only do best effort routing for normal data flows with no requirement for QoS guaranteed paths. The client routers use NETCONF protocol to download QoS routes from the offline server (OS). The offline server besides calculating QoS paths also reduces congestion and helps in efficiently utilizing the network resources, for example bandwidth.</p>

No description available.

<p>Object oriented software development is the main choice when developing business software today. For distributed storage of data they mostly use relational databases. The relational model however is not fully natural from an object oriented development perspective. The natural selection would be to use object oriented databases, however their development has not been as fast as their relational predecessors. The rise in popularity of smaller, fully object oriented languages such as Ruby and Python and open source projects developed with them are adding to the awareness of persistent object storage. This paper describes the current and future solutions for data storage in applications, their pros and cons and additionally shows an implementation of a native object persistence framework written in Ruby that supports indexing for self-optimizing.</p>

No description available.

Object oriented software development is the main choice when developing business software today. For distributed storage of data they mostly use relational databases. The relational model however is not fully natural from an object oriented development perspective. The natural selection would be to use object oriented databases, however their development has not been as fast as their relational predecessors. The rise in popularity of smaller, fully object oriented languages such as Ruby and Python and open source projects developed with them are adding to the awareness of persistent object storage. This paper describes the current and future solutions for data storage in applications, their pros and cons and additionally shows an implementation of a native object persistence framework written in Ruby that supports indexing for self-optimizing.

Many of the network applications today are demanding QoS guaranteed paths which the best effort routing protocols e.g. OSPF cannot calculate, because these protocols are topology driven, do not address many of the constraints by these applications and only calculate shortest paths. In this thesis offline constraint based routing is studied for Open Shortest Path First (OSPFv2) protocol single area network and an offline server is proposed for QoS guaranteed routing. The server builds traffic engineering (TE) database and calculates QoS guaranteed paths on behalf of all the routers in that area. The client routers only do best effort routing for normal data flows with no requirement for QoS guaranteed paths. The client routers use NETCONF protocol to download QoS routes from the offline server (OS). The offline server besides calculating QoS paths also reduces congestion and helps in efficiently utilizing the network resources, for example bandwidth.

Dennauppsatsundersökerhursynkroniseringmellantrevaldaplattformarsdatabaser(iOS,Android,MySQL)kanutföraspåbästasätt.Utifrånvårprimärdatasomärvetenskapligaartiklarskrivnaiämnet,samttidigareforskningochvårsekundärdatasomärvårtexperimentCrossSync,samtenintervjumedFredrikÅlundpåMimer,harvimedettkvalitativtsynsättsettpådeolikabeståndsdelarnasomkrävsförattkunnautförasynkroniseringmellandessaplattformar.Vårtresultatvisarpåattenlångsamsynkroniseringsmodellmåsteanvändas,därheladatabasenidenenaenhetenjämförsmedheladatabasenpåservernvidvarjesynkronisering.Detvisarocksåpåattsynkroniseringenmåsteanpassaseftermobilernasbegränsaderesurser.

No description available.

No description available.