EXHIBIT 1006
`
`EXHIBIT 1006
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`
`Europaisches Patentamt
`
`European Patent Office
`
`Office europeen des brevets
`
`111111111111111111111111111111111111111111111111111111111111111111111111111
`
`(11)
`
`EP 1 091 308 A2
`
`EUROPEAN PATENT APPLICATION
`
`(19)
`
`'
`
`(12)
`
`(43) Date of publication:
`11.04.2001 Bulletin 2001/15
`
`(21) Application number: 00308379.7
`
`(22) Date of filing: 25.09.2000
`
`(84) Designated Contracting States:
`AT BE CH CY DE DK ES Fl FR GB GR IE IT LI LU
`MC NL PT SE
`Designated Extension States:
`AL LT LV MK RO SI
`
`(30) Priority: 05.10.1999 GB 4102352
`
`(71) Applicant:
`LUCENT TECHNOLOGIES INC.
`Murray Hill, New Jersey 07974-0636 (US)
`
`(54)
`
`Ticket processing system
`
`(57)
`A ticket processing system in which a user indi-
`cates desired seats by entering seat constraints and the
`system searches a database of event matrices to deter(cid:173)
`mine the next available date on which the desired seats
`are available. The user may also enter date constraints
`such that the system will search for a next available date
`which also satisfies the date constraints. When seats
`are found, the system offers the seats to the user. If the
`user declines the seats, the system continues searching
`the database for the next available date, subsequent to
`the date of the offered seats, which satisfies the seat
`constraints, and date constraints if any.
`
`(51) Int. Cl.7: G06F 17/60
`
`(72) Inventor: Silberschatz, Abraham
`Warren, New Jersey 07059 (US)
`
`(7 4) Representative:
`Watts, Christopher Malcolm Kelway, Dr. et al
`Lucent Technologies (UK) Ltd,
`5 Mornington Road
`Woodford Green Essex, IG8 OTU (GB)
`
`FIG. 5
`
`502
`
`504
`
`506
`
`508
`
`USl:R ENTERS EVENT
`
`DISPLAY SEATING CHART
`
`USER ENTERS SEAT
`CONSTRAINTS
`
`INITIALIZE SEARCH-DATE
`TO EARLIEST DATE
`
`DISPLAY AYAll.ABlE
`SEATS TO USER
`
`NO
`
`ACCEPT?
`YES
`MARK SEATS IN SEARCH-DATE
`MATRIX AS UNAVAILABLE
`
`522
`
`526
`
`NOTIFY USER-rw:o TO
`FIND ACCEPTABLE SEATS
`
`518
`
`INCREMENT Sl:ARCH·DATE
`
`516
`
`520
`
`ENO
`
`N
`<(
`co
`0
`('I)
`,...
`en
`0 ,...
`c.
`w
`
`Printed by Xerox (UK) Business Services
`2. 16.7 (HRS)/3.6
`
`

`
`EP 1 091 308 A2
`
`2
`
`Description
`
`Field of the Invention
`
`The present invention relates generally to
`[0001]
`automated ticket processing systems.
`
`5
`
`the seat selection constraints, and date constrains if
`any, are available.
`These and other advantages of the invention
`[0007]
`will be apparent to those of ordinary skill in the art by
`reference to the following detailed description and the
`accompanying drawings.
`
`10
`
`[0008]
`
`Fig. 1 shows a functional block diagram of a pro(cid:173)
`grammable computer in which the present invention
`may be implemented;
`Fig. 2 shows an exemplary event matrix;
`Fig. 3 shows an event matrix with a theater configu(cid:173)
`ration overlay;
`Fig. 4 shows a plurality of event matrices repre(cid:173)
`sented as a three dimensional array;
`Fig. 5 is a flowchart showing the steps performed
`by a programmed computer in order to implement a
`ticket processing system in accordance with one
`embodiment of the invention; and
`Fig. 6 shows exemplary event matrices.
`
`15
`
`20
`
`25
`
`Detailed Description
`
`Automated ticket processing systems pro(cid:173)
`[0002]
`vide for the automated selection, distribution, and/or
`payment of tickets for particular events (e.g., sporting or
`theatrical events). Such an automated ticket processing
`system may be a stand-alone system used by a ticket
`agent or, more likely, would be implemented as part of a
`communication network, for example a web based Inter(cid:173)
`net service for processing tickets. One example of a cur-
`rent web based Internet ticket processing system is
`Ticketmaster Online, which currently may be accessed
`via the Internet at www.ticketmaster.com.
`Ticketmaster Online allows a user to select
`[0003]
`an event, date, and desired seats, and the system will
`determine whether the desired seats are available for
`the chosen event and date. One problem with this sys-
`tem is that if the desired seats are not available for the
`chosen event on the chosen date, the customer must
`initiate another search for the desired seats for another
`date of the particular event. This system can be incon(cid:173)
`venient to a customer looking for particular seats for a
`popular event.
`
`Summary of the Invention
`
`The present invention solves the above iden(cid:173)
`[0004]
`tified problem by allowing a user to indicate desired
`seats and the ticket processing system will determine
`the next date on which the desired seats are available.
`Thus, a user who desires specific seats, but who is flex(cid:173)
`ible with respect to dates, can easily obtain tickets to an
`event.
`In accordance with an embodiment of the
`[0005]
`invention, the ticket processing system receives seat
`selection constraints which indicate the seats desired
`by a user. The system then searches a database con(cid:173)
`taining seat availability information for a plurality of
`dates in order to determine the next available date on
`which seats satisfying the seat selection constraints are
`available. The user may optionally enter date con(cid:173)
`straints which indicate acceptable dates, and the sys(cid:173)
`tem will search the database for the next available date
`which satisfies the date constraints and on which seats
`satisfying the seat selection constraints are available.
`Once the system finds seats which satisfy
`[0006]
`the seat constraints, and date constrains if any, the tick(cid:173)
`ets will be offered to the user. If the user does not accept
`the seats, the system will continue to search the data(cid:173)
`base to determine a next available date subsequent to
`the date of the offered seats on which seats satisfying
`
`35
`
`45
`
`Fig. 1 shows a functional block diagram of a
`[0009]
`programmable computer in which the present invention
`30 may be implemented. The computer 100 contains a
`processor 102 which controls the overall operation of
`the computer 100 by executing computer program
`instructions which are stored in a memory 104 con(cid:173)
`nected to processor 102. Memory 104 represents any
`type of computer readable medium, including without
`limitation, random access memory (RAM), read only
`memory (ROM), magnetic disk or tape, optical disk, or
`holographic memory. Memory 104 may be implemented
`using any computer readable medium technology, or a
`40 combination of such technologies. Processor 102 is
`also connected to user 1/0 106 and a network interface
`108. The user 1/0 106 represents the elements which
`are used to interact with a user and may include, without
`limitation, a display screen, keyboard, pointing device
`(e.g. mouse), microphone, and speakers. The network
`interface 108 allows the computer 100 to communicate
`with other devices via a computer network, such as a
`local area network (LAN) or wide area network (WAN).
`Of course, Fig. 1 is a high level functional block diagram
`50 of only a portion of the components which are neces(cid:173)
`sary for operation of a computer. Since the configuration
`and operation of programmable computers are well
`known in the art, for clarity, the details of computer 100
`are not shown.
`The computer 100 contains ticket process-
`[001 O]
`ing program code 110 in memory 104 which contains
`computer program instructions to implement a ticket
`processing system.
`In
`the particular embodiment
`
`55
`
`2
`
`

`
`3
`
`EP 1 091 308 A2
`
`4
`
`described herein, memory 104 also contains event
`matrices 112. An event matrix represents the seating
`chart for a particular event, at a particular venue, and for
`a particular date. An exemplary event matrix is shown in
`Fig. 2 as an NxN matrix where the seats at a particular
`venue are represented by entries in the matrix. Each
`entry in the matrix may be uniquely identified by
`(row, column). Thus, for example, entry (2,3) is the entry
`at the intersection of the second row and third column,
`and is identified in Fig. 2 by the callout number 202. In
`accordance with one embodiment of the invention, each
`entry in the matrix may contain one of three values
`{O, 1,2}. A O value indicates that the seat does not exist
`in the particular venue. For example, certain venues
`may not have a seating arrangement which is easily
`defined as an NxN matrix. For example, consider Fig. 3,
`which shows an event matrix with a particular theater
`configuration overlay. As can be seen in Fig. 3, in the
`particular seating configuration for this particular venue,
`seats at matrix entries (1, 1 ), (1,2), (1,4), (1,5), (2, 1 ),
`(2,2), (2,4), (2,5), (3, 1 ), and (3,5) do not exist, and as a
`result, the corresponding matrix entries will contain the
`value 0. A matrix entry value of 1 indicates that the seat
`is available for a particular event on a particular date. A
`matrix entry value of 2 indicates that the seat is unavail(cid:173)
`able for a particular event on a particular date.
`[0011]
`Consider now an event which has scheduled
`performances over a series of dates, for example a the(cid:173)
`atrical performance which is scheduled to run for 3
`months at a particular venue. The seating availability for
`these performances may be represented as a plurality
`of event matrices, with one event matrix for each per(cid:173)
`formance date. Such matrices could be represented in
`memory 104 as a three dimensional array as shown in
`Fig. 4. A three dimensional array is a data structure
`which is well known to those skilled in the art of compu-
`ter science. Any particular entry in a particular event
`matrix may be uniquely identified by (date,row,column),
`where date uniquely identifies one of the event matri-
`ces, and row, column identifies an entry in that matrix,
`as described above in conjunction with Fig. 2. One
`skilled in the art would recognize that the event matrices
`shown in Fig. 4 are for use when it is assumed that there
`is one event, or performance, per date. If there were
`multiple performances on a single date, then the date
`parameter would have to encode not only a particular
`date, but the particular performance (e.g., performance
`time) for the particular date.
`[0012]
`Fig. 5 shows the steps performed by the
`computer 100 in order to implement a ticket processing
`system in accordance with one embodiment of the
`invention. As described above, these steps are per(cid:173)
`formed under control of the processor 102 executing the
`ticket processing program code 11 O stored in memory
`104. Upon entry into the system, at step 502 the user
`will enter an event for which the user wishes to pur(cid:173)
`chase tickets. The entry of the event will be through the
`user 1/0 106. In step 504 a seating chart for the particu-
`
`5
`
`10
`
`lar venue at which the event is being held will be dis(cid:173)
`played to the user via the user 1/0 106. For example, the
`seating chart may be displayed graphically on a compu-
`ter display screen. It is noted that at this point, no indica(cid:173)
`tion of available seating is given to the user. In step 506
`the user enter seat constraints. These constraints indi-
`cate the type of seats that the user wishes to purchase.
`For example, by using a graphical pointing device, the
`user may identify particular seats, a seating section, or
`multiple seating sections. The seat constraints will also
`indicate the number of seats required, and whether the
`seats need to be consecutive or not. Since ticket pur(cid:173)
`chasers generally request consecutive seats, if the user
`does not specify, consecutive seating would be a
`15 default. The graphical specification or seating con(cid:173)
`straints by a user may be accomplished using well
`known graphical user interface techniques.
`[0013]
`In step 508 the system initializes a variable,
`search-date, to the earliest date of the event. For exam-
`20 pie, the earliest date may be the start date of the event,
`or may be the current day, or the day after the current
`day. Next, in step 510, the event matrix representing the
`seating availability for the search-date will be searched
`for seats which satisfy the user seat constraints. Thus,
`25 as described above, the event matrix identified by
`(search-date,
`row, column) will be accessed and
`searched for available seats. As described above, avail(cid:173)
`able seats are represented in the event matrix with a 1,
`so the event matrix will be searched for entries contain-
`ing a 1 in seats which satisfy the seat constraints
`entered by the user. For example, suppose the user
`requested two consecutive seats in the first three rows
`of the venue. The search of step 510 would search rows
`1 -3 of the event matrix for two consecutive entries con-
`taining the value 1. A matrix search as described above
`could be readily implemented by one of ordinary skill in
`the art of computer programming and the details of such
`a search algorithm will not be included herein.
`[0014]
`Step 512 determines whether seats which
`satisfy the seat constraints were found in the event
`matrix for the particular search-date. If seats were not
`found, then in step 514 it is determined whether more
`dates are available for the particular event. If more dates
`are available, then the search-date is incremented to
`the next date of the event and control returns to step
`51 O to search the new event matrix representing the
`seating availability for the incremented search-date.
`These steps 510-516 are repeated until either seats sat(cid:173)
`isfying the seat constraints are found (step 512) or until
`there are no more dates for the event (step 514). If no
`more dates are available, then in step 518 the user is
`notified that the search for seats satisfying the entered
`search constraints failed and the method ends in step
`520. At this point, the user may be given the option of
`entering new seat constraints and repeating the search
`steps.
`[0015]
`If seats satisfying the search constraints
`were found, then in step 522 the available seats are dis-
`
`30
`
`35
`
`40
`
`45
`
`50
`
`55
`
`3
`
`

