Results 81 to 90 of about 391,863 (191)
MWAND: A New Early Termination Algorithm for Fast and Efficient Query Evaluation
International Journal of Interactive Multimedia and Artificial Intelligence, 2019 Nowadays, current information systems are so large and maintain huge amount of data. At every time, they process millions of documents and millions of queries.
Zemani Imene Mansouria +2 more
doaj +1 more source
On Real-time Top k Querying for Mobile Services [PDF]
, 2006 Mobile services offering multi-feature query capabilities must meet tough response time requirements to gain customer acceptance. The top-k query model is a popular candidate to implement such services.
Balke, Wolf-Tilo +2 more
core
Top-k Stabbing Interval Queries
We investigate a weighted variant of the interval stabbing problem, where the goal is to design an efficient data structure for a given set $\mathcal{I}$ of weighted intervals such that, for a query point $q$ and an integer $k>0$, we can report the $k$ intervals with largest weights among those stabbed by $q$.
Akram, Waseem, Saxena, Sanjeev
openaire +2 more sources
(ε,δ)-approximate Top-k query processing algorithm in wireless sensor networks
Tongxin xuebao, 2011 A sampling based approximate Top-k algorithm was proposed that is adaptive for any data distribution.δ≥0 and 0 ...
BI Ran, LI Jian-zhong, CHENG Si-yao
doaj +2 more sources
INDEXING AND QUERY PROCESSING TECHNIQUES IN SPATIO-TEMPORAL DATA [PDF]
ICTACT Journal on Soft Computing, 2016 Indexing and query processing is an emerging research field in spatio - temporal data. Most of the real-time applications such as location based services, fleet management, traffic prediction and radio frequency identification and sensor networks are ...
A John, M Sugumaran, R S Rajesh
doaj
Adaptive Distributed Top-k Query Processing
, 2016 ADiT is an adaptive approach for processing distributed top-$k$ queries over peer-to-peer networks optimizing both system load and query response time. This approach considers the size of the peer to peer network, the amount $k$ of searched objects, the network capabilities of a connected peer, i.e.
Dabringer, Claus, Eder, Johann
openaire +2 more sources
Query Refinement for Diverse Top-k Selection
Proceedings of the ACM on Management of DataDatabase queries are often used to select and rank items as decision support for many applications. As automated decision-making tools become more prevalent, there is a growing recognition of the need to diversify their outcomes. In this paper, we define and study the problem of modifying the selection conditions of an ORDER BY query so that the result
Felix S. Campbell +3 more
openaire +2 more sources
Fast Inbound Top-K Query for Random Walk with Restart. [PDF]
Mach Learn Knowl Discov Databases, 2015 Zhang C, Jiang S, Chen Y, Sun Y, Han J.
europepmc +1 more source
Evaluación eficiente de consultas Top-k Skyline Efficient evaluation of Top-k Skyline queries
Revista Técnica de la Facultad de Ingeniería, 2009 Tecnologías emergentes permiten el acceso a grandes repositorios de datos, mucho de los cuales pueden publicar datos pocos confiables. Los usuarios que acceden independientemente a estos repositorios deben ser capaces de identificar y descartar ...
Marlene Goncalves, María-Esther Vidal
doaj
Computing Non-Dominated Flexible Skylines in Vertically Distributed Datasets with No Random Access
DataIn today’s data-driven world, algorithms operating with vertically distributed datasets are crucial due to the increasing prevalence of large-scale, decentralized data storage.
Davide Martinenghi
doaj +1 more source