• Title/Summary/Keyword: 집계자료

Search Result 199, Processing Time 0.026 seconds

2000년도 레미콘 및 원자재 소비실태 분석

  • 한국레미콘공업협회
    • 레미콘
    • /
    • no.10 s.69
    • /
    • pp.92-96
    • /
    • 2001
  • 본 자료는 2000년도 원자재소비실태 조사를 집계 분석한 자료이며, 전국 723개 공장을 대상으로 조사하였으며 170개 공장의 응답을 취합한 자료입니다. 본 자료를 참고함에 있어 이점을 유의하시고 활용해 주시기 바랍니다. -편집자 주-

  • PDF

Linear Resource Sharing Method for Query Optimization of Sliding Window Aggregates in Multiple Continuous Queries (다중 연속질의에서 슬라이딩 윈도우 집계질의 최적화를 위한 선형 자원공유 기법)

  • Baek, Seong-Ha;You, Byeong-Seob;Cho, Sook-Kyoung;Bae, Hae-Young
    • Journal of KIISE:Databases
    • /
    • v.33 no.6
    • /
    • pp.563-577
    • /
    • 2006
  • A stream processor uses resource sharing method for efficient of limited resource in multiple continuous queries. The previous methods process aggregate queries to consist the level structure. So insert operation needs to reconstruct cost of the level structure. Also a search operation needs to search cost of aggregation information in each size of sliding windows. Therefore this paper uses linear structure for optimization of sliding window aggregations. The method comprises of making decision, generation and deletion of panes in sequence. The decision phase determines optimum pane size for holding accurate aggregate information. The generation phase stores aggregate information of data per pane from stream buffer. At the deletion phase, panes are deleted that are no longer used. The proposed method uses resources less than the method where level structures were used as data structures as it uses linear data format. The input cost of aggregate information is saved by calculating only pane size of data though numerous stream data is arrived, and the search cost of aggregate information is also saved by linear searching though those sliding window size is different each other. In experiment, the proposed method has low usage of memory and the speed of query processing is increased.

Analyzing Influence Factors of Foodservice Sales by Rebuilding Spatial Data : Focusing on the Conversion of Aggregation Units of Heterogeneous Spatial Data (공간 데이터 재구축을 통한 음식업종 매출액 영향 요인 분석 : 이종 공간 데이터의 집계단위 변환을 중심으로)

  • Noh, Eunbin;Lee, Sang-Kyeong;Lee, Byoungkil
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.35 no.6
    • /
    • pp.581-590
    • /
    • 2017
  • This study analyzes the effect of floating population, locational characteristics and spatial autocorrelation on foodservice sales using big data provided by the Seoul Institute. Although big data provided by public sector is growing recently, research difficulties are occurred due to the difference of aggregation units of data. In this study, the aggregation unit of a dependent variable, sales of foodservice is SKT unit but those of independent variables are various, which are provided as the aggregation unit of Korea National Statistical Office, administration dong unit and point. To overcome this problem, we convert all data to the SKT aggregation unit. The spatial error model, SEM is used for analysing spatial autocorrelation. Floating population, the number of nearby workers, and the area of aggregation unit effect positively on foodservice sales. In addition, the sales of Jung-gu, Yeongdeungpo-gu and Songpa-gu are less than that of Gangnam-gu. This study provides implications for further study by showing the usefulness and limitations of converting aggregation units of heterogeneous spatial data.

Freight Mode Choice Modelling with Aggregate RP Data and Disaggregate SP Data (집계적 현시선호자료와 비집계적 진술선호자료를 이용한 화물수단선택모형 구축)

  • Kang, Woong;Lee, Jang-Ho;Park, Minchoul
    • Journal of the Korean Society for Railway
    • /
    • v.20 no.2
    • /
    • pp.265-274
    • /
    • 2017
  • For accurate demand forecasting of railway logistics, we estimated intercity freight mode choice models based on the binary logit model and using production-consumption data from the Korea Transport Database. We estimated two types of models and compared the results by major item of railway logistics, such as container, cement, and steel: 1) The aggregate freight mode choice models are based on the revealed preference (RP) data and 2) The disaggregate models are based on the stated preference (SP) data. With respect to the container, the travel time variable was found to be statistically significant; however, the travel cost variable was not statistically significant in the RP model, while the travel cost variable was statistically significant in the SP model. For cement and steel, the travel cost variables were statistically significant but the travel time variables were not statistically significant in either the RP or the SP models. These results are inconsistent with results from previous studies based on SP data, which showed that the travel time variables were significant. Consequently, it can be concluded that the travel time factor should be considered in container transport, but that this factor is negligible for cement and steel transport.