`
`5
`
`EP 1 091 308 A2
`
`6
`
`utive seats available within rows 1 through 3. As can be
`seen by event matrix 604, there are not three consecu(cid:173)
`tive entries within rows 1-3 which contain a 1 and the
`seat constraints cannot be satisfied for the event on
`January 2, 1999. Thus, the test of step 512 is no and in
`step 514 it is determined that there are additional dates
`available. In step 516 search-date is incremented and
`set to 19990103. Control again returns to step 510. At
`this point, the search of step 51 O finds that there are 3
`consecutive seats available within rows 1 through 3.
`Thus, the test of step 512 is yes and in step 522 the
`available seats are displayed to the user.
`[0018]
`As seen from event matrix 606, there are
`four sets of seats which satisfy the seat constraints. The
`four sets of seats satisfying the seat constraints are as
`follows:
`
`set 1: (2,1), (2,2), (2,3)
`set 2: (2,2), (2,3), (2,4)
`set 3: (2,3), (2,4), (2,5)
`set 4: (3,3), (3,4), (3,5)
`
`5
`
`10
`
`15
`
`20
`
`played to the user. This may be accomplished, for
`example, by highlighting the available seats on the seat-
`ing chart which was displayed in step 504. In step 524
`the user is given the option of accepting or rejecting the
`seats. If the seats are rejected, then control returns to
`step 514 and processing continues as described above
`in order to attempt to find acceptable seats for another
`date. If the seats are accepted, then in step 526 the cor(cid:173)
`responding entries in the event matrix for the current
`search-date are assigned the value 2 to represent that
`these seats are no longer available. The method ends in
`step 520. Of course, upon the acceptance of seats, the
`ticket processing system would engage the user in an
`appropriate payment and delivery interaction. However,
`such payment and delivery functions are well known
`and not the subject of the present invention.
`[0016]
`An example of processing in accordance
`with the flowchart of Fig. 5 will now be described. Con(cid:173)
`sider, for example, the event matrices shown in Fig. 6.
`For purpose of simplicity of description, these matrices
`represent the seating availability for a small venue for an
`event taking place for three days. Of course, in an actual
`implementation, the venue will generally contain sub(cid:173)
`stantially more seats than shown, and the event will
`generally continue for longer than three days. The event
`matrices shown in Fig. 6 are stored in memory 104 as a
`three dimensional array data structure as is well known
`in the art. Event matrix 602 represents the seating avail(cid:173)
`ability for January 1, 1999 (represented as 19990101 ),
`event matrix 604 represents the seating availability for
`January 2, 1999 (represented as 19990102), and event
`matrix 606 represents the seating availability for Janu-
`ary 3, 1999 (represented as 19990103). Thus, a partic-
`ular row, column in event matrix 602 is accessed as
`(19990101,row,co/umn), a particular row, column in
`event matrix 604
`is accessed as
`( 19990102
`row,co/umn), and a particular row, column in event
`matrix 606 is accessed as (19990103,row, column).
`[0017]
`Referring again to the steps of the flowchart
`of Fig. 5, consider the following example. In step 502 the
`user identifies the desired event and in step 504 the sys-
`tem displays the seating chart for the event. In step 506
`the user enters seat constraints indicating that the user
`wants 3 consecutive seats in the first three rows. In step
`508 search-date is initialized to 19990101 which is the
`first date for the event. In step 51 O the event matrix iden(cid:173)
`tified by the search-date of 19990101, namely event
`matrix 602, is searched for 3 consecutive seats availa-
`ble within rows 1 through 3. As can be seen by event
`matrix 602, there are not three consecutive entries
`within rows 1-3 which contain a 1 and the seat con(cid:173)
`straints cannot be satisfied for the event on January 1,
`1999. Thus, the test of step 512 is no and in step 514 it
`is determined that there are additional dates available.
`In step 516 search-date is incremented and set to
`19990102. Control then returns to step 510. Step 510
`now searches the event matrix identified by the search(cid:173)
`date 19990102, namely event matrix 604, for 3 consec-
`
`25
`
`30
`
`40
`
`As such, there are various alternatives for the display
`and accept steps (522 and 524). In one embodiment,
`the ticket processing program code 11 O (Fig. 1) may
`contain an algorithm for making some judgment as to
`the "best" set of seats when multiple sets satisfy the
`seat constraints. For example,
`the algorithm may
`choose the center-most seats in the lowest row number,
`in which case the seats in set 2 would be chosen and
`displayed to the user in step 522. If the user rejected this
`set, the remaining sets could be offered in a similar
`manner. Alternatively, the sets could be offered sequen(cid:173)
`tially, or only the first set which satisfies the seat con-
`35 straints could be offered. One skilled in the art would
`recognize that there are various ways of handling multi(cid:173)
`ple seat sets.
`[0019]
`Assume for purposes of this example that
`the system contains an algorithm for choosing the
`"best" seats and that the seats in set 2 are displayed
`and offered to the user in step 522 and that the user
`accepts these seats. Then, in step 526 each of the cor(cid:173)
`responding entries in event matrix 606 must be marked
`with a 2 to indicate that the seats are no longer availa-
`45 ble. More particularly,
`the
`seats
`indexed by
`(19990103,2,2), ( 19990103,2,3), and ( 19990103,2,4)
`would be set to 2. The method ends in step 520.
`[0020]
`As seen from the above description, the
`invention provides the advantage that a user may con-
`50 veniently obtain tickets for an event when the user
`desires specific seats and is somewhat flexible with
`respect to event dates. The invention solves the prior
`problem of the user having to institute a separate search
`for the desired seats on multiple dates. Instead, the sys-
`tern finds the dates on which the desired seats are avail-
`able and offers the seats to the user in a more
`convenient manner.
`[0021]
`It is noted that if a particular event has a
`
`55
`
`4
`
`

