• Title/Summary/Keyword: Query Index

Search Result 411, Processing Time 0.023 seconds

Applying Hebbian Theory to Enhance Search Performance in Unstructured Social-Like Peer-to-Peer Networks

  • Huang, Chester S.J.;Yang, Stephen J.H.;Su, Addison Y.S.
    • ETRI Journal
    • /
    • v.34 no.4
    • /
    • pp.591-601
    • /
    • 2012
  • Unstructured peer-to-peer (p2p) networks usually employ flooding search algorithms to locate resources. However, these algorithms often require a large storage overhead or generate massive network traffic. To address this issue, previous researchers explored the possibility of building efficient p2p networks by clustering peers into communities based on their social relationships, creating social-like p2p networks. This study proposes a social relationship p2p network that uses a measure based on Hebbian theory to create a social relation weight. The contribution of the study is twofold. First, using the social relation weight, the query peer stores and searches for the appropriate response peers in social-like p2p networks. Second, this study designs a novel knowledge index mechanism that dynamically adapts social relationship p2p networks. The results show that the proposed social relationship p2p network improves search performance significantly, compared with existing approaches.

Investment Strategies for KOSPI Index Using Big Data Trends of Financial Market (금융시장의 빅데이터 트렌드를 이용한 주가지수 투자 전략)

  • Shin, Hyun Joon;Ra, Hyunwoo
    • Korean Management Science Review
    • /
    • v.32 no.3
    • /
    • pp.91-103
    • /
    • 2015
  • This study recognizes that there is a correlation between the movement of the financial market and the sentimental changes of the public participating directly or indirectly in the market, and applies the relationship to investment strategies for stock market. The concerns that market participants have about the economy can be transformed to the search terms that internet users query on search engines, and search volume of a specific term over time can be understood as the economic trend of big data. Under the hypothesis that the time when the economic concerns start increasing precedes the decline in the stock market price and vice versa, this study proposes three investment strategies using casuality between price of domestic stock market and search volume from Naver trends, and verifies the hypothesis. The computational results illustrate the potential that combining extensive behavioral data sets offers for a better understanding of collective human behavior in domestic stock market.

A Study on Representative Skyline Using Connected Component Clustering

  • Choi, Jong-Hyeok;Nasridinov, Aziz
    • Journal of Multimedia Information System
    • /
    • v.6 no.1
    • /
    • pp.37-42
    • /
    • 2019
  • Skyline queries are used in a variety of fields to make optimal decisions. However, as the volume of data and the dimension of the data increase, the number of skyline points increases with the amount of time it takes to discover them. Mainly, because the number of skylines is essential in many real-life applications, various studies have been proposed. However, previous researches have used the k-parameter methods such as top-k and k-means to discover representative skyline points (RSPs) from entire skyline point set, resulting in high query response time and reduced representativeness due to k dependency. To solve this problem, we propose a new Connected Component Clustering based Representative Skyline Query (3CRS) that can discover RSP quickly even in high-dimensional data through connected component clustering. 3CRS performs fast discovery and clustering of skylines through hash indexes and connected components and selects RSPs from each cluster. This paper proves the superiority of the proposed method by comparing it with representative skyline queries using k-means and DBSCAN with the real-world dataset.

Design and Implementation of a Boundary Matching System Supporting Partial Denoising for Large Image Databases

  • Kim, Bum-Soo;Kim, Jin-Uk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.5
    • /
    • pp.35-40
    • /
    • 2019
  • In this paper, we design and implement a partial denoising boundary matching system using indexing techniques. Converting boundary images to time-series makes it feasible to perform a fast search using indexes even on a very large image database. Thus, using this converting method we develop a client-server system based on the previous partial denoising research in the GUI(graphical user interface) environment. The client first converts a query image given by a user to a time-series and sends denoising parameters and the tolerance with this time-series to the server. The server identifies similar images from the index by evaluating a range query, which is constructed using inputs given from the client and sends the resulting images to the client. Experimental results show that our system provides many intuitive and accurate matching results.