Spatial Aggregations for Spatial Analysis in a Spatial Data Warehouse (공간 데이터 웨어하우스에서 공간 분석을 위한 공간 집계연산)

  • You, Byeong-Seob;Kim, Gyoung-Bae;Lee, Soon-Jo;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.3
    • /
    • pp.1-16
    • /
    • 2007
  • A spatial data warehouse is a system to support decision making using a spatial data cube. A spatial data cube is composed of a dimension table and a fact table. For decision support using this spatial data cube, the concept hierarchy of spatial dimension and the summarized information of spatial fact should be provided. In the previous researches, however, spatial summarized information is deficient. In this paper, the spatial aggregation for spatial summarized information in a spatial data warehouse is proposed. The proposed spatial aggregation is separated of both the numerical aggregation and the object aggregation. The numerical aggregation is the operation to return a numerical data as a result of spatial analysis and the object aggregation returns the result represented to object. We provide the extended struct of spatial data for spatial aggregation and so our proposed method is efficient.

  • PDF

Efficient Processing of Temporal Aggregation including Selection Predicates (선택 프레디키트를 포함하는 시간 집계의 효율적 처리)

  • Kang, Sung-Tak;Chung, Yon-Dohn;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.35 no.3
    • /
    • pp.218-230
    • /
    • 2008
  • The temporal aggregate in temporal databases is an extension of the conventional aggregate to include the time on the range condition of aggregation. It is a useful operation for Historical Data Warehouses, Call Data Records, and so on. In this paper, we propose a structure for the temporal aggregation with multiple selection predicates, called the ITA-tree, and an aggregate processing method based on the structure. In the ITA-tree, we transform the time interval of a record into a single value, called the T-value. Then, we index records according to their T-values like a $B^+$-tree style. For possible hot-spot situations, we also propose an improvement of the ITA-tree, called the eITA-tree. Through analyses and experiments, we evaluate the performance of the proposed method.

Efficient Computation of Stream Cubes Using AVL Trees (AVL 트리를 사용한 효율적인 스트림 큐브 계산)

  • Kim, Ji-Hyun;Kim, Myung
    • The KIPS Transactions:PartD
    • /
    • v.14D no.6
    • /
    • pp.597-604
    • /
    • 2007
  • Stream data is a continuous flow of information that mostly arrives as the form of an infinite rapid stream. Recently researchers show a great deal of interests in analyzing such data to obtain value added information. Here, we propose an efficient cube computation algorithm for multidimensional analysis of stream data. The fact that stream data arrives in an unsorted fashion and aggregation results can only be obtained after the last data item has been read. cube computation requires a tremendous amount of memory. In order to resolve such difficulties, we compute user selected aggregation fables only, and use a combination of an way and AVL trees as a temporary storage for aggregation tables. The proposed cube computation algorithm works even when main memory is not large enough to store all the aggregation tables during the computation. We showed that the proposed algorithm is practically fast enough by theoretical analysis and performance evaluation.