`
`7
`
`EP 1 091 308 A2
`
`8
`
`large number of available dates, and if the user has
`some date limitations, it may be inconvenient for the
`user to be offered seats for many dates which the user
`does not want until the desired dates are reached. As
`such, in accordance with another embodiment of the
`invention, the user may enter date constraints to limit
`the search to particular dates. The date constraints, like
`the seat constrains, may take various forms. For exam-
`ple, the date constraints may include a date range,
`weekend only, weekday only, particular days of the
`week only, or various other types of date constraints.
`[0022]
`In accordance with another embodiment, the
`user may enter price constraints to limit the search to
`seats having a particular price or price range. Of course,
`in such an embodiment, price information for tickets
`would be stored in memory 104.
`[0023]
`In a preferred embodiment, the computer
`100 implementing the present invention is a network
`server which allows direct customer access via network
`interface 108. In this preferred embodiment, user inter(cid:173)
`action takes place via the 1/0 devices at the customer's
`access device (e.g. computer, telephone, television,
`etc.), rather than via user 1/0 106.
`[0024]
`Alternatively, computer 100 may be operated
`by a ticket agent who uses user 1/0 106 and communi(cid:173)
`cates with a customer (e.g. in person or via telephone).
`[0025]
`The foregoing Detailed Description is to be
`understood as being in every respect illustrative and
`exemplary, but not restrictive, and the scope of the
`invention disclosed herein is not to be determined from
`the Detailed Description, but rather from the claims.
`[0026]
`It is to be understood that the embodiments
`shown and described herein are only illustrative of the
`principles of the present invention and that various mod(cid:173)
`ifications may be implemented by those skilled in the art
`without departing from the scope of the invention.
`
`Claims
`
`1. A method for operation of a ticket processing sys-
`tern, said method comprising the steps of:
`
`40
`
`receiving seat selection constraints; and
`searching a database containing seat availabil-
`ity information for a plurality of dates to deter-
`mine the next available date on which seats
`satisfying said seat selection constraints are
`available.
`
`2. The method of claim 1 further comprising the step
`of:
`
`50
`
`receiving date constraints from said user; and
`wherein said step of searching determines the
`next available date which satisfies said date
`constraints and on which seats satisfying said
`seat selection constraints are available.
`
`55
`
`5
`
`3. The method of claim 1 further comprising the steps
`of:
`
`5
`
`10
`
`15
`
`20
`
`25
`
`30
`
`offering seats available on said next available
`date to said user; and
`if said user does not accept said offered seats,
`then continuing to search said database to
`determine a next available date subsequent to
`the date of said offered seats on which seats
`satisfying said seat selection constraints are
`available.
`
`4.
`
`5.
`
`6.
`
`7.
`
`The method of claim 1 wherein said seat selection
`constraints include a number of seats and wherein
`said searching step searches for said number of
`seats satisfying said seat selection constraints.
`
`The method of claim 4 wherein said number of
`seats is one.
`
`The method of claim 4 wherein said number of
`seats is greater than one.
`
`A computer readable medium storing computer
`program instructions defining the steps of:
`
`receiving seat selection constraints; and
`searching a database containing seat availabil-
`ity information for a plurality of dates to deter-
`mine the next available date on which seats
`satisfying said seat selection constraints are
`available.
`
`8.
`
`35
`
`The computer readable medium of claim 7 further
`comprising computer program instructions defining
`the step of:
`
`receiving date constraints from said user; and
`wherein said step of searching determines the
`next available date which satisfies said date
`constraints and on which seats satisfying said
`seat selection constraints are available.
`
`45
`
`9. The computer readable medium of claim 7 further
`comprising computer program instructions defining
`the steps of:
`
`offering seats available on said next available
`date to said user; and if said user does not
`accept said offered seats, then continuing to
`search said database to determine a next avail(cid:173)
`able date subsequent to the date of said
`offered seats on which seats satisfying said
`seat selection constraints are available.
`
`10. The computer readable medium of claim 7 wherein
`said seat selection constraints include a number of
`seats and wherein said computer program instruc-
`
`

