Connection Server for Parking Space Location via Two-Stage Query
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for finding parking spaces in urban areas are inefficient, leading to prolonged vehicle searches, increased traffic, and traffic jams, as they often rely on unreliable information and complex reservation systems with high costs.
Innovation Solution
A method involving a connection server that stores data from multiple data servers, allowing for a two-stage query process to preselect and select the most suitable data server based on predefined criteria, using anonymous and detailed feedback data with dynamic correction factors to optimize parking space search, and providing a unified interface for users to access various search providers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a reservation server is used to book parking spaces in advance, then parking space availability can be guaranteed, but device complexity and parking fees increase
Solution Approach 1:
The patent introduces a connection server as an intermediary between the vehicle's terminal and multiple data servers. This connection server manages the complexity of querying multiple parking space data sources, providing a unified interface that simplifies the system architecture while maintaining reliable parking space information through multi-source validation.
Solution Approach 2:
The patent combines multiple data servers storing parking space information into a single queryable system through the connection server. By merging the querying function across multiple data sources, the system achieves reliable parking space availability information without requiring each individual server to be fully complex.
2Reliability
If multiple data servers are queried for parking space information, then information accuracy improves, but data transmission volume and processing time increase
Solution Approach 1:
The patent segments the data retrieval process into two distinct stages: a first query stage that retrieves basic parking space availability information from multiple data servers, and a second query stage that retrieves detailed information only from preselected servers. This segmentation reduces overall data transmission volume while maintaining information accuracy through progressive refinement.
Solution Approach 2:
The patent performs preliminary actions by preselecting data servers based on their response to the first query stage before conducting the second, more detailed query. This preliminary filtering action reduces the number of servers that need to be fully queried, thereby reducing data transmission time while maintaining information accuracy.
3Loss of energy
If a two-stage query process is implemented, then data transmission volume is reduced, but system complexity increases
Solution Approach 1:
The patent implements a dynamic two-stage query process where the system adapts its querying behavior based on the results of the first stage. The connection server dynamically preselects data servers based on initial responses, and the system transitions from a static single-query approach to a dynamic multi-stage approach that optimizes data transmission based on actual server responses.
4Productivity
If GPS information is used to limit search results, then search efficiency improves, but the risk of parking space being occupied increases
Solution Approach 1:
The patent implements feedback mechanisms where the connection server receives and processes responses from multiple data servers, using this feedback to continuously update and refine parking space availability information. This feedback loop allows the system to maintain high search efficiency while reducing the risk of occupied parking spaces by validating information across multiple sources before presenting results to users.
Data Source
AI summary
To find a parking space for a vehicle in a target area, a connection server stores connection data associated with the target area for a plurality of data servers. A search request to find a parking space in the target area is addressed to the connection server. The connection server uses the association data to establish a connection to the data servers and, in the process, queries whether availability data relating to available parking spaces in the target area are stored in the respective database. In a first query stage, the data servers are preselected, in which case first parking space data based on the target area are requested by the connection server and corresponding first feedback data from the data servers are used to respond whether the respective data server contains parking space data relating to the target area. Based on the first feedback data, the connection server decides which of the respective data servers are preselected, and at least one data server is selected as a selection server, and second feedback data, more detailed than the respective first feedback data, are respectively retrieved in a second query stage of the selection server.