GB2315576A - Telecommunications one-dimensional database structure - Google Patents

Telecommunications one-dimensional database structure Download PDF

Info

Publication number
GB2315576A
GB2315576A GB9615193A GB9615193A GB2315576A GB 2315576 A GB2315576 A GB 2315576A GB 9615193 A GB9615193 A GB 9615193A GB 9615193 A GB9615193 A GB 9615193A GB 2315576 A GB2315576 A GB 2315576A
Authority
GB
Grant status
Application
Patent type
Prior art keywords
data
identifier
stored
scp
information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
GB9615193A
Other versions
GB2315576B (en )
GB9615193D0 (en )
Inventor
Bart Jellema
Rene Peeren
Louise Croughan
Freek Aben
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Telefonaktiebolaget LM Ericsson AB
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30Information retrieval; Database structures therefor ; File system structures therefor
    • G06F17/30286Information retrieval; Database structures therefor ; File system structures therefor in structured data stores
    • G06F17/30557Details of integrating or interfacing systems involving at least one database management system
    • G06F17/3056Details of integrating or interfacing systems involving at least one database management system between a Database Management System and a front-end application

Abstract

Stored data in a database preferably for use in a telecommunications network are easily accessible in real time by using a data organisation which stores the data in one-dimensional tables. All the information of one type is stored in one such table, and is decoded in a known way. Each table comprises at least one stored data item and one associated data item identifier. The stored data is accessed by sending a message comprising a root address specifying the required data point, an application number identifying the table of interest, a data item identifier e.g. 12a, 12b and a unique query identifier. In response to the message the stored data items e.g. 14a,14b associated with the data item identifier are retrieved and returned linked by the unique query identifier. Information of a different type, in a different format, may be stored in a second table, and decoded in a different known way and the stored data items may be updated by a similar method.

Description

DATABASE . ACCESS This invention relates to a database access protocol, in particular for use within an Intelligent Networks architecture. Specifically, the invention relates to a protocol which allows data to be retrieved quickly from the database.

An Intelligent Networks architecture typically includes a number of Service Control Points (SCPs), which have Service Switching Points (SSPs) connected to them. Each SSP is a switching system that can intercept telephone calls, and query the SCP. The SCP contains service specific logic and data, that allows it to return instructions to the SSP on how to deal with the intercepted call.

In returning the instructions to the SSP, the SCP may require access to specific customer data stored in an external database. These external databases are referred to as Service Data Points (SDPs). For example, a SDP may be a customer database of a network operator, or a credit card database of a credit card company.

In systems known from the prior art Intelligent Networks standards, ETSI ETS 300 374-1, the SCP-SDP interface is based on the conventional X.500 protocols.

However, these protocols were designed to support a flexible data model, and are thus very powerful in allowing a wide variety of complicated data structures.

However, the X.500 protocols were not originally intended to be used in real time applications, and so a disadvantage of this flexibility is that, when the X.500 messages are coded into a stream of bytes, to be transferred over the SCP-SDP interface, a lot of bytes are necessary to indicate the structure of <RTI>the data s</RTI> model which is being used, and only relatively few bytes are used to carry the actual data values required by the SCP. These extra bytes, which need to be coded and decoded, consume processor time, and cause delays in the processing of Intelligent Networks service requests.

In accordance with the present invention, the data communication protocol used on the SCP-SDP interface is more efficient, because of the simple way in which the data is organised in the database. This allows communication over the SCP-SDP interface to be more efficient, which minimises the time required to process service requests.

For a better understanding of the present invention, reference will now be made, by way of example, to the accompanying drawings, in which: Figure 1 is a block schematic diagram of a part of a network architecture in accordance with the present invention; and Figure 2 is an illustration of the way in which data is organised in accordance with the invention.

As shown in Figure 1, the network includes a Service Switching Point (SSP) 2, connected to a Service Control Point (SCP) 4. Of course, it will be appreciated that, in practice, the network will include a large number of SSPs, and may well include many SCPs, but the illustrated part of the network is sufficient for explanation of the present invention. The SSP 2 intercepts calls sent from an end user (not shown). In order to connect the call, the SSP 2 must obtain information from the SCP 4. Thus, the SCP stores service specific logic and data, that allows it to return instructions to the SSP. However, in order to deal with the service request, the SCP 4 may require access to specific customer data stored in a Service Data Point (SDP) 6.

