Academic literature on the topic 'Query algorithm'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Query algorithm.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Query algorithm"
Joshi, Mukul, and Praveen Ranjan Srivastava. "Query Optimization." International Journal of Intelligent Information Technologies 9, no. 1 (January 2013): 40–55. http://dx.doi.org/10.4018/jiit.2013010103.
Full textLi, Feng, and Hai Ying Wang. "Study on Distributed Database Query Optimization." Applied Mechanics and Materials 536-537 (April 2014): 540–44. http://dx.doi.org/10.4028/www.scientific.net/amm.536-537.540.
Full textXu, Jialu, and Feiyue Ye. "Query Recommendation Using Hybrid Query Relevance." Future Internet 10, no. 11 (November 19, 2018): 112. http://dx.doi.org/10.3390/fi10110112.
Full textMeng, Yao. "Study on Query Optimization of Distributed Database." Applied Mechanics and Materials 533 (February 2014): 448–51. http://dx.doi.org/10.4028/www.scientific.net/amm.533.448.
Full textYang, Ze Xue, and Zhong Xiao Hao. "Spatial Join Queries Based on QR-Tree." Advanced Materials Research 187 (February 2011): 752–57. http://dx.doi.org/10.4028/www.scientific.net/amr.187.752.
Full textLi, Xin, Huayan Yu, Ligang Yuan, and Xiaolin Qin. "Query Optimization for Distributed Spatio-Temporal Sensing Data Processing." Sensors 22, no. 5 (February 23, 2022): 1748. http://dx.doi.org/10.3390/s22051748.
Full textXIE, Kun, Ji-Gang WEN, Da-Fang ZHANG, and Gao-Gang XIE. "Bloom Filter Query Algorithm." Journal of Software 20, no. 1 (April 7, 2009): 96–108. http://dx.doi.org/10.3724/sp.j.1001.2009.00096.
Full textBai, Luyi, Jinyao Wang, Chengyu Zhang, and Xiangfu Meng. "Query Relaxation and Result Ranking for Uncertain Spatiotemporal XML Data." Journal of Database Management 33, no. 1 (January 1, 2022): 1–19. http://dx.doi.org/10.4018/jdm.313970.
Full textKim, Hyeong-Jin, Hyunjo Lee, Yong-Ki Kim, and Jae-Woo Chang. "Privacy-preserving kNN query processing algorithms via secure two-party computation over encrypted database in cloud computing." Journal of Supercomputing 78, no. 7 (January 17, 2022): 9245–84. http://dx.doi.org/10.1007/s11227-021-04286-2.
Full textXu, Hong Bo, and Nian Min Yao. "A Range Query Parallel Algorithm in High-Dimensional Space." Applied Mechanics and Materials 263-266 (December 2012): 2308–13. http://dx.doi.org/10.4028/www.scientific.net/amm.263-266.2308.
Full textDissertations / Theses on the topic "Query algorithm"
Cheng, Jiang. "Preserving query privacy with a query-based memorizing algorithm." Thesis, Wichita State University, 2014. http://hdl.handle.net/10057/10950.
Full textThesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science
Suryavanshi, Chetna. "Query AutoAwesome." DigitalCommons@USU, 2019. https://digitalcommons.usu.edu/etd/7546.
Full textLin, Han-Hsuan. "Topics in quantum algorithms : adiabatic algorithm, quantum money, and bomb query complexity." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99300.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 111-115).
In this thesis, I present three results on quantum algorithms and their complexity. The first one is a numerical study on the quantum adiabatic algorithm( QAA) . We tested the performance of the QAA on random instances of MAX 2-SAT on 20 qubits and showed 3 strategics that improved QAA's performance, including a counter intuitive strategy of decreasing the overall evolution time. The second result is a security proof for the quantum money by knots proposed by Farhi et. al. We proved that quantum money by knots can not be cloned in a black box way unless graph isomorphism is efficiently solvable by a quantum computer. Lastly we defined a modified quantum query model, which we called bomb query complexity B(J), inspired by the Elitzur-Vaidman bomb-testing problem. We completely characterized bomb query complexity be showing that B(f) = [Theta](Q(f)2 ). This result implies a new method to find upper bounds on quantum query complexity, which we applied on the maximum bipartite matching problem to get an algorithm with O(n1.75) quantum query complexity, improving from the best known trivial O(n2 ) upper bound.
by Han-Hsuan Lin.
Ph. D.
Samara, Rafat. "TOP-K AND SKYLINE QUERY PROCESSING OVER RELATIONAL DATABASE." Thesis, Tekniska Högskolan, Högskolan i Jönköping, JTH. Forskningsmiljö Informationsteknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-20108.
Full textPielech, Bradford Charles. "Adaptive Scheduling Algorithm Selection in a Streaming Query System." Digital WPI, 2004. https://digitalcommons.wpi.edu/etd-theses/79.
Full textStaicu, Laurian. "Multiple query points parallel search algorithm (Comb algorithm) for multimedia database systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ59340.pdf.
Full textLim, Heechul. "Evaluation of Shortest Path Query Algorithm in Spatial Databases." Thesis, University of Waterloo, 2003. http://hdl.handle.net/10012/1085.
Full textPielech, Bradford Charles. "Adaptive scheduling algorithm selection in a streaming query system." Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0113104-194126.
Full textCarraher, Lee A. "A Parallel Algorithm for Query Adaptive, Locality Sensitive Hash Search." University of Cincinnati / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1337886738.
Full textChen, Chen. "An evaluation of a 2-way semijoin distributed query processing algorithm." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ62199.pdf.
Full textBooks on the topic "Query algorithm"
Koukoudakis, Alexandros. Visualisation decision algorithm for temporal database management system. Manchester: UMIST, 1996.
Find full textMa, Zhe. Dynamic query algorithms for human-computer interaction based on information gain and the multi-layer perceptron. Sheffield: University of Sheffield, Dept. of Automatic Control & Systems Engineering, 1996.
Find full textUse of genetic algorithms for query improvement in information retrieval based on a vector space model. Ann Arbor, Mich: University Microfilms International, 1994.
Find full textS, Liu Jane W., and United States. National Aeronautics and Space Administration., eds. Monotonically improving approximate answers to relational algebra queries. [Washington, DC: National Aeronautics and Space Administration, 1989.
Find full textBoudreau, Joseph F., and Eric S. Swanson. Templates, the standard C++ library, and modern C++. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198708636.003.0017.
Full textTzoukermann, Evelyne, Judith L. Klavans, and Tomek Strzalkowski. Information Retrieval. Edited by Ruslan Mitkov. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199276349.013.0029.
Full textBook chapters on the topic "Query algorithm"
Dombrovskaya, Henrietta, Boris Novikov, and Anna Bailliekova. "Ultimate Optimization Algorithm." In PostgreSQL Query Optimization, 303–8. Berkeley, CA: Apress, 2021. http://dx.doi.org/10.1007/978-1-4842-6885-8_15.
Full textShekhar, Shashi, and Hui Xiong. "Range Query Algorithm." In Encyclopedia of GIS, 949. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_1076.
Full textShahri, Saied Haidarian, and Hasan Jamil. "An Extendable Meta-learning Algorithm for Ontology Mapping." In Flexible Query Answering Systems, 418–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04957-6_36.
Full textBenadjmi, Noussaiba, and Khaled Walid Hidouci. "New Variants of Hash-Division Algorithm for Tolerant and Stratified Division." In Flexible Query Answering Systems, 99–111. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59692-1_9.
Full textAlfano, Gianvincenzo. "An Efficient Algorithm for Computing the Set of Semi-stable Extensions." In Flexible Query Answering Systems, 139–51. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-27629-4_15.
Full textShin, Hyoseop, and Minsoo Lee. "An Efficient Branch Query Rewriting Algorithm for XML Query Optimization." In Lecture Notes in Computer Science, 1629–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11575801_45.
Full textVijay Kumar, T. V., and Shina Panicker. "Generating Query Plans for Distributed Query Processing Using Genetic Algorithm." In Information Computing and Applications, 765–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25255-6_97.
Full textDias, Steffy, Shweta Kolhe, Ruchi Shinde, Richa Chaudhari, and Revati M. Wahul. "Query Time Optimization Using Hungarian Algorithm." In Lecture Notes in Electrical Engineering, 271–76. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-8715-9_32.
Full textSingh, Vikram, Siddhant Garg, and Pradeep Kaur. "Efficient Algorithm for Web Search Query Reformulation Using Genetic Algorithm." In Advances in Intelligent Systems and Computing, 459–70. New Delhi: Springer India, 2015. http://dx.doi.org/10.1007/978-81-322-2734-2_46.
Full textWang, Ziqiang, and Boqin Feng. "Optimal Genetic Query Algorithm for Information Retrieval." In Parallel and Distributed Processing and Applications, 888–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30566-8_102.
Full textConference papers on the topic "Query algorithm"
Wang, Manzi, Haidong Fu, and Fangfang Xu. "RDF Multi-query Optimization Algorithm for Query Rewriting Using Common Subgraphs." In the 3rd International Conference. New York, New York, USA: ACM Press, 2019. http://dx.doi.org/10.1145/3331453.3361278.
Full textZhang, Bin, and Feiyue Ye. "Semantics Based Multi-XML Query Algorithm." In 2008 International Conference on Computer Science and Software Engineering. IEEE, 2008. http://dx.doi.org/10.1109/csse.2008.385.
Full textGuttoski, Pryscila Barvik, Marcos Sfair Sunye, and Fabiano Silva. "Kruskal's Algorithm for Query Tree Optimization." In 11th International Database Engineering and Applications Symposium (IDEAS 2007). IEEE, 2007. http://dx.doi.org/10.1109/ideas.2007.4318118.
Full textZeboudj, Meriem, and Khaled Belkadi. "Web Query Reformulation Using FireFly Algorithm." In 2020 Second International Conference on Embedded & Distributed Systems (EDiS). IEEE, 2020. http://dx.doi.org/10.1109/edis49545.2020.9296463.
Full textGoyal, A., A. Thakral, and G. K. Sharma. "Improved A* Algorithm For Query Optimization." In 20th Conference on Modelling and Simulation. ECMS, 2006. http://dx.doi.org/10.7148/2006-0472.
Full textAlviano, Mario. "Query Answering in Propositional Circumscription." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/231.
Full textTamine, L., and M. Boughanem. "Query optimisation using an improved genetic algorithm." In the ninth international conference. New York, New York, USA: ACM Press, 2000. http://dx.doi.org/10.1145/354756.354842.
Full textRobertson, Glen, and Xiaoying Gao. "Improving AbraQ: An Automatic Query Expansion Algorithm." In 2010 IEEE/ACM International Conference on Web Intelligence-Intelligent Agent Technology (WI-IAT). IEEE, 2010. http://dx.doi.org/10.1109/wi-iat.2010.95.
Full textAl-Khateeb, Belal, Ali J. Al-Kubaisi, and Sufyan T. Al-Janabi. "Query reformulation using WordNet and genetic algorithm." In 2017 Annual Conference on New Trends in Information & Communications Technology Applications (NTICT). IEEE, 2017. http://dx.doi.org/10.1109/ntict.2017.7976138.
Full textHARB, H., and L. CHEN. "A QUERY BY EXAMPLE MUSIC RETRIEVAL ALGORITHM." In Proceedings of the 4th European Workshop on Image Analysis for Multimedia Interactive Services. WORLD SCIENTIFIC, 2003. http://dx.doi.org/10.1142/9789812704337_0023.
Full textReports on the topic "Query algorithm"
Thost, Veronika, Jan Holste, and Özgür Özçep. On Implementing Temporal Query Answering in DL-Lite. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.218.
Full textRigotti, Christophe, and Mohand-Saïd Hacid. Representing and Reasoning on Conceptual Queries Over Image Databases. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.89.
Full textRigotti, Christophe, and Mohand-Saïd Hacid. Representing and Reasoning on Conceptual Queries Over Image Databases. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.89.
Full textEcke, Andreas, and Anni-Yasmin Turhan. Similarity Measures for Computing Relaxed Instances w.r.t. General EL-TBoxes. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.202.
Full textGil, Oliver Fernández, and Anni-Yasmin Turhan. Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics. Technische Universität Dresden, 2020. http://dx.doi.org/10.25368/2022.261.
Full text