A Study on the Content Utilization of KISTI Science and Technology Information Service (KISTI 과학기술정보서비스의 콘텐츠 활용 분석)

  • Kang, Nam-Gyu;Hwang, Mi-Nyeong
    • Journal of Internet Computing and Services
    • /
    • v.21 no.4
    • /
    • pp.87-95
    • /
    • 2020
  • The Science and Technology Information Service provided by the Korea Institute of Science and Technology Information (KISTI) is a service designed to allow users to easily and conveniently search and view content that is built similar to the general information service. NDSL is KISTI's core science, technology and information service, providing about 138 million content and having about 93 million page views in a year of 2019. In this paper, various insights were derived through the analysis of how science and technology information such as academic papers, reports and patents provided by NDSL is searched and utilized through web services (https://www.ndsl.kr) and search query words. In addition to general statistics such as the status of content construction, utilization status and utilization methods by type of content, monthly/weekly/time-of-day content usage, content view rate per one-time search by content type, the comparison of the use status of academic papers by year, the relationship between the utilization of domestic academic papers and the KCI index we analyzed the usability of each content type, such as academic papers and patents. We analyzed query words such as the language form of query words, the number of words of query words, and the relationship between query words and timeliness by content type. Based on the results of these analyses, we would like to propose ways to improve the service. We suggest that NDSL improvements include ways to dynamically reflect the results of content utilization behavior in the search results rankings, to extend query and to establish profile information through non-login user identification for targeted services.

An Efficient Split Algorithm to Minimize the Overlap between Node Index Spaces in a Multi-dimensional Indexing Scheme M-tree (다차원 색인구조 M-트리에서 노드 색인 공간의 중첩을 최소화하기 위한 효율적인 분할 알고리즘)

  • Im Sang-hyuk;Ku Kyong-I;Kim Ki-chang;Kim Yoo-Sung
    • The KIPS Transactions:PartD
    • /
    • v.12D no.2 s.98
    • /
    • pp.233-246
    • /
    • 2005
  • To enhance the user response time of content-based retrieval service for multimedia information, several multi-dimensional index schemes have been proposed. M-tree, a well-known multidimensional index scheme is of metric space access method, and is based on the distance between objects in the metric space. However, since the overlap between index spaces of nodes might enlarge the number of nodes of M-tree accessed for query processing, the user response time for content-based multimedia information retrieval grows longer. In this paper, we propose a node split algorithm which is able to reduce the sire of overlap between index spaces of nodes in M-tree. In the proposed scheme, we choose a virtual center point as the routing object and entry redistribution as the postprocessing after node split in order to reduce the radius of index space of a node, and finally in order to reduce the overlap between the index spaces of routing nodes. From the experimental results, we can see the proposed split algorithm reduce the overlap between index space of nodes and finally enhance the user response time for similarity-based query processing.

SQMR-tree: An Efficient Hybrid Index Structure for Large Spatial Data (SQMR-tree: 대용량 공간 데이타를 위한 효율적인 하이브리드 인덱스 구조)

  • Shin, In-Su;Kim, Joung-Joon;Kang, Hong-Koo;Han, Ki-Joon
    • Spatial Information Research
    • /
    • v.19 no.4
    • /
    • pp.45-54
    • /
    • 2011
  • In this paper, we propose a hybrid index structure, called the SQMR-tree(Spatial Quad MR-tree) that can process spatial data efficiently by combining advantages of the MR-tree and the SQR-tree. The MR-tree is an extended R-tree using a mapping tree to access directly to leaf nodes of the R-tree and the SQR-tree is a combination of the SQ-tree(Spatial Quad-tree) which is an extended Quad-tree to process spatial objects with non-zero area and the R-tree which actually stores spatial objects and are associated with each leaf node of the SQ-tree. The SQMR-tree consists of the SQR-tree as the base structure and the mapping trees associated with each R-tree of the SQR-tree. Therefore, because spatial objects are distributedly inserted into several R-trees and only R-trees intersected with the query area are accessed to process spatial queries like the SQR-tree, the query processing cost of the SQMR-tree can be reduced. Moreover, the search performance of the SQMR-tree is improved by using the mapping trees to access directly to leaf nodes of the R-tree without tree traversal like the MR-tree. Finally, we proved superiority of the SQMR-tree through experiments.

