Need an algorithm to search a table of mutli-day calendar events to identify available timespans for x number of items. The logic of the algorithm would be: and being the dates searched and being the most current booking for an item, defined as being the future date nearest to the system date, and , being the nearest future booking, defined as being the nearest future date. The algorithm should search for each record in ITEMS form and return the records in the Events table that pass the filter: For each record in ITEMS: {( later than AND sooner than ) AND ( sooner than )} It's a simple enough requirement, embarrassing that I can't come up with it on my own.