When it is determined by the SCP that data is required from an external database or SDP, a request is sent to the SDP. Figure 2 is a schematic illustration of the way in which the data is stored in a series of one-dimensional tables within the SDP. To access the required information, the SCP must address the relevant location in the database. The address includes firstly a root, which identifies the required SDP. Secondly, the message sent from the SCP includes the required application number. This identifies a particular onedimensional table, within the database. Each onedimensional table stores information of a particular type. Thus, for example, in Figure 2, there is shown a database organisation with two applications.

Application 1 is used to store the cardholder names, and their individual credit limits, associated with particular credit card numbers. Application 2 stores telephone numbers associated with particular telephone subscribers. It will be apparent that the database can include any desired number of applications.

The message sent from the SCP to the SDP thirdly includes a data item identifier 12a, 12b. In the case of application 1, the data item identifier 12a is the credit card number, while in the case of application 2, the data item identifier 12b is the telephone subscriber name.

Finally, the message sent from the SCP to the SDP includes a unique identifier, associated with that query.

In response to the message from the SCP, the SDP identifies the data item or items associated with the received data item identifier. In the case of the data item identifier 12a, the relevant data items 14a, 16a are the credit card holder's name and credit limit respectively. In the case of the data item identifier 12b, the data item 14b is the subscriber's telephone number.

The one-dimensional table indicated by Application 1 stores information in a format which may be different from the format in which Application 2 stores information. For example, in Application 1, the data item identifier 12a is a number, with a predetermined number of digits, while the stored information elements 14a, 16a are a character string of unknown length and a number of maybe three or four digits. In Application 2, the data item identifier 12b is a character string of unknown length, while the stored information element 14b is a number with a predetermined number of digits.

Therefore, the application number determines how stored information is to be coded and decoded.

Thus, in response to the message from the SCP, the SDP retrieves the data item information elements, and returns them to the SCP, in a message which also returns the unique identifier which was sent from the SCP. This allows the SCP to link the received message from the SDP with the relevant request.

Thus, the data organisation within the database allows a very simple way of indicating the data item which is required, and hence allows very short and efficient messages to be sent between the SCP and SDP, without necessitating analysis by the database.

The data organisation also allows data within the database to be updated in a simple way. An update request can include a unique identifier, an application number, a data item identifier, and updated data item information to replace the existing stored data item information. Thus, again, the database can easily identify the data item which is of interest, without requiring much processing. After the relevant data item has been updated, the database can return a message to the SCP, simply containing the unique identifier, which serves as confirmation that the necessary update has been carried out.

It can therefore be seen that the data organisation allows easy access to the data in real time applications.

Claims (7)

1. A method of accessing required information stored in a database, the method comprising storing the information in at least one one-dimensional table, the or each table comprising a plurality of rows, of which at least one contains stored data, and at least one contains a respective data identifier associated with the stored data, the method comprising sending a message including the data identifier associated with the required information, and retrieving the stored data associated with the data identifier.
2. A method of storing information stored in a database, the method comprising storing the information in at least one one-dimensional table, the or each table comprising a plurality of rows, of which at least one contains stored data, and at least one contains a data identifier associated therewith.
3. A method as claimed in claim 2, wherein the information is stored in a plurality of one-dimensional tables, each one-dimensional table storing information of a different type.
4. A method as claimed in claim 2 or 3, wherein each one-dimensional table has an application identifier associated therewith, the application identifier being used to determine how to decode data stored in the associated one-dimensional table.
5. A method as claimed in claim 2, 3 or 4, wherein each one-dimensional table contains a plurality of stored data items, and data identifiers associated therewith, each data item and associated data identifier being in the same format.
6. A telecommunications network, comprising at least one control point and at least one data point, the data point including a database in which information is stored in at least one one-dimensional table, the or each table comprising a plurality of rows, of which at least one contains stored data, and at least one contains a data identifier associated therewith.
7. A telecommunications network as claimed in claim 6, wherein, when it is determined at the control point that information from the data point is required, a message is sent from the control point to the data point, the message including the data identifier associated with the required information.
GB9615193A 1996-07-19 1996-07-19 Database access Expired - Lifetime GB2315576B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
GB9615193A GB2315576B (en) 1996-07-19 1996-07-19 Database access

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
GB9615193A GB2315576B (en) 1996-07-19 1996-07-19 Database access

Publications (3)

