CN108416000A - Method for exhibiting data, device, equipment and storage medium - Google Patents
Method for exhibiting data, device, equipment and storage medium Download PDFInfo
- Publication number
- CN108416000A CN108416000A CN201810161448.XA CN201810161448A CN108416000A CN 108416000 A CN108416000 A CN 108416000A CN 201810161448 A CN201810161448 A CN 201810161448A CN 108416000 A CN108416000 A CN 108416000A
- Authority
- CN
- China
- Prior art keywords
- data
- acquisition system
- data acquisition
- buffering area
- node
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/248—Presentation of query results
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
- G06F16/24534—Query rewriting; Transformation
- G06F16/24539—Query rewriting; Transformation using cached or materialised query results
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses a kind of method for exhibiting data, device, equipment and storage mediums, wherein the method includes:Determine position of the current display area in data acquisition system to be presented on the page, wherein the data acquisition system is stored in persistent storage layer;Buffered data deposit buffering area is read from persistent storage layer according to the position, wherein, the buffering area is corresponding with the data acquisition system and pre-establishes in memory, and the buffered data includes the position and its adjacent position corresponding data in the data acquisition system;From reading the position corresponding data in the data acquisition system in the buffering area, and show on the page.The embodiment of the present invention realizes the displaying of big data quantity under the conditions of limited amount of ram, and is not restricted by data access speed.
Description
Technical field
The present invention relates to field of computer technology more particularly to a kind of method for exhibiting data, device, equipment and storage to be situated between
Matter.
Background technology
List and electrical form are common software data visualization schemes, by data according to row, column form with
It is presented to user on family interface (UI).When the data for needing to show are more, the mode side of paging or scroll bar is usually taken
Just user browses.In contrast, data decimation and the change for taking the mode of scroll bar that user can be allowed to be carried out at the same time multirow, than
Paging mode has better interactive experience.
Currently, when taking the mode display data of scroll bar, mainly there are following two schemes:1) data to be presented are complete
Portion stores in memory, directly reads the data currently to be shown from memory according to the scrolling position of scroll bar, is improved with this
The speed of showing interface when scroll bar rolls;2) data to be presented are stored entirely in the medium of persistence, it is such as local hard
File or remote database on disk etc., when user drags scroll bar, being pulled from persistence medium immediately will currently open up
The data shown are put in memory, so that UI elements are shown.
But there are still certain defects for both schemes.For the first scheme, since the use of memory is with total amount of data
It is directly proportional, and when data volume is larger, such as the other data of up to a million or even millions, at this point, free memory amount can become is
The bottleneck of system then causes the interim card of software, or even collapse;For second scheme, due to by local disk, network connection
Or the restriction of server performance, the access speed of persistence medium are far below the access speed of memory, are caused to user experience
It influences.
Invention content
An embodiment of the present invention provides a kind of method for exhibiting data, device, equipment and storage mediums, to solve the prior art
In the displaying of big data quantity can not be realized under the conditions of limited amount of ram, and at the same time the skill not restricted by data access speed
Art problem.
In a first aspect, an embodiment of the present invention provides a kind of method for exhibiting data, including:
Determine position of the current display area in data acquisition system to be presented on the page, wherein the data acquisition system is deposited
Storage is in persistent storage layer;
Buffered data deposit buffering area is read from persistent storage layer according to the position, wherein the buffering area with
The data acquisition system is corresponding and pre-establishes in memory, and the buffered data includes that the position and its adjacent position exist
Corresponding data in the data acquisition system;
From reading the position corresponding data in the data acquisition system in the buffering area, and open up on the page
Show.
Second aspect, the embodiment of the present invention additionally provide a kind of data displaying device, including:
Locating module, for determining position of the current display area in data acquisition system to be presented on the page, wherein institute
It states data acquisition system and is stored in persistent storage layer;
Cache module, for reading buffered data deposit buffering area from persistent storage layer according to the position, wherein
The buffering area is corresponding with the data acquisition system and pre-establishes in memory, the buffered data include the position and
Its adjacent position corresponding data in the data acquisition system;
Display module is read, for from reading the position corresponding number in the data acquisition system in the buffering area
According to, and show on the page.
The third aspect, the embodiment of the present invention additionally provide a kind of computer equipment, including:
One or more processors;
Storage device, for storing one or more programs,
When one or more of programs are executed by one or more of processors so that one or more of processing
Device realizes the method for exhibiting data as described in any embodiment of the present invention.
Fourth aspect, the embodiment of the present invention additionally provide a kind of computer readable storage medium, are stored thereon with computer
Program realizes the method for exhibiting data as described in any embodiment of the present invention when the program is executed by processor.
Method for exhibiting data, device, equipment and storage medium provided in an embodiment of the present invention, it is current on the page by determining
Position of the display area in data acquisition system to be presented is read buffered data from persistent storage layer according to the position and is deposited
Enter in the buffering area established in memory in advance, and buffered data includes the position and its adjacent position in the data
Corresponding data namely the range of buffered data are greater than the range of the corresponding data of display area in set, it is possible to from
The position corresponding data in data acquisition system are directly read in buffering area, and are shown on the page, when the position
Change when needing to update the data, if the corresponding data in position after variation without departing from the range of buffered data, still
It can be directly read from buffering area, without reading data repeatedly from persistent storage layer.It may be implemented in as a result, in limited
The displaying of big data quantity is realized under the conditions of storage, and is not restricted by data access speed.
Description of the drawings
Fig. 1 a are the flow diagrams for the method for exhibiting data that the embodiment of the present invention one provides;
Fig. 1 b are the signals that the data that the embodiment of the present invention one provides store in cache layer and pass through binary tree inquiry data
Property schematic diagram;
Fig. 2 is the flow diagram of method for exhibiting data provided by Embodiment 2 of the present invention;
Fig. 3 is the flow diagram for the method for exhibiting data that the embodiment of the present invention three provides;
Fig. 4 is the flow diagram for the method for exhibiting data that the embodiment of the present invention four provides;
Fig. 5 is the structural schematic diagram for the data displaying device that the embodiment of the present invention five provides;
Fig. 6 is the structure chart for the computer equipment that the embodiment of the present invention six provides.
Specific implementation mode
The present invention is described in further detail with reference to the accompanying drawings and examples.It is understood that this place is retouched
The specific embodiment stated is used only for explaining the present invention rather than limitation of the invention.It also should be noted that in order to just
Only the parts related to the present invention are shown in description, attached drawing rather than entire infrastructure.
Embodiment one
Fig. 1 a are the flow charts for the method for exhibiting data that the embodiment of the present invention one provides, and the present embodiment is applicable to data row
The case where table display data, this method can show device to execute by data, and can be integrated in computer equipment.Wherein,
The method includes:
S110, position of the current display area in data acquisition system to be presented on the page is determined, wherein the data set
Conjunction is stored in persistent storage layer.
Wherein, the page is user interface (UI), usually may include screening control and list control, wherein screening control
Part for determining querying condition input by user, so as to described device filtered out from persistent storage layer according to querying condition with
Corresponding data acquisition system to be presented, and determine the data acquisition system entry number.List control may include data show area and
Scroll control, scroll control for example can be scroll bars, and user is presented in data exhibition by adjusting the position of scroll bar to adjust
Show the data entry in area, and position of the current display area in the data acquisition system can be according to scroll bar in data exhibition on the page
Show the entry number of the position in area, the size of data show area and data acquisition system to determine.Illustratively, user's looking by input
The data to be presented that inquiry condition is determined from persistent storage layer totally 660 as a result, the maximum data that data show area can be shown
Entry number is 26, according to scroll control in the position of data show area, determines current presentation region in the data acquisition system
Position be all 660 articles of results in 50-75 datas corresponding to position.
S120, buffered data deposit buffering area is read from persistent storage layer according to the position, wherein the buffering
Area is corresponding with the data acquisition system and pre-establishes in memory, and the buffered data includes the position and its adjacent bit
Set the corresponding data in the data acquisition system.
Specifically, according to the corresponding data of location determination of the current presentation region in the data acquisition system, upper
It is 50-75 datas in the example in face, and after the partial data and the 75th data before the data and the 50th data
The partial data in face can be used as the buffered data deposit buffering area together namely the data area of buffered data is greater than currently
The corresponding data area of display area.Therefore, when the position, which changes, to be needed to update the data, especially user continuously adjusts
When the position of whole scroll bar, if the corresponding data in position after variation without departing from the range of buffered data, still can be from
It is directly read in buffering area, without reading data repeatedly from persistent storage layer, to reduce by data access speed
It restricts.For in buffered data exceed current presentation region corresponding data range size, can according to actual memory size with
And the number of data flexibly determines that the application does not do this any restriction in data acquisition system.
It, therefore, in memory can be with further, since may need to carry out the inquiry of multiple different condition in view of user
Pre-establish multiple buffering area, each buffering area is respectively used to storage according to some querying condition input by user from persistence
The data acquisition system to be presented determined in accumulation layer.Then, it when user toggles between different querying conditions, is not necessarily to
Switching all reads corresponding data from persistent storage layer every time, directly can read number from buffering area corresponding with querying condition
According to improve efficiency.
Preferably, buffered data is stored as fixed length array in the buffer.And one section can be opened up admittedly using fixed length array
Fixed memory can destroy the performance cost brought of fritter memory dedicated for caching to avoid frequently opening up.Specifically, the fixed length
Array may include M data block, wherein each data data in the block include different page presentation region in data acquisition system
Position and its adjacent position corresponding data in data acquisition system, and it is nature that the length of each data block, which is N, M and N,
Number.
Because N determines the range size for exceeding current presentation region corresponding data in buffered data, therefore, as one kind
It is preferred that three times of the length N of data block at least more than the maximum data entry number that display area in the page can be shown.And N is got over
Greatly, then it represents that the data that can be read from persistence memory in advance are more, then after can better assuring that scroll bar variation
The corresponding data in position without departing from buffered data range, so as to directly from memory read data be shown.
The application does not do any restriction to the number of data block and the length of data block.
Preferably, when user frequently carries out scroll bar drag operation, in order to reduce integral operation amount, acceleration search,
Balanced binary tree has been also set up in the buffer, and node is directed toward corresponding data block in fixed length array by pointer.Balance two
Fork tree can be used for whether current display area corresponding data in the data acquisition system on searched page hit buffering area, specifically
For, if there are a nodes in balanced binary tree, and current presentation region is stored described in the data block of node direction
Corresponding data in data acquisition system then illustrate that hit buffering area therefore can be by way of the search node in balanced binary tree
To determine whether to hit buffering area.
Further, the number M of node total number with data block of balanced binary tree is identical, and each node is deposited by it
The mark value of storage is come position of the data block in data acquisition system that marks the node to be directed toward, wherein data acquisition system is also according to length
It is divided for the data block of N.
Illustratively, as shown in Figure 1 b, in data persistence layer, data acquisition system is divided according to data block, and is fixed length N, such as
Data block [70000-70999], data block [100000-100999], fixed length N are 1000 rows, in corresponding data set
1000 datas.Length is identical therewith by data block 01-05 in buffering area in fixed length array.Wherein, 01,03 and 05 data block has been
There are buffered data, 02 and 04 data block there is no buffered data.Three nodes in balanced binary tree, Mei Gejie are also shown in figure
Point is directed toward the data block in fixed length array by pointer, such as node 2 is directed toward data block 01, and node 1 is directed toward data block 03.Node
The value of middle storage i is the mark value, such as i is 70 in node 2, then the data block that node 2 is directed toward is in data acquisition system
In position be just 70, corresponding [70000-70999] this one piece of data, and so on.And mark value is for marking the node
Position of the data block of direction in data acquisition system, therefore, when current presentation on the page of the location determination according to scroll bar
Position of the region in data acquisition system to be presented then can determine that current presentation region is being waited for by the mark value in node
Whether corresponding data hit buffering area in the data acquisition system of displaying.
What needs to be explained here is that the number of data block in fixed length array shown in Fig. 1 b, the fixed length of data block and
The number etc. of balanced binary tree interior joint, only a kind of example, the application any restriction is not done to this, can be according to memory
The actual conditions flexible configuration such as quantity of data in size and data acquisition system.
S130, from reading the position corresponding data in the data acquisition system in the buffering area, and in the page
It is shown on face.
Specifically, reading the corresponding data in current presentation region directly from the buffering area of memory, pass through user interface
(UI) user is showed.
In the present embodiment, it by establishing buffering area in memory in advance, and is being waited for according to current display area on the page
Buffered data deposit buffering area is read in position in the data acquisition system of displaying from data persistence layer, and buffered data includes institute
Rheme is set and its adjacent position corresponding data namely range of buffered data in the data acquisition system are greater than display area
The range of corresponding data, it is possible to from the position corresponding data in data acquisition system are directly read in buffering area, and
It shows on the page, when the position, which changes, to be needed to update the data, if the corresponding data in position after variation do not have
There is the range beyond buffered data, then still can be directly read from buffering area, without being read repeatedly from persistent storage layer
Access evidence.It may be implemented in as a result, under the conditions of limited amount of ram and realize the displaying of big data quantity, and not by data access speed
It restricts.
Embodiment two
Fig. 2 is the flow diagram of method for exhibiting data provided by Embodiment 2 of the present invention.The present embodiment is in above-mentioned reality
On the basis of applying example, in S130 " from reading the position corresponding data in the data acquisition system in the buffering area, and
Show on the page " after, this method is further optimized, specifically, as shown in Fig. 2, this method further includes:
S210, current update position of the display area in data acquisition system on the updated rear page is obtained.
On a user interface, user can by control scroll control (such as scroll bar) can the exhibition of real-time update display area institute
The data shown.Therefore need first to determine scroll control after rolling in the scrolling position of data show area, so as to according to the rolling
Update position of the updated current presentation region in corresponding data acquisition system on the location determination page.
S220, according to the updated current presentation region of update location determination in the data acquisition system it is corresponding more
New data.
The buffered data for whether hitting buffering area is updated the data described in S230, judgement, if so, executing S240, is otherwise held
Row S250.
S240, read from the buffering area described in update the data and shown on the page.
When hit buffer area, then can directly be shown on the page from reading update data in buffering area, without according to rolling
Data are read in the rolling of dynamic item from data persistence layer repeatedly, to improve processing speed.
S250, according to the buffered data described in the update location updating in buffering area, and from the updated buffering
It updates the data described in being read in area and is shown on the page, wherein updated buffered data includes from persistent storage layer
The update position and its adjacent position corresponding data in the data acquisition system read.
If miss buffering area, illustrate to need to resume studies from data persistence layer relaying to take new data, more using the new data
Buffered data in new buffering area.
Preferably, the buffered data according in buffering area described in the update location updating, including:
If the buffering area is less than, the update position and its adjacent bit is written in the remaining space of the buffering area
Set the corresponding data in the data acquisition system;
If the buffering area has been expired, according to position of the buffered data in buffering area in the data acquisition system, by this
Position meets the sky where the buffered data of pre-determined distance difference condition with the position updated the data in the data acquisition system
Between discharge, and the update position and its adjacent position corresponding number in the data acquisition system is written in the space after release
According to.
Wherein, it is farthest to be preferably the position that distance updates the data in data acquisition system for the pre-determined distance difference condition.And position
It is that user reviews the minimum data of possibility in buffering area to set farthest data, it is therefore preferable that the space where the data is released
It puts, to be stored in new data.Certainly, therefore which sky user, specifically discharges to the control of scroll bar without foresight
Between can not be configured previously according to the intention of user, the present embodiment is merely given as a kind of preferred implementation, is made not to this
Any restriction.
In the present embodiment, determine that current display area is being inquired on the page after updating by the scrolling position of scroll control
Update position in result data set, and according to the updated current presentation region of the update location determination in query result number
It is updated the data according to corresponding in set.If judging, there are this to update the data in buffering area, directly reads displaying, if being not present,
Then by judging the state of buffering area, this is updated the data and is cached to buffering area.It is rolled in real time by responding scroll control as a result,
Updating the data on update corresponding position, realizes the real-time exhibition of big data quantity under the conditions of limited memory amount, and is not counted
It is restricted according to access speed.
Embodiment three
Fig. 3 is the flow diagram for the method for exhibiting data that the embodiment of the present invention three provides.The present embodiment is in above-mentioned implementation
It is optimized on the basis of example, in the present embodiment, will " buffered data for hitting the buffering area is updated the data if described,
Update the data described in then being read from the buffering area and show on the page ", specifically it is optimized for:
Corresponding node is searched in balanced binary tree according to the update position;
If there is node corresponding with the update position in balanced binary tree, from the data block that the node is directed toward
The update position corresponding update the data in the data acquisition system is pulled to show on the page.
Correspondingly, the method for exhibiting data that the present embodiment is provided, specifically includes:
S310, current update position of the display area in data acquisition system on the updated rear page is obtained.
S320, according to the updated current presentation region of update location determination in the data acquisition system it is corresponding more
New data.
S330, corresponding node is searched in balanced binary tree according to the update position.
If there is node corresponding with the update position in S340, balanced binary tree, from the number of node direction
It is shown on the page according to the update position corresponding update the data in the data acquisition system is pulled in block.
Specifically, the node of balanced binary tree marks the data block that the node is directed toward in institute by the mark value of its storage
State the position in data acquisition system.Therefore, corresponding node is searched in balanced binary tree according to the update position.For example, false
If depending on the user's operation, the position that updates is corresponding when being [j, j+l] this segment data in data acquisition system, wherein j is by rolling
What the position of dynamic item determined, l is the number of data that the show area forms on the page can be shown.So, start=is calculated first
The value of j/N, end=(j+l)/N that is to say which data block the head and the tail of the data in the section judgement [j, j+l] fall in, then flat
Search whether there is node corresponding with start, end according to the mark value in weighing apparatus binary tree.If there is the node, then table
Show that the data in the section [j, j+l] are fallen in the data block that the node is directed toward, is then directly drawn from the data block that the node is directed toward
The update position corresponding update the data in the data acquisition system is taken to show on the page.If start and end
It respectively falls in two data blocks that two nodes are respectively directed to, then the pulling data from two data blocks.
As a preferred embodiment, the data block can also include borderline region, which includes the block for having fixed length
Head and block tail;
Correspondingly, in the data block being directed toward from node when pulling data, the method further includes:
Judge the boundary of current presentation region corresponding data and data block in fixed length array where it in data acquisition system
Whether the data in region have intersection;
If there is intersection, by the number adjacent with data block of the current presentation region in data acquisition system where corresponding data
It is read from persistent storage layer according to the data of block, and is stored in the data block not being filled in fixed length array.
Specifically, as shown in Fig. 2, 05-1 is the build of data block 05,05-2 is the block tail of data block 05, if updating the data
There is intersection with the data of the borderline region of data block, user continues to roll scroll bar if indicating, current presentation region is in data set
Corresponding data cannot hit the possibility of caching and be gradually increased in conjunction, then read and update the data institute from persistent storage layer
The adjacent data block of data block data, and be stored in be not filled in fixed length array data block (it is illustrative, can fill out
It is charged to data block 02 as shown in Figure 2 or data block 04), it thus can ensure that the continuity of data displaying.
Whether the present embodiment hits caching by searching corresponding node in balanced binary tree to judge to update the data, and
When there are corresponding node, it is corresponding in the data acquisition system that the update position is pulled from the data block that the node is directed toward
Update the data and show on the page, be achieved in quick lookup, especially pull behaviour when user frequently carries out scroll bar
When making, it is possible to reduce integral operation amount.In addition, the borderline region by the way that data block is arranged, and by judging current presentation region
Whether corresponding data and the data of the borderline region of data block in fixed length array where it have intersection in data acquisition system, to determine
It is fixed whether to need to read new data to caching, so that it is guaranteed that the continuity of data displaying from data persistence layer in advance.
Example IV
Fig. 4 is the flow diagram for the method for exhibiting data that the embodiment of the present invention four provides.The present embodiment is in above-mentioned implementation
It is optimized on the basis of example, it in the present embodiment, will be " if the buffer number for updating the data buffering area described in miss
According to then according to the buffered data described in the update location updating in buffering area, and being read from the updated buffering area
Described update the data shows on the page ", specifically it is optimized for:
Corresponding node is searched in balanced binary tree according to the update position;
If node corresponding with the update position is not present in balanced binary tree, section is increased newly in balanced binary tree
Point;
From reading the update position corresponding data update in the block in the data acquisition system in persistent storage layer
Data are stored in the data block not being filled in the fixed length array;
Update pointer makes the newly-increased node be directed toward the data block, and is drawn from the data block that the newly-increased node is directed toward
The update position corresponding update the data in the data acquisition system is taken to show on the page.
Correspondingly, the method for exhibiting data that the present embodiment is provided, specifically includes:
S410, current update position of the display area in data acquisition system on the updated rear page is obtained.
S420, according to the updated current presentation region of update location determination in the data acquisition system it is corresponding more
New data.
S430, corresponding node is searched in balanced binary tree according to the update position.
If node corresponding with the update position is not present in S440, balanced binary tree, in balanced binary tree
Newly-increased node.
S450, from being read in persistent storage layer, the update position corresponding data in the data acquisition system are in the block
Update the data the data block for being stored in and not being filled in the fixed length array.
S460, update pointer make the newly-increased node be directed toward the data block, and the data being directed toward from the newly-increased node
The update position corresponding update the data in the data acquisition system is pulled in block to show on the page.
If specifically, searching less than corresponding node, illustrate that there is no update position is right in data acquisition system in buffering area
The data block answered, therefore, it is necessary to be read from data persistence layer, the data block being not yet filled in filling to fixed length array, and
Increase the node for being directed toward the data block in balanced binary tree newly.
Further, since the number of data block is limited in fixed length array, therefore, as a preferred embodiment, in balance two
Before increasing node newly in fork tree, if the number for having node in balanced binary tree is M, the method further includes:
It is determined and position lie farthest away of the current presentation region in the data acquisition system according to the mark value of each node
Node;
The data block deleted the node of the lie farthest away, and be directed toward is labeled as expired, wherein is labeled as expired number
Data can be refilled according to block.
Wherein, if the number for having node in balanced binary tree is M, illustrate not filled out not yet in fixed length array
The data block filled, therefore, it is necessary to be determined with current presentation region in the data acquisition system according to the mark value of each node
The node of position lie farthest away, and the data block deleted the node of the lie farthest away, and be directed toward is labeled as expired, wherein
Data can be refilled labeled as expired data block.Thus assure that the continuity of data displaying.
Whether the present embodiment hits caching by searching corresponding node in balanced binary tree to judge to update the data, and
When there is no corresponding node, node is increased newly, and from reading update data deposit fixed length array in persistent storage layer not
The data block being filled is achieved in quick lookup, especially when user frequently carries out scroll bar drag operation, it is possible to reduce
Integral operation amount.In addition, when the node in balanced binary tree has been expired, by deleting with current presentation region in data acquisition system
Position lie farthest away node, with ensure data displaying continuity.
Embodiment five
Fig. 5 is the structural schematic diagram for the data displaying device that the embodiment of the present invention five provides, as shown in figure 5, described device
Including:
Locating module 510, for determining position of the current display area in data acquisition system to be presented on the page,
In, the data acquisition system is stored in persistent storage layer;
Cache module 520, for buffered data deposit buffering area to be read from persistent storage layer according to the position,
In, the buffering area is corresponding with the data acquisition system and pre-establishes in memory, and the buffered data includes institute's rheme
It sets and its adjacent position corresponding data in the data acquisition system;
Display module 530 is read, for corresponding in the data acquisition system from the position is read in the buffering area
Data, and show on the page.
In the present embodiment, it by establishing buffering area in memory in advance, and is being waited for according to current display area on the page
Buffered data deposit buffering area is read in position in the data acquisition system of displaying from data persistence layer, and buffered data includes institute
Rheme is set and its adjacent position corresponding data namely range of buffered data in the data acquisition system are greater than display area
The range of corresponding data, it is possible to from the position corresponding data in data acquisition system are directly read in buffering area, and
It shows on the page, when the position, which changes, to be needed to update the data, if the corresponding data in position after variation do not have
There is the range beyond buffered data, then still can be directly read from buffering area, without being read repeatedly from persistent storage layer
Access evidence.It may be implemented in as a result, under the conditions of limited amount of ram and realize the displaying of big data quantity, and not by data access speed
It restricts.
Preferably, the buffered data is stored as fixed length array in the buffer, which includes M data block,
Each data data in the block include that the position and its adjacent position of different page presentation region in the data acquisition system exist
Corresponding data in the data acquisition system, and the length of each data block is N, wherein M and N is natural number.
Preferably, being established in the buffering area has balanced binary tree, and node is directed toward corresponding in fixed length array by pointer
Data block, the balanced binary tree is for current display area corresponding data in the data acquisition system on searched page
No hit buffering area.
Preferably, the number M of node total number with data block of the balanced binary tree is identical, and each node passes through it
The mark value of storage is come position of the data block in the data acquisition system that marks the node to be directed toward, wherein the data acquisition system
It is divided according to the data block that length is N.
Preferably, described device further includes:
Update position acquisition module, for obtain be updated over after on the page current display area in the data acquisition system
In update position;
Determining module is updated the data, is used for according to the updated current presentation region of update location determination in the number
It is updated the data according to corresponding in set;
Processing module is hit, if hit the buffered data of the buffering area for described update the data, is delayed from described
It rushes in area to update the data described in reading and show on the page;
Miss processing module, if for the buffered data for updating the data buffering area described in miss, basis
Buffered data in buffering area described in the update location updating, and the update number is read from the updated buffering area
According to showing on the page, wherein updated buffered data includes the update read from persistent storage layer
Position and its adjacent position corresponding data in the data acquisition system.
Preferably, the hit processing module includes:
First node searching unit, for searching corresponding node in balanced binary tree according to the update position;
There are endpoint processing units, if for there is node corresponding with the update position in balanced binary tree,
Pull that the update position is corresponding in the data acquisition system to be updated the data in the page from the data block that the node is directed toward
It is shown on face.
Preferably, the data block includes borderline region, which includes the build and block tail for having fixed length;
Correspondingly, the hit processing module further includes:
Intersection judging unit, for judging current presentation region corresponding data and fixed length number where it in data acquisition system
Whether the data of the borderline region of data block have intersection in group;
Intersection processing unit, if for there is intersection, will with current presentation region in data acquisition system corresponding data institute
The data of the adjacent data block of data block read from persistent storage layer, and be stored in the number not being filled in fixed length array
According to block.
Preferably, the miss processing module includes:
Second node searching unit, for searching corresponding node in balanced binary tree according to the update position;
Node increases unit newly, if for node corresponding with the update position to be not present in balanced binary tree,
Increase node in balanced binary tree newly;
First newly-increased endpoint processing unit, for reading the update position from persistent storage layer in the data set
Corresponding data are in the block in conjunction updates the data the data block for being stored in and not being filled in the fixed length array;
Second newly-increased endpoint processing unit so that the newly-increased node is directed toward the data block for updating pointer, and from institute
It states and pulls that the update position is corresponding in the data acquisition system to be updated the data described in the data block that newly-increased node is directed toward
It is shown on the page.
Preferably, the miss processing module further includes knot removal unit, for increasing section newly in balanced binary tree
Before point, if the number for having node in balanced binary tree is M, following operation is executed:
It is determined and position lie farthest away of the current presentation region in the data acquisition system according to the mark value of each node
Node;
The data block deleted the node of the lie farthest away, and be directed toward is labeled as expired, wherein is labeled as expired number
Data can be refilled according to block.
Preferably, the miss processing module is additionally operable to:
If the buffering area is less than, the update position and its adjacent bit is written in the remaining space of the buffering area
Set the corresponding data in the data acquisition system;
If the buffering area has been expired, according to position of the buffered data in buffering area in the data acquisition system, by this
Position meets the sky where the buffered data of pre-determined distance difference condition with the position updated the data in the data acquisition system
Between discharge, and the update position and its adjacent position corresponding number in the data acquisition system is written in the space after release
According to.
Preferably, the length N of data block can be shown most at least more than display area in the page in the fixed length array
Three times of big data entry number.
Preferably, the page includes data show area and scroll control;
Correspondingly, locating module 510 is specifically used for:
Corresponding data acquisition system to be presented is determined from persistent storage layer according to querying condition input by user, and really
The entry number of the fixed data acquisition system;
According to scroll control in the position of data show area, the size of data show area and the entry number of data acquisition system, really
Determine position of the current display area in the data acquisition system on the page.
Preferably, the number of the buffering area is at least one, and at least one buffering area is corresponded to according to user respectively
The data acquisition system to be presented that at least one querying condition of input is determined from persistent storage layer.
The data displaying device that the embodiment of the present invention is provided can perform the data exhibition that any embodiment of the present invention is provided
Show method, has the corresponding function module of execution method and advantageous effect.
Embodiment six
Fig. 6 is the structural schematic diagram for the computer equipment that the embodiment of the present invention six provides.Fig. 6 is shown suitable for being used for realizing
The block diagram of the exemplary computer device 12 of embodiment of the present invention.The computer equipment 12 that Fig. 6 is shown is only an example,
Any restrictions should not be brought to the function and use scope of the embodiment of the present invention.
As shown in fig. 6, computer equipment 12 is showed in the form of universal computing device.The component of computer equipment 12 can be with
Including but not limited to:One or more processor or processing unit 16, system storage 28 connect different system component
The bus 18 of (including system storage 28 and processing unit 16).
Bus 18 indicates one or more in a few class bus structures, including memory bus or Memory Controller,
Peripheral bus, graphics acceleration port, processor or the local bus using the arbitrary bus structures in a variety of bus structures.It lifts
For example, these architectures include but not limited to industry standard architecture (ISA) bus, microchannel architecture (MAC)
Bus, enhanced isa bus, Video Electronics Standards Association (VESA) local bus and peripheral component interconnection (PCI) bus.
Computer equipment 12 typically comprises a variety of computer system readable media.These media can be it is any can be by
The usable medium that computer equipment 12 accesses, including volatile and non-volatile media, moveable and immovable medium.
System storage 28 may include the computer system readable media of form of volatile memory, such as arbitrary access
Memory (RAM) 30 and/or cache memory 32.Computer equipment 12 may further include it is other it is removable/can not
Mobile, volatile/non-volatile computer system storage medium.Only as an example, storage system 34 can be used for reading and writing not
Movably, non-volatile magnetic media (Fig. 6 do not show, commonly referred to as " hard disk drive ").It, can be with although being not shown in Fig. 6
It provides for the disc driver to moving non-volatile magnetic disk (such as " floppy disk ") read-write, and to removable non-volatile
The CD drive of CD (such as CD-ROM, DVD-ROM or other optical mediums) read-write.In these cases, each driving
Device can be connected by one or more data media interfaces with bus 18.Memory 28 may include at least one program production
There is one group of (for example, at least one) program module, these program modules to be configured to perform of the invention each for product, the program product
The function of embodiment.
Program/utility 40 with one group of (at least one) program module 42 can be stored in such as memory 28
In, such program module 42 include but not limited to operating system, one or more application program, other program modules and
Program data may include the realization of network environment in each or certain combination in these examples.Program module 42 is usual
Execute the function and/or method in embodiment described in the invention.
Computer equipment 12 can also be with one or more external equipments 14 (such as keyboard, sensing equipment, display 24
Deng) communication, can also be enabled a user to one or more equipment interact with the computer equipment 12 communicate, and/or with make
The computer equipment 12 any equipment (such as network interface card, the modulatedemodulate that can be communicated with one or more of the other computing device
Adjust device etc.) communication.This communication can be carried out by input/output (I/O) interface 22.Also, computer equipment 12 may be used also
To pass through network adapter 20 and one or more network (such as LAN (LAN), wide area network (WAN) and/or public network
Network, such as internet) communication.As shown, network adapter 20 is logical by bus 18 and other modules of computer equipment 12
Letter.It should be understood that although not shown in the drawings, can in conjunction with computer equipment 12 use other hardware and/or software module, including
But it is not limited to:Microcode, device driver, redundant processing unit, external disk drive array, RAID system, tape drive
And data backup storage system etc..
Processing unit 16 is stored in program in system storage 28 by operation, to perform various functions application and
Data processing, such as realize the method for exhibiting data that the embodiment of the present invention is provided.
Embodiment seven
The embodiment of the present invention seven additionally provides a kind of computer readable storage medium, is stored thereon with computer program, should
The method for exhibiting data provided such as the embodiment of the present invention is provided when program is executed by processor.
The arbitrary of one or more computer-readable media may be used in the computer storage media of the embodiment of the present invention
Combination.Computer-readable medium can be computer-readable signal media or computer readable storage medium.It is computer-readable
Storage medium for example may be-but not limited to-the system of electricity, magnetic, optical, electromagnetic, infrared ray or semiconductor, device or
Device, or the arbitrary above combination.The more specific example (non exhaustive list) of computer readable storage medium includes:Tool
There are one or the electrical connection of multiple conducting wires, portable computer diskette, hard disk, random access memory (RAM), read-only memory
(ROM), erasable programmable read only memory (EPROM or flash memory), optical fiber, portable compact disc read-only memory (CD-
ROM), light storage device, magnetic memory device or above-mentioned any appropriate combination.In this document, computer-readable storage
Medium, which can be any, includes or the tangible medium of storage program, which can be commanded execution system, device or device
Using or it is in connection.
Computer-readable signal media may include in a base band or as the data-signal that a carrier wave part is propagated,
Wherein carry computer-readable program code.Diversified forms may be used in the data-signal of this propagation, including but unlimited
In electromagnetic signal, optical signal or above-mentioned any appropriate combination.Computer-readable signal media can also be that computer can
Any computer-readable medium other than storage medium is read, which can send, propagates or transmit and be used for
By instruction execution system, device either device use or program in connection.
The program code for including on computer-readable medium can transmit with any suitable medium, including --- but it is unlimited
In wireless, electric wire, optical cable, RF etc. or above-mentioned any appropriate combination.
It can be write with one or more programming languages or combinations thereof for executing the computer that operates of the present invention
Program code, described program design language include object oriented program language-such as Java, Smalltalk, C++,
Further include conventional procedural programming language-such as " C " language or similar programming language.Program code can be with
It fully executes, partly execute on the user computer on the user computer, being executed as an independent software package, portion
Divide and partly executes or executed on a remote computer or server completely on the remote computer on the user computer.
Be related in the situation of remote computer, remote computer can pass through the network of any kind --- including LAN (LAN) or
Wide area network (WAN)-be connected to subscriber computer, or, it may be connected to outer computer (such as carried using Internet service
It is connected by internet for quotient).
Note that above are only presently preferred embodiments of the present invention and institute's application technology principle.It will be appreciated by those skilled in the art that
The present invention is not limited to specific embodiments described here, can carry out for a person skilled in the art it is various it is apparent variation,
It readjusts and substitutes without departing from protection scope of the present invention.Therefore, although being carried out to the present invention by above example
It is described in further detail, but the present invention is not limited only to above example, without departing from the inventive concept, also
May include other more equivalent embodiments, and the scope of the present invention is determined by scope of the appended claims.
Claims (19)
1. a kind of method for exhibiting data, which is characterized in that the method includes:
Determine position of the current display area in data acquisition system to be presented on the page, wherein the data acquisition system is stored in
Persistent storage layer;
Buffered data deposit buffering area is read from persistent storage layer according to the position, wherein the buffering area with it is described
Data acquisition system is corresponding and pre-establishes in memory, and the buffered data includes the position and its adjacent position described
Corresponding data in data acquisition system;
From reading the position corresponding data in the data acquisition system in the buffering area, and show on the page.
2. according to the method described in claim 1, it is characterized in that, the buffered data is stored as fixed length number in the buffer
Group, the fixed length array include M data block, and each data data in the block include different page presentation region in the data
Position and its adjacent position in the set corresponding data in the data acquisition system, and the length of each data block is N,
In, M and N are natural number.
3. according to the method described in claim 2, it is characterized in that, being established in the buffering area has balanced binary tree, node
It is directed toward corresponding data block in fixed length array by pointer, the balanced binary tree exists for current display area on searched page
Whether corresponding data hit buffering area in the data acquisition system.
4. according to the method described in claim 3, it is characterized in that, the node total number of the balanced binary tree and of data block
Number M is identical, and each node marks the data block that the node is directed toward in the data acquisition system by the mark value of its storage
In position, wherein the data acquisition system according to length be N data block divide.
5. according to the method described in claim 4, it is characterized in that, the method further includes:
It obtains and is updated over current update position of the display area in the data acquisition system on the rear page;
It is updated the data according to the updated current presentation region of update location determination is corresponding in the data acquisition system;
If described update the data the buffered data for hitting the buffering area, updated the data described in reading from the buffering area
It shows on the page;
If the buffered data for updating the data buffering area described in miss, buffered according to described in the update location updating
Buffered data in area, and update the data described in reading from the updated buffering area and show on the page, wherein
Updated buffered data includes the update position read from persistent storage layer and its adjacent position in the number
According to corresponding data in set.
6. according to the method described in claim 5, it is characterized in that, if described update the data the buffering for hitting the buffering area
Data are then updated the data described in reading from the buffering area and are shown on the page, including:
Corresponding node is searched in balanced binary tree according to the update position;
If there is node corresponding with the update position in balanced binary tree, pulled from the data block that the node is directed toward
The update position corresponding update the data in the data acquisition system shows on the page.
7. according to the method described in claim 6, it is characterized in that, the data block includes borderline region, the borderline region packet
Include build and block tail with fixed length;
Correspondingly, in the data block being directed toward from node when pulling data, the method further includes:
Judge the borderline region of current presentation region corresponding data and data block in fixed length array where it in data acquisition system
Data whether have intersection;
If there is intersection, by the data block adjacent with data block of the current presentation region in data acquisition system where corresponding data
Data read from persistent storage layer, and be stored in the data block not being filled in fixed length array.
8. according to the method described in claim 5, it is characterized in that, if described update the data the slow of buffering area described in miss
Data are rushed, then according to the buffered data in buffering area described in the update location updating, and from the updated buffering area
It updates the data described in reading and shows on the page, including:
Corresponding node is searched in balanced binary tree according to the update position;
If node corresponding with the update position is not present in balanced binary tree, node is increased newly in balanced binary tree;
It is updated the data from reading the update position in persistent storage layer corresponding data being in the block in the data acquisition system
It is stored in the data block not being filled in the fixed length array;
Update pointer makes the newly-increased node be directed toward the data block, and pulls institute from the data block that the newly-increased node is directed toward
Update position corresponding update the data in the data acquisition system is stated to show on the page.
9. wanting the method described in 8 according to right, which is characterized in that before increasing node newly in balanced binary tree, if balance two
The number for having node in fork tree is M, then the method further includes:
The section with position lie farthest away of the current presentation region in the data acquisition system is determined according to the mark value of each node
Point;
The data block deleted the node of the lie farthest away, and be directed toward is labeled as expired, wherein is labeled as expired data block
Data can be refilled.
10. according to the method described in claim 5, it is characterized in that, described according to buffering area described in the update location updating
In buffered data, including:
If the buffering area is less than, the update position is written in the remaining space of the buffering area and its adjacent position exists
Corresponding data in the data acquisition system;
If the buffering area has been expired, according to position of the buffered data in buffering area in the data acquisition system, by the position
It releases in space where meeting the buffered data of pre-determined distance difference condition with the position updated the data in the data acquisition system
It puts, and the update position and its adjacent position corresponding data in the data acquisition system is written in the space after release.
11. according to the method described in claim 2, it is characterized in that, in the fixed length array data block length N at least more than
Three times of the maximum data entry number that display area can be shown in the page.
12. according to any method in claim 1-11, which is characterized in that the page includes data show area and rolling
Dynamic control;
Correspondingly, current position of the display area in data acquisition system to be presented includes on the determining page:
Corresponding data acquisition system to be presented is determined from persistent storage layer according to querying condition input by user, and determining should
The entry number of data acquisition system;
According to scroll control in the position of data show area, the size of data show area and the entry number of data acquisition system, page is determined
Position of the current display area in the data acquisition system on face.
13. according to any method in claim 1-11, which is characterized in that the number of the buffering area is at least one
A, at least one buffering area corresponds to true from persistent storage layer according at least one querying condition input by user respectively
Fixed data acquisition system to be presented.
14. a kind of data show device, which is characterized in that described device includes:
Locating module, for determining position of the current display area in data acquisition system to be presented on the page, wherein the number
It is stored in persistent storage layer according to set;
Cache module, for reading buffered data deposit buffering area from persistent storage layer according to the position, wherein described
Buffering area is corresponding with the data acquisition system and pre-establishes in memory, and the buffered data includes the position and its phase
Set the corresponding data in the data acquisition system in ortho position;
Display module is read, for from reading the position corresponding data in the data acquisition system in the buffering area, and
It shows on the page.
15. device according to claim 14, which is characterized in that the buffered data is stored as fixed length number in the buffer
Group, the fixed length array include M data block, and each data data in the block include different page presentation region in the data
Position and its adjacent position in the set corresponding data in the data acquisition system, and the length of each data block is N,
In, M and N are natural number.
16. device according to claim 15, which is characterized in that being established in the buffering area has balanced binary tree, saves
Point is directed toward corresponding data block in fixed length array by pointer, and the balanced binary tree is for current display area on searched page
Whether corresponding data hit buffering area in the data acquisition system.
17. device according to claim 16, which is characterized in that the node total number of the balanced binary tree and data block
Number M is identical, and each node marks the data block that the node is directed toward in the data set by the mark value of its storage
Position in conjunction, wherein the data acquisition system is divided according to the data block that length is N.
18. a kind of computer equipment, which is characterized in that including:
One or more processors;
Storage device, for storing one or more programs,
When one or more of programs are executed by one or more of processors so that one or more of processors are real
The now method for exhibiting data as described in any in claim 1-13.
19. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the program is by processor
The method for exhibiting data as described in any in claim 1-13 is realized when execution.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810161448.XA CN108416000A (en) | 2018-02-27 | 2018-02-27 | Method for exhibiting data, device, equipment and storage medium |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810161448.XA CN108416000A (en) | 2018-02-27 | 2018-02-27 | Method for exhibiting data, device, equipment and storage medium |
Publications (1)
Publication Number | Publication Date |
---|---|
CN108416000A true CN108416000A (en) | 2018-08-17 |
Family
ID=63129024
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201810161448.XA Pending CN108416000A (en) | 2018-02-27 | 2018-02-27 | Method for exhibiting data, device, equipment and storage medium |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN108416000A (en) |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109358790A (en) * | 2018-09-27 | 2019-02-19 | 努比亚技术有限公司 | Interface display method, mobile terminal and computer readable storage medium |
CN109409985A (en) * | 2018-09-25 | 2019-03-01 | 五八有限公司 | A kind of information displaying method, device, equipment and storage medium |
CN110851058A (en) * | 2019-11-11 | 2020-02-28 | 支付宝(杭州)信息技术有限公司 | Page virtual scrolling method, device and equipment |
CN111291294A (en) * | 2020-01-23 | 2020-06-16 | 北京无限光场科技有限公司 | Information loading method and device, terminal and storage medium |
CN112711726A (en) * | 2020-12-17 | 2021-04-27 | 北京奇艺世纪科技有限公司 | Method and device for caching video data, computer equipment and storage medium |
CN113778948A (en) * | 2021-09-01 | 2021-12-10 | 中国人民银行清算总中心 | Message persistent storage method and device |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1635494A (en) * | 2003-12-27 | 2005-07-06 | 海信集团有限公司 | Method for implementing class memory database access and retrieval |
CN101763222A (en) * | 2008-12-18 | 2010-06-30 | 深圳迈瑞生物医疗电子股份有限公司 | Data read-write buffer method and buffer device |
CN103559307A (en) * | 2013-11-18 | 2014-02-05 | 中国农业银行股份有限公司 | Caching method and device for query |
CN105550356A (en) * | 2015-12-28 | 2016-05-04 | 魅族科技(中国)有限公司 | Preloading method of browsed contents, and terminal |
US20170068703A1 (en) * | 2014-07-25 | 2017-03-09 | Jing-Hao Ju | Local database cache |
-
2018
- 2018-02-27 CN CN201810161448.XA patent/CN108416000A/en active Pending
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1635494A (en) * | 2003-12-27 | 2005-07-06 | 海信集团有限公司 | Method for implementing class memory database access and retrieval |
CN101763222A (en) * | 2008-12-18 | 2010-06-30 | 深圳迈瑞生物医疗电子股份有限公司 | Data read-write buffer method and buffer device |
CN103559307A (en) * | 2013-11-18 | 2014-02-05 | 中国农业银行股份有限公司 | Caching method and device for query |
US20170068703A1 (en) * | 2014-07-25 | 2017-03-09 | Jing-Hao Ju | Local database cache |
CN105550356A (en) * | 2015-12-28 | 2016-05-04 | 魅族科技(中国)有限公司 | Preloading method of browsed contents, and terminal |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109409985A (en) * | 2018-09-25 | 2019-03-01 | 五八有限公司 | A kind of information displaying method, device, equipment and storage medium |
CN109358790A (en) * | 2018-09-27 | 2019-02-19 | 努比亚技术有限公司 | Interface display method, mobile terminal and computer readable storage medium |
CN110851058A (en) * | 2019-11-11 | 2020-02-28 | 支付宝(杭州)信息技术有限公司 | Page virtual scrolling method, device and equipment |
CN111291294A (en) * | 2020-01-23 | 2020-06-16 | 北京无限光场科技有限公司 | Information loading method and device, terminal and storage medium |
CN112711726A (en) * | 2020-12-17 | 2021-04-27 | 北京奇艺世纪科技有限公司 | Method and device for caching video data, computer equipment and storage medium |
CN112711726B (en) * | 2020-12-17 | 2023-09-01 | 北京奇艺世纪科技有限公司 | Method, device, computer equipment and storage medium for caching video data |
CN113778948A (en) * | 2021-09-01 | 2021-12-10 | 中国人民银行清算总中心 | Message persistent storage method and device |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN108416000A (en) | Method for exhibiting data, device, equipment and storage medium | |
US20240061543A1 (en) | Application window divider control for window layout management | |
CA2298049A1 (en) | Scroll bar with integrated advertisement | |
CN104267874B (en) | The method and terminal that application icon is laid out in a kind of adjustment terminal | |
CN109603155A (en) | Merge acquisition methods, device, storage medium, processor and the terminal of textures | |
CN105868241A (en) | Data loading method and apparatus | |
CN105869005A (en) | APP startup advertisement pre-loading method, apparatus and system | |
WO2007142326A1 (en) | Data update system, terminal device, server device, and data update method | |
CN110109868A (en) | Method, apparatus and computer program product for index file | |
US20220279064A1 (en) | Interface display method and electronic device | |
CN107766499A (en) | Page jump method, device, equipment and storage medium | |
CN108874393A (en) | rendering method, device, storage medium and computer equipment | |
CN105700708A (en) | Terminal interface adjusting method and terminal | |
CN106092122A (en) | A kind of navigation interface display packing and device | |
CN106294291A (en) | A kind of TrueType font rendering intent | |
JPH03185967A (en) | Document data transfer display system | |
CN107291564B (en) | Information copying and pasting method and device and electronic equipment | |
CN109783321A (en) | Monitoring data management method, device, terminal device | |
JP5790571B2 (en) | Information processing system | |
CN107391610A (en) | Background picture setting method and device, readable storage medium and computer equipment | |
CN115270032B (en) | Dynamic high-definition text display method and system based on WebGL | |
WO2022135258A1 (en) | Image lookup method and apparatus, and electronic device | |
CN108153883A (en) | Searching method and device, computer equipment, program product and storage medium | |
US20020054043A1 (en) | Method and system for displaying images | |
CN101501732A (en) | Image processing device, image processing integrated circuit, image processing system, input assembler device, and input assembling integrated circuit |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
RJ01 | Rejection of invention patent application after publication | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180817 |