The Scalability and the Strategy for EMR Database Encryption Techniques

  • Shin, David;Sahama, Tony;Kim, Steve Jung-Tae;Kim, Ji-Hong
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.5
    • /
    • pp.577-582
    • /
    • 2011
  • EMR(Electronic Medical Record) is an emerging technology that is highly-blended between non-IT and IT area. One of methodology to link non-IT and IT area is to construct databases. Nowadays, it supports before and after-treatment for patients and should satisfy all stakeholders such as practitioners, nurses, researchers, administrators and financial department and so on. In accordance with the database maintenance, DAS (Data as Service) model is one solution for outsourcing. However, there are some scalability and strategy issues when we need to plan to use DAS model properly. We constructed three kinds of databases such as plain-text, MS built-in encryption which is in-house model and custom AES (Advanced Encryption Standard) - DAS model scaling from 5K to 2560K records. To perform custom AES-DAS better, we also devised Bucket Index using Bloom Filter. The simulation showed the response times arithmetically increased in the beginning but after a certain threshold, exponentially increased in the end. In conclusion, if the database model is close to in-house model, then vendor technology is a good way to perform and get query response times in a consistent manner. If the model is DAS model, it is easy to outsource the database, however, some technique like Bucket Index enhances its utilization. To get faster query response times, designing database such as consideration of the field type is also important. This study suggests cloud computing would be a next DAS model to satisfy the scalability and the security issues.

Query Processing using Partial Indexs based on Hierarchy in Sensor Networks (센서 네트워크에서 계층기반 부분 인덱스를 이용한 질의처리)

  • Kim, Sung-Suk;Yang, Sun-Ok
    • Journal of KIISE:Databases
    • /
    • v.35 no.3
    • /
    • pp.208-217
    • /
    • 2008
  • Sensors have a function to gather environment-related information operating by small-size battery in sensor networks. The issue related with energy is still an important in spite of the recent advancements in micro-electro-mechanical-system(MEMS) related techology. Generally it is assumed that replacement or rechargement of battery power in sensor is not feasible and a message send operation may spend at least 1000 times battery than a local operation. Thus, there have been several kinds of research efforts to lessen the number of unnecessary messages by maintaining the information of the other neighboring(or all) sensors. In this paper, we propose an index structure based on parent-children relationship to the purpose. Namely, parent node gathers the set of location information and MBA per child. It's named PH and may allow to process the range query with higher accurate and small size information. Through extensive experiments, we show that our index structure has better energy consumption.

Efficient 3D Model Retrieval using Discriminant Analysis (판별분석을 이용한 효율적인 3차원 모델 검색)

  • Song, Ju-Whan;Choi, Seong-Hee;Gwun, Ou-Bong
    • 전자공학회논문지 IE
    • /
    • v.45 no.2
    • /
    • pp.34-39
    • /
    • 2008
  • This study established the efficient system that retrieves the 3D model by using a statistical technique called the function of discriminant analysis. This method was suggested to search index, which was formed by the statistics of 128 feature vectors including those scope, minimum value, average, standard deviation, skewness and scale. All of these were sampled with Osada's D2 method and the statistics as a factor effecting a change turned the value of discriminant analytic function into that of index. Through the primary retrieval on the model of query, the class above the top 2% was drawn out by comparing the query with the index of previously saved class from the group of same models. This method was proved an efficient retrieval technique that saved its procedural time. It shortened the retrieval time for 3D model by 57% faster than the existing Osada's method, and the precision that similar models were found in the first place was recorded 0.362, which revealed it more efficient by 44.8%.