Abstract: A schema-based contacts service for Internet access to per-user contact data, wherein access to data is based on each user's identity. The contacts service includes a schema that defines rules and a structure for each user's data, and also includes methods that provide access to the data in a defined way. The contacts schema thus corresponds to a logical document containing the data for each user. The user manipulates (e.g., reads or writes) data in the logical document by data access requests through defined methods. In one implementation, the contacts schemas are arranged as XML documents, and the services provide methods that control access to the data based on the requesting user's identification, defined role and scope for that role. In this way, data can be accessed by its owner, and shared to an extent determined by the owner.

Abstract: A schema-based calendar service for Internet access to per-user contact data, wherein access to data is based on each user's identity. The calendar service includes a schema that defines rules and a structure for each user's data, and also includes methods that provide access to the data in a defined way. The calendar schema thus corresponds to a logical document containing the data for each user. The user manipulates (e.g., reads or writes) data in the logical document by data access requests through defined methods. In one implementation, the calendar schemas are arranged as XML documents, and the services provide methods that control access to the data based on the requesting user's identification, defined role and scope for that role. In this way, data can be accessed by its owner, and shared to an extent determined by the owner.

Abstract: A method for calculating all event occurrences defined by an event expression in a specified time window. An event expression comprises add rules, delete rules and modify rules, each of which define a set of rule occurrences. The rules are separated into three groups and the occurrences generated by the grouped rules are sorted in any desired manner such that the earliest occurrence of each group is available for processing. A heap sort algorithm represents one suitable sorting technique. The earliest add rule occurrence is retrieved from the sorted add group occurrences and is compared with the earliest modify and delete rule occurrences taken from the sorted modify and delete group occurrences, respectively. Based on priority rules applied to the add, modify, and delete rule occurrences during the comparison process, it may be determined that the add rule occurrence represents a valid event occurrence that satisfies the event expression.