Results 241 to 250 of about 198,739 (283)
Some of the next articles are maybe not open access.
Proceedings of the 2007 ACM SIGMOD international conference on Management of data, 2007
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic inference. This paper presents a broad class of aggregate queries, called MPF queries, inspired by the literature on probabilistic inference in statistics and machine learning.
Héctor Corrada Bravo +1 more
openaire +1 more source
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic inference. This paper presents a broad class of aggregate queries, called MPF queries, inspired by the literature on probabilistic inference in statistics and machine learning.
Héctor Corrada Bravo +1 more
openaire +1 more source
Parallelizing query optimization
Proceedings of the VLDB Endowment, 2008Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization time increases rapidly for queries joining more than 10 tables.
Wook-Shin Han +4 more
openaire +1 more source
2006
Determining the best execution plan for a spatial query requires tools for measuring (more precisely, estimating) the number of (spatial) data items that are retrieved by a query as well as its cost, in terms of I/O and CPU effort. As in traditional databases, spatial query optimization tools include cost-based models, exploiting analytical formulae ...
Yannis Manolopoulos +3 more
openaire +1 more source
Determining the best execution plan for a spatial query requires tools for measuring (more precisely, estimating) the number of (spatial) data items that are retrieved by a query as well as its cost, in terms of I/O and CPU effort. As in traditional databases, spatial query optimization tools include cost-based models, exploiting analytical formulae ...
Yannis Manolopoulos +3 more
openaire +1 more source
ACM SIGMOD Record, 1986
In some recently proposed extensions to relational database systems as well as in deductive databases, a database system is presented with a collection of queries to process instead of just one. It is an interesting problem then, to come up with algorithms that process these queries together instead of one query at a time.
openaire +1 more source
In some recently proposed extensions to relational database systems as well as in deductive databases, a database system is presented with a collection of queries to process instead of just one. It is an interesting problem then, to come up with algorithms that process these queries together instead of one query at a time.
openaire +1 more source
Few-Shot Learning Meets Transformer: Unified Query-Support Transformers for Few-Shot Classification
IEEE Transactions on Circuits and Systems for Video Technology, 2023Sissi Wang, Xiao Wang, Bo Jiang
exaly
VQL: Efficient and Verifiable Cloud Query Services for Blockchain Systems
IEEE Transactions on Parallel and Distributed Systems, 2022Haotian Wu, Zhe Peng, Songtao Guo
exaly
Machine Learning in Internet Search Query Selection for Tourism Forecasting
Journal of Travel Research, 2021Xin Li, Hengyun Li, Bing Pan
exaly