Understanding what your database is doing and when is essential to runtime administration, maintenance, monitoring and reporting. Gaining insight into how your system responds to different workloads can also tell you how your current deployment is or isn’t serving your purpose.
There are manygreatarticles on this particular topic already. In today’s post, I’m going to walk through a couple of the simple things you can do to check your system’s runtime status.
Unix Tools
When your database is being hosted in a unix-like environment, you’re given the greatest tools at your disposal to understand what’s happening.
ps can show you running processes on your system. Paired with grep, you can focus ps to look at postgres processes only:
iostat and vmstat will also give you some operating system level insight to how your database application is performing.
Statistics Collector
An important, integrated piece of the Postgres architecture is the statistics collector. Using this, you can query to a very low level many pieces of information surrounding your system’s performance.
The following except is just a small sample of all of the views offered by the statistics collector; which are made available to the developer.
View Name
Description
pg_stat_activity
One row per server process, showing information related to the current activity of that process, such as state and current query. See pg_stat_activity for details.
pg_stat_bgwriter
One row only, showing statistics about the background writer process’s activity. See pg_stat_bgwriter for details.
pg_stat_database
One row per database, showing database-wide statistics. See pg_stat_database for details.
pg_stat_all_tables
One row for each table in the current database, showing statistics about accesses to that specific table. See pg_stat_all_tables for details.
pg_stat_sys_tables
Same as pg_stat_all_tables, except that only system tables are shown.
pg_stat_user_tables
Same as pg_stat_all_tables, except that only user tables are shown.
Scala gives the developer flexibility when reasoning about and designing type systems for applications. By using classes and traits, a developer can quickly build a complex hierarchy that can assist in describing constraint and relationship information.
In today’s post, I’m going to walk through a useless but demonstrative example of a type hierarchy and some of the constraint features available to the developer.
Vehicles
We’re going to model some different vehicles. Cars, planes, trucks, skateboards, whatever.
abstractclassVehicle
We could start case-classing this base out or directly adding derivatives that specialise down to the exact vehicle types that we want, but we’re going to reason about some attributes that these vehicles might have. Wheels and Jets.
When a vehicle HasWheels, the type is going to require us to specify numberOfWheels. Likewise numberOfJets for HasJets. These traits are extending our abstract Vehicle class.
When we have wheels, we should be able to set how fast they’re spinning.
Of course, we could have just constructed toyota as a MotorVehicle for the same effect. This just demonstrates the instance construction flexibility.
Constraints
Finally, when you’re writing functions that work with your types you can specify rich constraint rules so that you can target functionality with as much precision as you require:
// everything can be painteddefpaint(v:Vehicle)={}// only a vehicle with wheels can burnoutdefdoBurnout(v:VehiclewithHasWheels)={}
As you can see, you not only use the with keyword to define your types; this keyword is also used for variable construction and function signature definition.
When creating parameterised types, you have control on how those types can be passed. These nuances are referred to as variance and scala allows you to explicitly nominate how this works in your own classes.
An excellent explanation on these terms can be found here. I’ve reproduced the three main points for this article though:
That is, if A and B are types, f is a type transformation, and ≤ the subtype relation (i.e. A ≤ B means that A is a subtype of B), we have:
f is covariant if A ≤ B implies that f(A) ≤ f(B)
f is contravariant if A ≤ B implies that f(B) ≤ f(A)
f is invariant if neither of the above holds
Invariant
Invariant parameter types are what ensures that you can only pass MyContainer[Int] to def fn(x: MyContainer[Int]). The guarantee is that the type that you’re containing (when it’s being accessed) is done so as the correct type.
classMyInvariant[T](varvalue:T)
This guarantees the type of T when we go to work on it.
defdouble(a:MyInvariant[Int])={a.value*=2}
You can see here that a good case for invariant is for mutable data.
To show the error case here, we define a show function specialising to MyInvariant[Any]
defshow(a:MyInvariant[Any])={println("Here is: "+a.value)}
Trying to use this function:
scala> show(new MyInvariant[Int](5))
<console>:13: error: type mismatch;
found : MyInvariant[Int]
required: MyInvariant[Any]
Note: Int <: Any, but class MyInvariant is invariant in type T.
You may wish to define T as +T instead. (SLS 4.5)
show(new MyInvariant[Int](5))
^
Covariant
Covariant parameter type is specific. You pass these sorts of types to functions that generalise their inner type access. You need to decorate the type parameter with a +.
classCovariantContainer[+T](varvalue:T)
Then your function to generalise over this type:
defshow(a:CovariantContainer[Any])={println("The value is "+a.value)}
Covariance is a good case for read-only scenarios.
Contravariant
Contravariance is defined by decorating the type parameter with a -. It’s useful in write-only situations.
classContravariantContainer[-T](varvalue:T)
We write specialised functions for the type, but that are write-only cases:
From time to time, it makes sense to perform some GC tuning on your Java Virtual Machines. Whilst there are a lot of tools that can visually help your debugging process, in today’s post I’ll talk you through the GC log that you can optionally turn on in your virtual machine arguments.
Enabling the log
To boost up the logging of your application, you’ll need to tune the execution runtime using command line parameters. The following parameters will get the JVM to log out information that it’s holding on garbage collection events.
-verbose:gc will ramp the logging level of GC events up to a verbose level, -XX:+PrintGCDetails and -XX:+PrintGCTimeStamps define some features of the log that’s written. Finally -Xloggc:/tmp/gc.log defines the file endpoint on disk that the GC log will be written to.
Reading the log
After you’ve run your program with these parameters engaged, you should find the /tmp/gc.log file sitting on your hard drive waiting to be read. I won’t dump the full log for the test program that I’ve run here; rather I’ll go through it piece by piece.
The header of the file defines what your software versions, memory statistics and virtual machine arguments are.
OpenJDK 64-Bit Server VM (25.66-b01) for linux-amd64 JRE (1.8.0_66-internal-b01), built on Aug 5 2015 09:09:16 by "pbuilder" with gcc 4.9.2
Memory: 4k page, physical 8055396k(6008468k free), swap 8267772k(8267772k free)
CommandLine flags: -XX:InitialHeapSize=1073741824 -XX:MaxHeapSize=1073741824 -XX:+PrintGC -XX:+PrintGCDetails -XX:+PrintGCTimeStamps -XX:+UseCompressedClassPointers -XX:+UseCompressedOops -XX:+UseParallelGC
After these initial lines, you’ll start to see some of the memory allocation events appear along with the timestamps (remember, we asked for timestamps above).
This event was generated 0.320 seconds into the program. This item is a GC (Allocation Failure) event and it’s being reported on the PSYoungGen collection. Prior to the event, the space allocated before was 262144K and after was 43488K. The capacity value is in braces 305664K.
The Full GC events will give you statistics for all of the memory collections:
Each of the collections is displayed as [CollectionName: SpaceBefore->SpaceAfter(Capacity)].
Finally, we have a heap analysis of the program as it breaks down amongst the different memory classes: Young Gen, Old Gen and (new for 1.8) Metaspace. Metaspace would have previously been Perm Gen.
Heap
PSYoungGen total 305664K, used 5243K [0x00000000eab00000, 0x0000000100000000, 0x0000000100000000)
eden space 262144K, 2% used [0x00000000eab00000,0x00000000eb01ecf8,0x00000000fab00000)
from space 43520K, 0% used [0x00000000fab00000,0x00000000fab00000,0x00000000fd580000)
to space 43520K, 0% used [0x00000000fd580000,0x00000000fd580000,0x0000000100000000)
ParOldGen total 699392K, used 133835K [0x00000000c0000000, 0x00000000eab00000, 0x00000000eab00000)
object space 699392K, 19% used [0x00000000c0000000,0x00000000c82b2c88,0x00000000eab00000)
Metaspace used 2546K, capacity 4486K, committed 4864K, reserved 1056768K
class space used 268K, capacity 386K, committed 512K, reserved 1048576K