Video Game Matching System Using Frame-Based User Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional video game matching systems face increased processing time and load when matching users with different job selections, as the server must repeatedly search for users with specific job attributes, leading to inefficiencies in user matching.
Innovation Solution
A video game processing system and program that arranges users with different attributes in frames, prioritizing alternating arrangements to facilitate efficient matching by arranging users in frames corresponding to multiple attributes and matching them based on set conditions, reducing the need for repeated searches.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If the server repeatedly searches for users with specific job attributes to satisfy complicated matching conditions, then the matching accuracy is improved, but the processing time and computational load increase significantly
Solution Approach 1:
The patent applies preliminary action by pre-arranging users into frames based on their attributes (such as job types) before the actual matching process. Users are organized in advance with their attribute information structured and accessible, so that when matching is needed, the server can quickly retrieve and combine pre-arranged frames rather than searching through all user data repeatedly. This preliminary organization significantly reduces the time and computational load during the matching process while maintaining accurate matching based on job attributes.
2Manufacturing precision
If the server repeatedly searches for users with specific job attributes to satisfy complicated matching conditions, then the matching accuracy is improved, but the computational load increases significantly
Solution Approach 1:
The patent applies preliminary action by pre-arranging users into frames based on their attributes (such as job types) before the actual matching process. Users are organized in advance with their attribute information structured and accessible, so that when matching is needed, the server can quickly retrieve and combine pre-arranged frames rather than searching through all user data repeatedly. This preliminary organization significantly reduces the time and computational load during the matching process while maintaining accurate matching based on job attributes.
Solution Approach 2:
The patent applies segmentation by dividing the user pool into separate frames based on attributes (e.g., different job types). Each frame contains users with specific attribute characteristics, allowing the server to work with segmented, organized data rather than a monolithic user list. This segmentation enables efficient retrieval and combination of specific frame groups to satisfy matching conditions, dramatically improving processing efficiency while maintaining matching accuracy.
3Productivity
If users are arranged in frames with multiple attributes prioritizing alternating arrangements, then the matching efficiency is improved, but the system complexity increases
Solution Approach 1:
The patent applies segmentation by dividing the user pool into separate frames based on attributes (e.g., different job types). Each frame contains users with specific attribute characteristics, allowing the server to work with segmented, organized data rather than a monolithic user list. This segmentation enables efficient retrieval and combination of specific frame groups to satisfy matching conditions, dramatically improving processing efficiency while maintaining matching accuracy.
Solution Approach 2:
The patent applies preliminary action by pre-arranging users into frames based on their attributes (such as job types) before the actual matching process. Users are organized in advance with their attribute information structured and accessible, so that when matching is needed, the server can quickly retrieve and combine pre-arranged frames rather than searching through all user data repeatedly. This preliminary organization significantly reduces the time and computational load during the matching process while maintaining accurate matching based on job attributes.
Data Source
AI summary
The present invention allows a processing load for carrying out matching of a plurality of users who satisfy a predetermined condition with each other to be reduced. The user is arranged for every attribute to carry out the matching. The plurality of users thus matched is allowed to play content together. Users with different attributes may alternately stand in a line in which the users are arranged. Further, the users are arranged by inputting a play request for content. Only selection of a condition of the content may be sufficient for the play request.


