KR960018968A - PLD Structure of Code Division Multiple Access System and Its Approach - Google Patents

PLD Structure of Code Division Multiple Access System and Its Approach Download PDF

Info

Publication number
KR960018968A
KR960018968A KR1019940031032A KR19940031032A KR960018968A KR 960018968 A KR960018968 A KR 960018968A KR 1019940031032 A KR1019940031032 A KR 1019940031032A KR 19940031032 A KR19940031032 A KR 19940031032A KR 960018968 A KR960018968 A KR 960018968A
Authority
KR
South Korea
Prior art keywords
pld
relation
station
address
cms
Prior art date
Application number
KR1019940031032A
Other languages
Korean (ko)
Other versions
KR0123400B1 (en
Inventor
김경수
김영미
안지환
Original Assignee
양승택
재단법인 한국전자통신연구소
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
Application filed by 양승택, 재단법인 한국전자통신연구소 filed Critical 양승택
Priority to KR1019940031032A priority Critical patent/KR0123400B1/en
Publication of KR960018968A publication Critical patent/KR960018968A/en
Application granted granted Critical
Publication of KR0123400B1 publication Critical patent/KR0123400B1/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/76—Architectures of general purpose stored program computers
    • G06F15/80—Architectures of general purpose stored program computers comprising an array of processing units with common control, e.g. single instruction multiple data processors
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • G06F15/177—Initialisation or configuration control

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Computing Systems (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

본 발명은 기지국과 제어국과 운용국의 프로그렘을 하나로 통일하고 운용중 정적데이타의 변경을 용이하게 수행하도록 한 KCS의 PLD구조 및 그의 접근방법에 관한 것이다.The present invention relates to a PLD structure of KCS and its approach to unify the programming of a base station, a control station, and an operating station into one, and to easily change static data during operation.

이러한 본 발명은 국별로 정의된 정적데이타로 실시간 처리를 위하여 주기억장치의 일정영역에 프로그램과 독립하여 상주하는 PLD를 기지국과 제어국과 운용국에 분산하여 적재한다.The present invention distributes and loads the PLD residing independently of the program in the base station, the control station and the operating station in a predetermined area of the main memory device for real time processing with station-specific static data.

PLD는 액세스하고자 하는 릴레이션 데이타의 저장위치와 스키마에 대한 정보를 저장하는 헤더테이블과, CMS의 기지국과 제어국과 운용국의 중앙처리장치가 인식할 수 있는 코드로 변환된 릴레이션 데이타로 구성된다. 또한 상기 PLD에 저장되어 있는 릴레이션 데이타를 접근하는 절차를 새로 발명하였다.The PLD consists of a header table that stores information about the storage location and schema of relation data to be accessed, and relation data converted into codes that can be recognized by the central processing unit of the base station, the control station, and the operating station of the CMS. In addition, the procedure for accessing relation data stored in the PLD is newly invented.

Description

코드분할 다중접근 시스템의 PLD 구조 및 그의 접근방법PLD Structure of Code Division Multiple Access System and Its Approach

본 내용은 요부공개 건이므로 전문내용을 수록하지 않았음As this is a public information case, the full text was not included.

제1도는 본 발명이 적용되는 CMS의 기지국과 제어국과 운용국에 분산되어 적재되는 PLD의 실장도,1 is a mounting diagram of a PLD distributed in a base station, a control station, and an operating station of a CMS to which the present invention is applied;

제2도는 PLD의 물리적 구조도,2 is a physical structure diagram of the PLD,

제3도는 PLD에 저장되어 있는 릴레이션 데이타를 접근하는 절차도.3 is a procedure of accessing relation data stored in a PLD.

Claims (8)

KCS의 기지국과 제어국과 운용국에 있어서, 상기 국별로 정의되어 시스템 운용시 변경되지 않는 정적 데이타로 실시간 처리를 위하여 주기억장치의 일정 영역에 프로그램과 독립하여 상주하는 PLD를 상기 기지국과 제어국과 운용국에 분산하여 적재하도록 한 것을 특징으로 하는 CMS의 PLD 구조.A base station, a control station, and an operating station of a KCS base station, a control station, and an operating station, which have a PLD that is defined by the station and that resides independently of a program in a predetermined area of the main memory device for real-time processing with static data that does not change during system operation. PLD structure of the CMS, characterized in that to be distributed in the load. 제1항에 있어서, 상기 PLD는 액세스하고자 하는 릴레이션 데이타의 저장위치와 스키마에 대한 정보를 저장하는 헤더테이블과 ; CMS의 기지국과 제어국과 운용국의 중앙처리장치가 인식할 수 있는 코드로 변환된 릴레이션 데이타로 구성하는 것을 특징으로 하는 CMS의 PLD 구조.2. The system of claim 1, wherein the PLD comprises: a header table for storing information about a storage location and schema of relation data to be accessed; A PLD structure of a CMS comprising a relation data converted into codes recognizable by a base station of a CMS, a control station, and a central processing unit of an operating station. 제2항에 있어서, 상기 헤더테이블은 PLD 헤더와 릴레이션 디렉토리와 어트리뷰트 딕션어리와 키 딕션어리로 구성하는 것을 특징으로 하는 CMS의 PLD 구조.3. The PLD structure of a CMS according to claim 2, wherein the header table comprises a PLD header, a relation directory, an attribute dictionary, and a key dictionary. 제3항에 있어서, 상기 PLD 헤더에는 PLD명칭, PLD버젼, PLD 시작주소, PLD 사이즈, 프로세서 식별번호, 릴레이션의 갯수, 릴레이션의 최종식별번호, 릴레이션 그룹의 갯수, 릴레이션 디렉토리의 주소, BCP PLD의 시작주소, BCP PLD의 크기등이 포함되도록 한 것을 특징으로 하는 CMS의 PLD 구조.The PLD header of claim 3, wherein the PLD header includes a PLD name, a PLD version, a PLD start address, a PLD size, a processor identification number, a number of relations, a final identification number of a relation, a number of relation groups, an address of a relation directory, and a BCP PLD. PLD structure of CMS characterized by including start address, size of BCP PLD, etc. 제3항에 있어서, 상기 릴레이션 디렉토리에는 릴레이션의 상태정보, 릴레이션의 식별번호, 릴레이션의 명칭, 튜플의 시작주소, 튜플의 크기, 최대튜플갯수, 저장된 튜플의 갯수, 키의 갯수, 탐색방법, 어트리뷰트 딕션어리의 주소, 어트리뷰트의 갯수등이 포함되도록 한 것을 특징으로 하는 CMS의 PLD 구조.4. The relation directory of claim 3, wherein the relation directory includes relation state information, relation identification number, relation name, start address of tuple, size of tuple, maximum number of tuples, number of stored tuples, number of keys, search method, attributes. CMS's PLD structure, which includes the address of dictionaries and the number of attributes. 제3항에 있어서, 상기 어트리뷰트 딕션어리에는 어트리뷰트의 데이타형태와 어트리뷰트의 갯수가 포함되도록 한 것을 특징으로 하는 CMS의 PLD 구조.4. The PLD structure of a CMS according to claim 3, wherein the attribute dictionary includes the data type of the attribute and the number of attributes. 제3항에 있어서, 상기 키 딕션어리에는 키의 범위가 포함되도록 한 것을 특징으로 하는 CMS의 PLD 구조.4. The PLD structure of a CMS according to claim 3, wherein the key dictionary includes a range of keys. PLD에 저장되어 있는 릴레이션 데이타를 접근하는 방법에 있어서, 접근하고자 하는 릴레이션 데이타의 릴레이션 식별번호를 매개변수로 하여 DAL 함수를 호출하는 단계와 ; 시작번지에 위치하는 데이타베이스 헤더 테이블을 접근하여 RDIR주소와 릴레이션에 할당되어 있는 최대튜플 갯수를 참조하는 단계와 ; 상기 RDIR 주소에 의해 릴레이션 디렉토리를 접근하여 릴레이션 식별번호를 순차적 혹은 인덱싱에 의해 비교하고 릴레이션 데이타의 시작주소와 ADIC주소, KDIC주소를 참조하는 단계와 ; 릴레이션 데이타의 시작주소를 응용프로그램에 리턴하는 단계와 ; 탐색방법이 인덱스일 경우 릴레이션 데이타의 시작주소에 인덱스 덧셈연산에 의해 원하는 튜플데이타의 시작주소를 추출하고 상기 주소로부터 하나의 튜플을 참조하는 단계로 이루어짐을 특징으로 하는 CMS의 PLD의 접근방법.A method of accessing relation data stored in a PLD, the method comprising: calling a DAL function with a relation identification number of a relation data to be accessed as a parameter; Accessing the database header table located at the start address and referring to the RDIR address and the maximum number of tuples allocated to the relation; Accessing the relation directory by the RDIR address, comparing relation identification numbers by sequential or indexing, and referencing the start address, the ADIC address, and the KDIC address of the relation data; Returning the start address of the relation data to the application program; If the search method is an index, extracting the start address of the desired tuple data by index addition operation to the start address of the relation data and referring to one tuple from the address. ※ 참고사항 : 최초출원 내용에 의하여 공개하는 것임.※ Note: The disclosure is based on the initial application.
KR1019940031032A 1994-11-24 1994-11-24 Pld structure of cdma system KR0123400B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1019940031032A KR0123400B1 (en) 1994-11-24 1994-11-24 Pld structure of cdma system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1019940031032A KR0123400B1 (en) 1994-11-24 1994-11-24 Pld structure of cdma system

Publications (2)

Publication Number Publication Date
KR960018968A true KR960018968A (en) 1996-06-17
KR0123400B1 KR0123400B1 (en) 1997-11-21

Family

ID=19398858

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1019940031032A KR0123400B1 (en) 1994-11-24 1994-11-24 Pld structure of cdma system

Country Status (1)

Country Link
KR (1) KR0123400B1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100950650B1 (en) * 2003-01-27 2010-04-01 삼성전자주식회사 Method for managing resources in umts ran manager of mobile communication system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100950650B1 (en) * 2003-01-27 2010-04-01 삼성전자주식회사 Method for managing resources in umts ran manager of mobile communication system

Also Published As

Publication number Publication date
KR0123400B1 (en) 1997-11-21

Similar Documents

Publication Publication Date Title
US5404510A (en) Database index design based upon request importance and the reuse and modification of similar existing indexes
Yao Approximating block accesses in database organizations
US6272502B1 (en) Refreshing materialized views of a database to maintain consistency with underlying data
WO1998001811A3 (en) Extensible indexing
WO1996018159A3 (en) Implementation independent extensible query architecture for information retrieval systems
EP0350208A3 (en) Real-time database
GB2329044A (en) Data retrieval system
US20070136243A1 (en) System and method for data indexing and retrieval
JPH10505690A (en) X. 500 System and Method
DE69910219D1 (en) TRANSFORMING THE PERSPECTIVE ON TABLES FROM RELATIONAL DATABASES
CA2027779A1 (en) Data retrieval system for relational database
US20040167874A1 (en) Supporting Bindexes on primary Bstructures with large primary keys
US6826563B1 (en) Supporting bitmap indexes on primary B+tree like structures
Bresciani Querying databases from description logics
KR890016474A (en) Database object analysis method and system
KR960018968A (en) PLD Structure of Code Division Multiple Access System and Its Approach
CA2232246A1 (en) Generic data centric object structure and implementation
KR100778328B1 (en) A method of query optimization in database by the use of virtual columns
KR910010344A (en) Database Query Processing Unit
Meghini Toward a logical reconstruction of image retrieval
KR19980037145A (en) How to Search Databases on Computer Systems
KR970059963A (en) How to create a table in a database management system
JPS63189934A (en) Sub-entry processing system for data base
KR100238439B1 (en) Method of managing object-orient route index of schema manager
Lynch et al. Optimising performance

Legal Events

Date Code Title Description
A201 Request for examination
E701 Decision to grant or registration of patent right
GRNT Written decision to grant
FPAY Annual fee payment

Payment date: 20070831

Year of fee payment: 11

LAPS Lapse due to unpaid annual fee