In scenarios where users need to extract specific information from large video datasets, an efficient system is essential to filter the relevant segments. This helps in enhancing the overall search and retrieval experience. This paper presents a technique designed to manage large volumes of video data by efficiently identifying and extracting user-preferred content based on user defined criteria. The proposed system uses Natural Language Processing (NLP) to filter audio content and machine learning-based object detection to filter video content. This enables precise extraction based on both spoken dialogue and visual elements. The proposed system also addresses the challenge of time delays associated with analyzing large video datasets by employing advanced filtering methods that utilize parallel processing. This approach reduces the data volume thereby shortening the time required for users to locate specific information. The performance of the technique was assessed through a series of experiments conducted on a large video dataset. The experimental results demonstrate the effectiveness of the system in improving search efficiency within huge volumes of video data.

Boolean AND queries (BAQ) are one of the most important types of queries used in text searching. In this paper, a graph-based indexing technique is proposed to improve the search latency of BAQ. It shows how a graph structure represented using a hash table can reduce the number of intersections needed for the execution of BAQ. The performance of the proposed technique is compared with one of the most widely used index structures for textual documents called Inverted Index. A detailed performance analysis is performed through prototyping and measurement on a system subjected to a synthetic workload. To get further performance insights, the proposed graph-based indexing technique is also compared with an enterprise-level search engine called Elasticsearch which uses Inverted Index at its core. The analysis shows that the graph-based indexing technique can reduce the latency for executing BAQ significantly in comparison to the other techniques.

This paper focuses on priority based processing of streaming data. One of the greatest challenges in big data analytics is responding to a bursty input load. The common solutions are to use dynamic resource provisioning techniques, however, these techniques may not respond quickly enough to the change in the load. Another option is to overprovision, but this results in wasted computing resources. This paper describes a technique that can be used in cases where resources are statically provisioned. This technique enables users to prioritize certain input data items so that in cases where the load suddenly increases, the high priority items are given precedence over low priority items. This technique is implemented on the Spark Streaming engine.

A multitenant Storm cluster runs multiple stream processing applications and uses the default Isolation Scheduler to schedule them. Isolation Scheduler assigns resources to topologies based on static resource configuration and does not provide any means for prioritizing topologies based on their varying business requirements. Thus, performance degradation, even complete starvation of topologies with high priority is possible when the cluster is resource constrained and comprises an inadequate number of resources. Two priority based resource scheduling techniques are proposed to overcome these problems. A performance analysis based on prototyping and measurements demonstrates the effectiveness of the proposed techniques.