Browse Prior Art Database

Free Time Grid for a Calendar Display

IP.com Disclosure Number: IPCOM000039629D
Original Publication Date: 1987-Jul-01
Included in the Prior Art Database: 2005-Feb-01
Document File: 2 page(s) / 38K

Publishing Venue

IBM

Related People

Muller, BF: AUTHOR

Abstract

Currently, most free time search requests require that the programs analyze the appointment records of many calendar users; it then returns to the requester a list of dates and times when all the members of the group are available. The problem with this method is twofold: a) time delay due to analysis and I/O performed, especially for a large group of calendar users, and b) the probability is such that with a group of more than five to 10 members the results will return dates eight times many days in the future when the appointments have not yet been scheduled. In accordance with the invention, a grid record, one for each individual each day, is dynamically created when the first appointment for the day is scheduled and deleted dynamically when the last appointment for the day is removed.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 69% of the total text.

Page 1 of 2

Free Time Grid for a Calendar Display

Currently, most free time search requests require that the programs analyze the appointment records of many calendar users; it then returns to the requester a list of dates and times when all the members of the group are available. The problem with this method is twofold: a) time delay due to analysis and I/O performed, especially for a large group of calendar users, and b) the probability is such that with a group of more than five to 10 members the results will return dates eight times many days in the future when the appointments have not yet been scheduled. In accordance with the invention, a grid record, one for each individual each day, is dynamically created when the first appointment for the day is scheduled and deleted dynamically when the last appointment for the day is removed. The grid record contains three fields: user, date, and a 48-byte field, where each byte is a count of appointments occurring any time during that half- hour segment (appointment 9:00-10:30 would affect bytes 18, 19 and 20). A typical grid looks like this: USER 851231 00000000000000000011112221111000110000000000 A count is used instead of bit setting (ON/OFF) so that if there is a conflicting appointment followed by a deletion of one of those appointments (the count is decremented instead of set to OFF), the grid will be represented correctly. When all the counts are zero, the grid record is deleted. When searching for free time, the program...