Publication Number Publication Date
GB9615193D0 GB9615193D0 (en) 1996-09-04
GB2315576A true true GB2315576A (en) 1998-02-04
GB2315576B GB2315576B (en) 2001-04-18

Family

ID=10797190

Family Applications (1)

Application Number Title Priority Date Filing Date
GB9615193A Expired - Lifetime GB2315576B (en) 1996-07-19 1996-07-19 Database access

Country Status (1)

Country Link
GB (1) GB2315576B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2351368A (en) * 1999-06-21 2000-12-27 Zygon Systems Ltd Product catalogue production system
EP1239383A1 (en) * 2001-03-09 2002-09-11 Zygon Systems Ltd. Electronic information storage and retrieval system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4805099A (en) * 1987-04-17 1989-02-14 Wang Laboratories, Inc. Retrieval of related records from a relational database
US5418947A (en) * 1992-12-23 1995-05-23 At&T Corp. Locating information in an unsorted database utilizing a B-tree
EP0661651A1 (en) * 1993-12-29 1995-07-05 Microsoft Corporation Unification of directory service with file system services
EP0663641A1 (en) * 1994-01-14 1995-07-19 Microsoft Corporation Summary catalogs

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI100075B (en) * 1994-11-11 1997-09-15 Ericsson Telefon Ab L M The system for managing subscriber information in the telephone network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4805099A (en) * 1987-04-17 1989-02-14 Wang Laboratories, Inc. Retrieval of related records from a relational database
US5418947A (en) * 1992-12-23 1995-05-23 At&T Corp. Locating information in an unsorted database utilizing a B-tree
EP0661651A1 (en) * 1993-12-29 1995-07-05 Microsoft Corporation Unification of directory service with file system services
EP0663641A1 (en) * 1994-01-14 1995-07-19 Microsoft Corporation Summary catalogs

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2351368A (en) * 1999-06-21 2000-12-27 Zygon Systems Ltd Product catalogue production system
WO2000079409A2 (en) * 1999-06-21 2000-12-28 Zygon Systems Ltd. Product catalogue production system
WO2000079409A3 (en) * 1999-06-21 2002-05-02 Zygon Systems Ltd Product catalogue production system
EP1239383A1 (en) * 2001-03-09 2002-09-11 Zygon Systems Ltd. Electronic information storage and retrieval system

Also Published As

Publication number Publication date Type
GB2315576B (en) 2001-04-18 grant
GB9615193D0 (en) 1996-09-04 grant

Similar Documents

Publication Publication Date Title
US5218632A (en) Flexible call detail recording system
US5659605A (en) Method and apparatus for providing soft dial tone using office equipment designators
US5533115A (en) Network-based telephone system providing coordinated voice and data delivery
US5991377A (en) System and method for manipulating data fields in a call structure for synchronizing billing information and retaining original calling party information
US5418947A (en) Locating information in an unsorted database utilizing a B-tree
US5163087A (en) Delivery of customer data base key using automatic number identification
US6813346B2 (en) System and method for selecting a destination number upon receiving a dialed number from a calling party
US5703930A (en) Personal mobile communication system with call bridging
US5838774A (en) Telephone polling method
US5469504A (en) Automatic call distribution with intersubnetwork customer information transfer system and method
US6636877B1 (en) Method for analyzing the quality of telecommunications switch command tables
US5377186A (en) System for providing enhanced subscriber services using ISUP call-setup protocol
US6356756B1 (en) Method and system for routing calls to a wireless telecommunications services platform
US5854836A (en) Method and system for utilizing an information delivery service in a local number portability environment
US6925155B2 (en) Method and system for routing calls based on a language preference
US5551025A (en) Relational database system for storing different types of data
EP0424015B1 (en) Multilocation queuing for telephone calls
US5920619A (en) Regional centrex
US5859901A (en) Intelligent call connection service
US5881144A (en) Graphical intelligent network (IN) subscription manager
EP0726682A2 (en) Intelligent network internetworking access arrangement
US6178232B1 (en) Method and system for providing enhanced caller identification
US6208642B1 (en) Architecture independent application invocation over a telephony network
US6055302A (en) System and method for incoming and outgoing interrogations for store-and-forward services
US5212789A (en) Method and apparatus for updating application databases used in a distributed transaction processing environment

Legal Events

Date Code Title Description
PE20 Patent expired after termination of 20 years

Expiry date: 20160718