KDE PIM/Akonadi Next/Client API: Difference between revisions

From KDE Community Wiki
Line 24: Line 24:


This abstraction layer allows each resource to separately define how data is stored and retrieved. Therefore tradeoffs can be defined to suit the expected access patters or structure of source data. Further it allows individual resources to choose different technologies as suitable. Logic can still be shared among resources, while keeping the maintenance effort reasonable, by providing default implementations that are suitable for most workloads.
This abstraction layer allows each resource to separately define how data is stored and retrieved. Therefore tradeoffs can be defined to suit the expected access patters or structure of source data. Further it allows individual resources to choose different technologies as suitable. Logic can still be shared among resources, while keeping the maintenance effort reasonable, by providing default implementations that are suitable for most workloads.
Because the facade also implements querying of indexes, a resource my use server-side searching to fullfill the query, and fallback to local searches when the server is not available.


=== Query System ===
=== Query System ===

Revision as of 23:19, 8 December 2014

The client API consists of:

  • a modification API for messages (Create/Modify/Delete)
  • a query API to retrieve messages
  • a resource facade to abstract the resource implementation details
  • a set of standardized domain types
  • a notification mechanism to be notified about changes from individual stores

Requirements/Design goals

  • zero-copy should be possible (mmap support)
    • Likely only possible until application domain until we rewrite portions of the applications
    • Most importantly we should hide how the data is stored (in parts, or one mmapped buffer)
    • Support for mmapped buffers implies that we keep track of the lifetime of the loaded values.
  • property-level on-demand loading
  • streaming support for certain properties (attachments)

Domain Types

A set of standardized domain types is defined. This is necessary to decouple applications from resources (so a calendar can access events from all resources). The purpose of these domain types are strictly the interface and they are not supposed to be used by applications directly, or to be restricted by any other specifications (such as ical). By nature these types will be part of the evolving interface, and will need to be adjusted for every new property that an application must understand.

Store Facade

The store is always accessed through a store specific facade, which hides:

  • store access (one store could use a database, and another one plain files)
  • message type (flatbuffers, ...)
  • indexes

This abstraction layer allows each resource to separately define how data is stored and retrieved. Therefore tradeoffs can be defined to suit the expected access patters or structure of source data. Further it allows individual resources to choose different technologies as suitable. Logic can still be shared among resources, while keeping the maintenance effort reasonable, by providing default implementations that are suitable for most workloads.

Because the facade also implements querying of indexes, a resource my use server-side searching to fullfill the query, and fallback to local searches when the server is not available.

Query System

The query system should allow for efficient retrieval for just the amount of data required by the client. Efficient querying will be supported by the indexes povided by the resources.

The query always retrieves a set of messages matching the query, while not necessarily all properties of the message need to be populated.

Query

The query consists of:

  • a set of filters to apply
  • the set of properties to retrieve for each entity

Queryable properties are defined by the [Domain Types] above.

Filters:

  • "resources": QStringList of resource identifiers of resources to search. (this could also be a property-equality match)
  • "property-equal": QPair<QString, QVariant> property equality match
  • "property-lt": QPair<QString, QVariant> property less-than match
  • "property-gt": QPair<QString, QVariant> property greater-than match

Usecases

Mail:

  • All mails in folder X within date-range Y that are unread.
  • All mails (in all folders) that contain the string X in property Y.

Todos:

  • Give me all the todos in that collection where their RELATED-TO field maps to no other todo UID field in the collection
  • Give me all the todos in that collection where their RELATED-TO field has a given value
  • Give me all the collections which have a given collection as parent and which have a descendant matching a criteria on its attributes;

Events:

  • All events of calendar X within date-range Y.

Generic:

  • entity with identifier X
  • all entities of resource X

Lazy Loading

The system provides property-level lazy loading. This allows i.e. to defer downloading of attachments until the attachments is accessed, at the expense of having to have access to the source (which could be connected via internet).

To achieve this, the query system must check for the availability of all requested properties on all matched entities. If a property is not available the a command should be sent to the synchronizer to retrieve said properties. Once all properties are available the query can complete.

Note: We should perhaps define a minimum set of properties that *must* be available. Otherwise local search will not work. On the other hand, if a resource implements server-side search, it may not care if local search doesn't work.