`
`9
`
`EP 1 091 308 A2
`
`10
`
`tions defining the step of searching further define
`the step of searching for said number of seats sat(cid:173)
`isfying said seat selection constraints.
`
`11. The computer readable medium of claim 1 O 5
`wherein said number of seats is one.
`
`12. The computer readable medium of claim 10
`wherein said number of seats is greater than one.
`
`13. A ticket processing system comprising:
`
`means for receiving seat selection constraints;
`and
`means for searching a database containing
`seat availability information for a plurality of
`dates to determine the next available date on
`which seats satisfying said seat selection con(cid:173)
`straints are available.
`
`14. The ticket processing system of claim 13 further
`comprising:
`
`means for receiving date constraints from said
`user; and
`wherein said means for searching determines
`the next available date which satisfies said date
`constraints and on which seats satisfying said
`seat selection constraints are available.
`
`15. The ticket processing system of claim 13 further
`comprising:
`
`means for offering seats available on said next
`available date to said user; and
`means for continuing to search said database
`to determine a next available date subsequent
`to the date of said offered seats on which seats
`satisfying said seat selection constraints are
`available if said user does not accept said
`offered seats.
`
`16. The ticket processing system of claim 13 wherein
`said seat selection constraints include a number of
`seats and wherein said means for searching
`searches for said number of seats satisfying said
`seat selection constraints.
`
`10
`
`15
`
`20
`
`25
`
`30
`
`35
`
`40
`
`45
`
`17. The ticket processing system of claim 16 wherein
`said number of seats is one.
`
`50
`
`18. The ticket processing system of claim 16 wherein
`said number of seats is greater than one.
`
`55
`
`6
`
`

`
`EP 1 091 308 A2
`
`FIG. 1
`
`r106
`
`USER 1/0
`
`I ,102
`-------4 PROCESSOR to-----i
`
`100
`
`MEMORY r 110
`TICKET
`PROCESSING
`PROGRAM
`COOE
`
`r 112
`
`EVENT
`MATRICES
`
`,108
`NETWORK
`INTERFACE
`
`2
`
`3
`
`N
`
`FIG. 2
`
`2 3
`
`• H
`
`.2Q2
`
`7
`
`

`
`EP 1 091 308 A2
`
`FIG. 3
`
`STAGE
`3
`
`2
`
`5
`
`5
`
`FIG. 4
`
`/
`[,//
`
`//
`
`/
`
`/
`
`/
`
`/
`/'
`
`/
`
`/
`
`/
`
`/
`
`/
`
`/
`
`/
`
`/
`
`/
`
`/
`
`ROW i--+---i---+---+--1
`
`'
`
`8
`
`

`
`EP 1 091 308 A2
`
`FIC. 5
`
`,. 502
`
`.. 504
`
`.. 506
`
`.. sos
`
`USER ENTERS EVENT
`
`DISPLAY SEATING CHART
`
`USER ENTERS SEAT
`CONSTRAINTS
`
`INITIALIZE SEARCH-DATE
`TO EARLIEST DA TE
`
`- 510
`SEARCH SEARCH-DATE MATRIX 11
`FOR SEATS WHICH SATISFY
`SEAT CONSTRAINTS
`
`,512
`
`YES
`
`SEATS FOUND?
`
`NO
`
`.. 516
`
`INCREMENT SEARCH-DATE
`
`9
`
`OISPLA Y AVAILABLE
`SEA TS TO USER
`\
`ACCEPT?
`
`~
`
`YES
`MARK SEATS IN SEARCH-DATE
`MATRIX AS UNAVAILABLE
`
`.. 522
`
`5
`
`..
`526
`
`( ENO f 520
`
`,514
`.. s1a
`>~ NOTIFY USER-FAILED TO
`FIND ACCEPTABLE SEATS ~
`MORE DATES AVAILABLE?
`YES
`
`

`
`EP 1 091 308 A2
`EP 1 091 308 A2
`
`FIG. 6
`
`19990103
`
`606
`
`5
`'
`2 3
`0 2 2 2 0
`1 1 1 1 1
`1 2 1 1 1
`1 2 2 2 2
`0 1 1 1 0
`
`·'
`
`0 2 2 2 o I
`2 2 1 2 2
`2 2 1 1 2
`1 1 1 1 1
`0 1 1 1 0
`
`3
`
`' 5
`
`1
`2
`3
`
`' 5
`
`0
`1
`1
`1
`0
`
`1
`2
`1
`2
`2
`
`1 2
`2 2
`2 1
`2 2
`1 1
`
`0 If
`2
`1
`1
`0 /
`
`10