Sunday 24 October 2004

Meta Meta Meta Data Draft 0.1b - in plain English

I was trying to use a bit of mathematical terms to express the "improvement" of the data model. It seemed it did not go through very well from the comments I have received so far. In this post, I try to rewrite the idea in plain English.

Say we have a set of data, let call it S1 with elements s11, s12, s13, ... s1n. These elements were referred to as type 1 data in the previous paper.

Let use start with a collection of documents. These documents were referred as type 1 data in the previous paper.
Now, apply a "meta" operation* on each of the element in S1 which will produce a set S2 with elements s21, s22, s23, ... s2n where s2i is the metadata of s1i. These elements ( s21, s22, ... s2n) was referred to as type 2 data in the previous paper.

"Meta-data" is data about data. Hence we can get the data about each of the documents in our collection. We have an collection of data which are data about the documents. The data in the second collection were called type 2 data in the previous paper.
Note that elements of S2 are data as well. These elements are themselves type 1 data and hence we can apply "meta" operation on these as well to produce another set of type 2 data. This is infinitely recursive.

We noted that the data in second collection are, themselves, documents. Hence, it is also possible for us to get data about these data. This data about data can reiterate as many times as you like.
What is interesting, and perhaps confusing, is that there exist more than one meta operation. In fact, there are infinite number of meta operations. Each meta operation will produce a set of Type 2 carrying the implicit characteristics of the meta operation. We further define a meta-meta operation as an operation on a set S which will extract the common characteristics all elements in the set S2 to produce M1. Since there are infinite number of possible meta operations, there exists infinite number of characteristic, M1, M2, M3,... Mn,... Each of these characteristics, when expressed in as data, is what we refer to as type 3 data in the previous paper.

[Note: this is the improvement to the model.]There is more than one type of data about data. The "normal" metadata is only one type of data about the document. Another type of data about the document may be the number of times a certain word has appeared in the document (frequency count). When we look at the data about the document (our second collection), these data carry some particular features due to the method we get these data about document. If we can express these characteristics in a data format, then we get what we refer to as type 3 data in the previous paper.
An example of Mi may be the Dublin Core specification, which defines a particular meta operation. The process of producing M1 is the meta-meta operation. Different community of practice will obviously have their own variations of meta operation (adoption and extension of DC) producing Mi.

This paragraph is self-explanatory.
Meta-meta operation applies on data elements. Since type 1 data is data, we can also meta-meta operation on type 1 data. One of the possible characteristics of type 1 data is the link information among the elements. This link information has been an important information to determine the "page-rank" in Google's search result. Again, there are other meta-meta operation which can be applied to type 1 as well as type 2 data.

We also note that the way of describe the "common" characteristics of data about document is the same as the "common" characteristics of data. We can, therefore, apply the same technique to the original type 1 data, i.e. the document to try to get some characteristics of the collection of document. One of the characteristics may be the linking relationship between these documents.

No comments: