Skip to main content

New answers tagged

-1 votes

Recommended data structures/algorithms for checking peoples' availability schedules

A sparse matrix can model this kind of data, but it is usually not practical in a database environment and not ideal when the number of users or events is dynamic. Sparse matrices work best when: the ...
Rohan Khan's user avatar
-1 votes

Recommended data structures/algorithms for checking peoples' availability schedules

I am not completely sure if this is applicable to your scenario a Sparse Matrix is what comes to my mind for a data structure. I am not sure if this is usable in your scenario as your data is stored ...
Thibe's user avatar
  • 183
4 votes

Recommended data structures/algorithms for checking peoples' availability schedules

I've been overthinking this problem. I think there's a simple answer that is easy to implement and should perform more than adequately for your needs. This is easily solved using Postgres. The high-...
JimmyJames's user avatar
  • 31.1k
2 votes

Recommended data structures/algorithms for checking peoples' availability schedules

Doing search service side is a very bad idea. You would have to keep assignments synchronized with DB doing error-prone cache invalidation and potentially moving significant volumes of data around. Do ...
Basilevs's user avatar
  • 4,504
0 votes

Recommended data structures/algorithms for checking peoples' availability schedules

Interesting problem. My university used simulated annealing to shift lectures, rooms, times, and students around to form a schedule which they manually tweaked before publishing for the semester. ...
Kain0_0's user avatar
  • 16.6k
3 votes

Recommended data structures/algorithms for checking peoples' availability schedules

At the moment, we run through all the users, their availability slots, and their assigned events in order to determine whether they're available for a specific event. The first thing you want to get ...
Doc Brown's user avatar
  • 221k
4 votes

Recommended data structures/algorithms for checking peoples' availability schedules

One way to do it is to represent each user and each event as a bit map. Essentially, each half hour corresponds to a bit, the entire day corresponding to 6 bytes, one week being 42 bytes. Regarding ...
Arseni Mourzenko's user avatar

Top 50 recent answers are included