CN102567342A - Search information processing method for music playlist - Google Patents
Search information processing method for music playlist Download PDFInfo
- Publication number
- CN102567342A CN102567342A CN2010105921372A CN201010592137A CN102567342A CN 102567342 A CN102567342 A CN 102567342A CN 2010105921372 A CN2010105921372 A CN 2010105921372A CN 201010592137 A CN201010592137 A CN 201010592137A CN 102567342 A CN102567342 A CN 102567342A
- Authority
- CN
- China
- Prior art keywords
- tree
- information
- node
- data
- user
- Prior art date
- Legal status (The legal status 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 status listed.)
- Pending
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to a search information processing method for a music playlist, which includes the steps: 1) initializing a tree structure, and building the tree structure according to the operating sequence of a user; 2) performing stack processing including initializing, popping and pushing operations; 3) enabling a terminal to traverse a whole tree according to information inputted by a user, and inquiring corresponding tree root node pointers; 4) judging whether the same node information is found or not, executing a step 5) if the same node information is found, otherwise, creating new nodes; 5) inquiring a stack space according to node IDs (identities); 6) judging whether data corresponding to the IDs are found in the stack space or not, and executing a step 7) if the data are directly called; 7) sending a request message to a server to acquire the data and executing a step 8); and 8) enabling the acquired data to enter the nodes on the same layer, and enabling the original information of the nodes to exit. Compared with the prior art, the method has the advantages that times for synchronizing with the server are decreased, instantaneity of a system is improved, and the like.
Description
Technical field
The present invention relates to a kind of network data acquisition methods, especially relate to a kind of music walkman search information disposal route.
Background technology
The user is complete works of from the song at main interface, after the member prefecture gets into, shows that the column list interface promptly shows a plurality of sub-columns.Click the new sub-column that shows, can get into the sub-column of next stage, and the like.The user selects a sub-column tabulation to get into contents list, behind contents list UI selection song, gets into the detailed UI of song.
Above said hierarchical categories information obtain and need send a request message to server at every turn; Be kept in the internal memory after receiving response message; Request server once more when the user carries out generic search next time again, response speed is too slow like this, and it is relatively poor that the user operates real-time.
Summary of the invention
The object of the invention is exactly the music walkman search information disposal route that for the defective that overcomes above-mentioned prior art existence the number of times of a kind of minimizing with server sync is provided, has improved the real-time of system.
The object of the invention can be realized through following technical scheme:
A kind of music walkman search information disposal route is characterized in that, may further comprise the steps:
1) initialization tree construction is along with user's sequence of operation achievement structure;
2) stack is handled: comprise initialization, pop, push operation handles;
3) terminal travels through whole tree according to the information of user's input, the tree root node pointer that inquiry is corresponding;
4) judge whether to find identical contact information, if yes, execution in step 5), otherwise, create new node;
5) according to contact ID inquiry stack space;
6) judge the data that whether inquire corresponding ID in the stack space, directly call corresponding data if yes, otherwise carry out 7);
7) send a request message to server, obtain data, and execution in step 8);
8) will obtain the identical layer node that data get into tree, withdraw from simultaneously this node original information.
The nodal information of described tree comprises the most left child node pointer of sensing, points to the right sibling pointer.
Described stack space information comprises tree node ID, network data.
Compared with prior art, the present invention has the following advantages:
When the user selects column information or does not for a long time inquire about this node just can send a request message to server first, reduce the number of times with server sync, improved the efficient and the real-time of system.
Description of drawings
Fig. 1 is a process flow diagram of the present invention;
Fig. 2 is the structural representation of tree of the present invention;
Fig. 3 is a stack architexture synoptic diagram of the present invention;
Fig. 4 is a hardware configuration synoptic diagram of the present invention.
Embodiment
Below in conjunction with accompanying drawing and specific embodiment the present invention is elaborated.
Embodiment
Like Fig. 1, shown in Figure 4, a kind of music walkman search information disposal route may further comprise the steps:
Step 101, initialization tree construction; Sequence of operation achievement structure along with the user; Suppose that user's selecting sequence is following: continent songster → Liu Dehua → lustily water (song title) → song is detailed, and with the root contact of continent songster as tree, all songsters that inquire are as the tree contact; Again with all songs of Liu De China (comprising lustily water) as the 3rd layer that sets, lustily water song details are as the 4th layer;
Step 102, stack are handled: comprise initialization, pop, push operation handles; The sequence of operation shown in the step 101, pop down are the water (song title) of continent songster → Liu Dehua → lustily in proper order, if other song of user inquiring Liu De China then at first will ' lustily water ' tree node be popped the song pop down of user's selection again.Simultaneously can be according to mobile phone terminal memory size scalable tree with lamination stack nodal point number.
Step 103, terminal 1 travel through whole tree according to the information of user's input, the tree root node pointer that inquiry is corresponding;
Step 104, judge whether to find identical contact information, if yes, execution in step 5), otherwise, create new node;
Step 105, according to contact ID inquiry stack space;
Step 106, judge the data that whether inquire corresponding ID in the stack space, directly call corresponding data if yes, otherwise carry out 7);
Step 107, send a request message, obtain data to server 2, and execution in step 8);
Step 108, will obtain the identical layer node that data get into tree, withdraw from simultaneously this node original information.
In order to realize the present invention, need two kinds of data structures of maintenance tree and stack in the system, the node information of tree comprises the most left child node pointer of sensing, points to the right sibling pointer (as shown in Figure 2); Stack essential record user operates node recently several times, and its information comprises node ID, the data message that network data Content obtains from server through network, for example all continent singer name) as shown in Figure 3.
When searching for song information, at first travel through whole tree,, directly from internal memory, obtain, just do not set up a new tree node if do not exist if exist node just need not send a request message to server through the present invention.Since every node details take up room greatlyyer, if all information all are kept at the situation that may occur low memory in the internal memory, have influence on the normal use of terminal phone.Therefore adopt stack architexture to preserve the node information of fixed route length, need carry out push operation when changing node.Whether song search elder generation traverse tree also exists as finding to exist to travel through in the stack after the same node again, just need not carry out synchronously with server if exist, otherwise need push operation.
Claims (3)
1. a music walkman search information disposal route is characterized in that, may further comprise the steps:
1) initialization tree construction is along with user's sequence of operation achievement structure;
2) stack is handled: comprise initialization, pop, push operation handles;
3) terminal travels through whole tree according to the information of user's input, the tree root node pointer that inquiry is corresponding;
4) judge whether to find identical contact information, if yes, execution in step 5), otherwise, create new node;
5) according to contact ID inquiry stack space;
6) judge the data that whether inquire corresponding ID in the stack space, directly call corresponding data if yes, otherwise carry out 7);
7) send a request message to server, obtain data, and execution in step 8);
8) will obtain the identical layer node that data get into tree, withdraw from simultaneously this node original information.
2. a kind of music walkman search information disposal route according to claim 1 is characterized in that, the nodal information of described tree comprises the most left child node pointer of sensing, points to the right sibling pointer.
3. a kind of music walkman search information disposal route according to claim 1 is characterized in that described stack space information comprises tree node ID, network data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105921372A CN102567342A (en) | 2010-12-15 | 2010-12-15 | Search information processing method for music playlist |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105921372A CN102567342A (en) | 2010-12-15 | 2010-12-15 | Search information processing method for music playlist |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102567342A true CN102567342A (en) | 2012-07-11 |
Family
ID=46412782
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010105921372A Pending CN102567342A (en) | 2010-12-15 | 2010-12-15 | Search information processing method for music playlist |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102567342A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103678537B (en) * | 2013-12-02 | 2017-06-20 | 华为技术有限公司 | Metadata amending method, device and node device based on cluster |
-
2010
- 2010-12-15 CN CN2010105921372A patent/CN102567342A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103678537B (en) * | 2013-12-02 | 2017-06-20 | 华为技术有限公司 | Metadata amending method, device and node device based on cluster |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105025319B (en) | A kind of video pushing method and device | |
| CN104077341A (en) | Keyword auto-response mapping relation generation method and device in instant messaging | |
| US10222945B2 (en) | Systems, devices, or methods for accessing information employing a tumbler-style graphical user interface | |
| CN102541452B (en) | Multimedia input method, device and system based on mobile terminal | |
| CN101408877A (en) | System and method for loading tree node | |
| CN103379019B (en) | Information push method and device in microblogging, system | |
| CN101398844A (en) | Resource file searching method and mobile terminal | |
| CN103531218A (en) | Online multimedia file editing method and system | |
| CN104090887A (en) | Music search method and device | |
| CN109597794A (en) | A kind of file management method, system and electronic equipment and storage medium | |
| CN104601672A (en) | Method and device for sharing network resources based on different application clients | |
| CN105893548A (en) | Naming method and terminal | |
| JP2018525717A (en) | Search processing method and device | |
| CN102299966B (en) | Method and device for loading data in large volume at WEB client | |
| CN102799594A (en) | Information push method and device | |
| CN103544036A (en) | Page loading method, terminal and system | |
| WO2014059039A2 (en) | Dynamic speech augmentation of mobile applications | |
| CN111061453B (en) | Voice interaction method and device for APP ecosystem | |
| CN102567342A (en) | Search information processing method for music playlist | |
| CN103177038A (en) | Query expression in vertical search engine | |
| CN101650738A (en) | Omnidirectional intelligent search method for Kara OK songs | |
| CN104394125B (en) | A kind of mobile device shares the method and mobile device of multimedia file | |
| CN102223405A (en) | Media type analyzing method, system and media server | |
| CN103838774A (en) | Webpage inquiring system and inquiring method thereof | |
| CN104994169A (en) | Floor-sweeping robot state information query method and server |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20120711 |