Interactive application multimedia data query method and device

Abstract

The embodiment of the invention discloses an interactive application multimedia data query method and an interactive application multimedia data query device. The method comprises the following steps of: establishing a list for a database in which interactive application multimedia data is stored; establishing an index for the list, wherein the index comprises a B+ tree index or a Hash index; and querying the needed data in the database according to the index. By the method provided by the embodiment of the invention, the aim of rapidly querying massive data in a digital television is fulfilled by dynamic query and query optimization, the interactive multimedia data is rapidly queried, the waiting time of a user is reduced, and data query accuracy rates can be improved simultaneously; therefore, the experience and the satisfaction of the user are improved.

Description

technical field [0001] The invention relates to the technical field of digital television, in particular to a query method and device for interactive application of multimedia data. Background technique [0002] In the current development of digital TV, in order to enhance the interaction with users and improve the quality of user experience, more and more data needs to be transmitted, and in comparison with traditional TV, due to the enhanced user interaction, it is necessary to ensure user retrieval. All kinds of data have a certain real-time nature. Among the existing processing methods for massive data processing, there are mainly methods such as Bloom Filter, Hash, and Bitmap. [0003] A Bloom Filter is a space-efficient random data structure that uses a bit array to succinctly represent a set and can determine whether an element belongs to the set. In the initial state, the Bloom Filter is a bit array containing m bits, each of which is 0. In order to express a set,...

AI Technical Summary

Problems solved by technology

[0005] Although Bloom Filter has the characteristics of high efficiency, when judging whether an element belongs to a certain set, it may mistake elements that do not belong to this set as belonging to this set. Therefore, Bloom Filter is not suitable for "zero error" applications. In digital TV, if the user sees specific content that is not selected by the user, it will reduce the user experience

However, due to the total amount of data read in at one time, the amount of data in the digital family is too large, so it cannot be read in at one time, and the query time of the hash index is very long during the range query, which will increase the waiting time of the user. This also affects the user experience

Images