An Empirical Analysis of the Aggregate Travel Demands of the Urban Households in Korea (우리나라 도시가구 거주자의 집계교통수요함수 분석)

  • 윤재호
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.3
    • /
    • pp.93-103
    • /
    • 2002
  • 우리 국민의 교통수요행태를 분석하기 위하여 준이상수요체계(almost ideal demand system) 함수형태의 집계교통수요모형을 설정하였다. 대중교통수단으로서 시내버스, 시외버스, 택시, 기차, 전철이 그리고 개인교통수단으로서 연료비가 포함되었으며, 기타재화 및 서비스에 대한 소비지출이 함께 추정되었다. 추정에 이용된 자료는 통계청의 "도시가계연보"에 수록된 '전국 도시가구 소비지출'과 "물가통계"에 수록된 '전국 도시소비자 물가'이다. 추정결과 모형의 설명력을 나타내는 수정결정계수(adjusted-$R^2$)는 대부분 0.9 내외에서 높게 나타났다. 추정계수는 총 51개중에서 25개가 5% 수준에서 유의한 것으로 나타났다. 추정된 계수값을 이용하여 가격탄력성과 소득탄력성을 구하였다. 자기가격탄력성과 소득탄력성 추정치는 조금 높기는 하나 부호와 상대적 크기가 모두 예상과 일치하고 다른 연구결과들과 유사한 범위에 있다. 연료비에 대한 소득탄력성은 1.72로 가장 높게 나타났고, 대중교통수단은 0.03~0.49 사이에서 나타나므로 교통수단이 정상재임을 의미한다. 보상수요의 교차가격탄력성은 총 15개의 교차관계에서 12개의 관계가 상식과 일치한다. 다음 연구에서는 더 많은 시계열자료를 발굴하여, 장기간의 교통수요 변화에 대한 분석을 시도할 필요가 있다. 또한 초월대수함수나 동태함수 등 다양한 형태의 수요함수를 시도할 필요가 있다. 여러가지 형태의 교통수요함수추정을 통해서 우리 현실에 적합한 교통수요모형을 발견할 수 있을 것이다. 대도시와 중소도시 등 지역별 지출자료를 발굴하여 지역특성을 반영하는 교통수요함수의 추정도 필요하다.

Automation of Public Land Acquisition Results For Reliable Statistics (보상자료 통계 신뢰성 제고를 위한 공공용지 취득실적집계 자동화방안)

  • Seo, Myoung-Bae;Kim, Nam-Gon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.04a
    • /
    • pp.1430-1431
    • /
    • 2012
  • 토지보상관련 법을 관장하고 있는 국토해양부는 "국토기본법" 제24조의 규정에 따라 용지보상 등을 포함한 국토의 계획 및 이용의 주요시책에 관한 보고서를 매년 정기국회의 개회전까지 국회에 제출하여야 한다. 이 보고서에는 국가보상에 관한 주요통계자료가 포함되는데 이러한 공공용지의 취득 및 손실보상 실적은 보상관련 정책의 수립과 제도개선 및 부동산정책 등에 중요한 기초 자료로 활용되고 있다. 하지만 90여개 기관을 대상으로 9개 양식을 수작업으로 취합하다 보니 시간소요 및 통계오류 등이 발생할 소지가 있어 국가통계의 신뢰도가 저하될 소지가 있다. 이에 정확한 보상통계자료 제공 및 업무의 효율성 제고를 위해 공공용지 취득실적 집계 자동화방안을 제시하고자 한다.

Efficient Authentication of Aggregation Queries for Outsourced Databases (아웃소싱 데이터베이스에서 집계 질의를 위한 효율적인 인증 기법)

  • Shin, Jongmin;Shim, Kyuseok
    • Journal of KIISE
    • /
    • v.44 no.7
    • /
    • pp.703-709
    • /
    • 2017
  • Outsourcing databases is to offload storage and computationally intensive tasks to the third party server. Therefore, data owners can manage big data, and handle queries from clients, without building a costly infrastructure. However, because of the insecurity of network systems, the third-party server may be untrusted, thus the query results from the server may be tampered with. This problem has motivated significant research efforts on authenticating various queries such as range query, kNN query, function query, etc. Although aggregation queries play a key role in analyzing big data, authenticating aggregation queries has not been extensively studied, and the previous works are not efficient for data with high dimension or a large number of distinct values. In this paper, we propose the AMR-tree that is a data structure, applied to authenticate aggregation queries. We also propose an efficient proof construction method and a verification method with the AMR-tree. Furthermore, we validate the performance of the proposed algorithm by conducting various experiments through changing parameters such as the number of distinct values, the number of records, and the dimension of data.