Gotowa bibliografia na temat „Query algorithm”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Query algorithm”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Query algorithm"
Joshi, Mukul, i Praveen Ranjan Srivastava. "Query Optimization". International Journal of Intelligent Information Technologies 9, nr 1 (styczeń 2013): 40–55. http://dx.doi.org/10.4018/jiit.2013010103.
Pełny tekst źródłaLi, Feng, i Hai Ying Wang. "Study on Distributed Database Query Optimization". Applied Mechanics and Materials 536-537 (kwiecień 2014): 540–44. http://dx.doi.org/10.4028/www.scientific.net/amm.536-537.540.
Pełny tekst źródłaXu, Jialu, i Feiyue Ye. "Query Recommendation Using Hybrid Query Relevance". Future Internet 10, nr 11 (19.11.2018): 112. http://dx.doi.org/10.3390/fi10110112.
Pełny tekst źródłaMeng, Yao. "Study on Query Optimization of Distributed Database". Applied Mechanics and Materials 533 (luty 2014): 448–51. http://dx.doi.org/10.4028/www.scientific.net/amm.533.448.
Pełny tekst źródłaYang, Ze Xue, i Zhong Xiao Hao. "Spatial Join Queries Based on QR-Tree". Advanced Materials Research 187 (luty 2011): 752–57. http://dx.doi.org/10.4028/www.scientific.net/amr.187.752.
Pełny tekst źródłaLi, Xin, Huayan Yu, Ligang Yuan i Xiaolin Qin. "Query Optimization for Distributed Spatio-Temporal Sensing Data Processing". Sensors 22, nr 5 (23.02.2022): 1748. http://dx.doi.org/10.3390/s22051748.
Pełny tekst źródłaXIE, Kun, Ji-Gang WEN, Da-Fang ZHANG i Gao-Gang XIE. "Bloom Filter Query Algorithm". Journal of Software 20, nr 1 (7.04.2009): 96–108. http://dx.doi.org/10.3724/sp.j.1001.2009.00096.
Pełny tekst źródłaBai, Luyi, Jinyao Wang, Chengyu Zhang i Xiangfu Meng. "Query Relaxation and Result Ranking for Uncertain Spatiotemporal XML Data". Journal of Database Management 33, nr 1 (1.01.2022): 1–19. http://dx.doi.org/10.4018/jdm.313970.
Pełny tekst źródłaKim, Hyeong-Jin, Hyunjo Lee, Yong-Ki Kim i Jae-Woo Chang. "Privacy-preserving kNN query processing algorithms via secure two-party computation over encrypted database in cloud computing". Journal of Supercomputing 78, nr 7 (17.01.2022): 9245–84. http://dx.doi.org/10.1007/s11227-021-04286-2.
Pełny tekst źródłaXu, Hong Bo, i Nian Min Yao. "A Range Query Parallel Algorithm in High-Dimensional Space". Applied Mechanics and Materials 263-266 (grudzień 2012): 2308–13. http://dx.doi.org/10.4028/www.scientific.net/amm.263-266.2308.
Pełny tekst źródłaRozprawy doktorskie na temat "Query algorithm"
Cheng, Jiang. "Preserving query privacy with a query-based memorizing algorithm". Thesis, Wichita State University, 2014. http://hdl.handle.net/10057/10950.
Pełny tekst źródłaThesis (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.
Pełny tekst źródłaLin, 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.
Pełny tekst źródłaCataloged 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.
Pełny tekst źródłaPielech, Bradford Charles. "Adaptive Scheduling Algorithm Selection in a Streaming Query System". Digital WPI, 2004. https://digitalcommons.wpi.edu/etd-theses/79.
Pełny tekst źródłaStaicu, 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.
Pełny tekst źródłaLim, Heechul. "Evaluation of Shortest Path Query Algorithm in Spatial Databases". Thesis, University of Waterloo, 2003. http://hdl.handle.net/10012/1085.
Pełny tekst źródłaPielech, 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.
Pełny tekst źródłaCarraher, 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.
Pełny tekst źródłaChen, 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.
Pełny tekst źródłaKsiążki na temat "Query algorithm"
Koukoudakis, Alexandros. Visualisation decision algorithm for temporal database management system. Manchester: UMIST, 1996.
Znajdź pełny tekst źródłaMa, 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.
Znajdź pełny tekst źródłaUse of genetic algorithms for query improvement in information retrieval based on a vector space model. Ann Arbor, Mich: University Microfilms International, 1994.
Znajdź pełny tekst źródłaS, Liu Jane W., i United States. National Aeronautics and Space Administration., red. Monotonically improving approximate answers to relational algebra queries. [Washington, DC: National Aeronautics and Space Administration, 1989.
Znajdź pełny tekst źródłaBoudreau, Joseph F., i 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.
Pełny tekst źródłaTzoukermann, Evelyne, Judith L. Klavans i Tomek Strzalkowski. Information Retrieval. Redaktor Ruslan Mitkov. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199276349.013.0029.
Pełny tekst źródłaCzęści książek na temat "Query algorithm"
Dombrovskaya, Henrietta, Boris Novikov i Anna Bailliekova. "Ultimate Optimization Algorithm". W PostgreSQL Query Optimization, 303–8. Berkeley, CA: Apress, 2021. http://dx.doi.org/10.1007/978-1-4842-6885-8_15.
Pełny tekst źródłaShekhar, Shashi, i Hui Xiong. "Range Query Algorithm". W Encyclopedia of GIS, 949. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_1076.
Pełny tekst źródłaShahri, Saied Haidarian, i Hasan Jamil. "An Extendable Meta-learning Algorithm for Ontology Mapping". W Flexible Query Answering Systems, 418–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04957-6_36.
Pełny tekst źródłaBenadjmi, Noussaiba, i Khaled Walid Hidouci. "New Variants of Hash-Division Algorithm for Tolerant and Stratified Division". W Flexible Query Answering Systems, 99–111. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59692-1_9.
Pełny tekst źródłaAlfano, Gianvincenzo. "An Efficient Algorithm for Computing the Set of Semi-stable Extensions". W Flexible Query Answering Systems, 139–51. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-27629-4_15.
Pełny tekst źródłaShin, Hyoseop, i Minsoo Lee. "An Efficient Branch Query Rewriting Algorithm for XML Query Optimization". W Lecture Notes in Computer Science, 1629–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11575801_45.
Pełny tekst źródłaVijay Kumar, T. V., i Shina Panicker. "Generating Query Plans for Distributed Query Processing Using Genetic Algorithm". W Information Computing and Applications, 765–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25255-6_97.
Pełny tekst źródłaDias, Steffy, Shweta Kolhe, Ruchi Shinde, Richa Chaudhari i Revati M. Wahul. "Query Time Optimization Using Hungarian Algorithm". W Lecture Notes in Electrical Engineering, 271–76. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-8715-9_32.
Pełny tekst źródłaSingh, Vikram, Siddhant Garg i Pradeep Kaur. "Efficient Algorithm for Web Search Query Reformulation Using Genetic Algorithm". W 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.
Pełny tekst źródłaWang, Ziqiang, i Boqin Feng. "Optimal Genetic Query Algorithm for Information Retrieval". W 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.
Pełny tekst źródłaStreszczenia konferencji na temat "Query algorithm"
Wang, Manzi, Haidong Fu i Fangfang Xu. "RDF Multi-query Optimization Algorithm for Query Rewriting Using Common Subgraphs". W the 3rd International Conference. New York, New York, USA: ACM Press, 2019. http://dx.doi.org/10.1145/3331453.3361278.
Pełny tekst źródłaZhang, Bin, i Feiyue Ye. "Semantics Based Multi-XML Query Algorithm". W 2008 International Conference on Computer Science and Software Engineering. IEEE, 2008. http://dx.doi.org/10.1109/csse.2008.385.
Pełny tekst źródłaGuttoski, Pryscila Barvik, Marcos Sfair Sunye i Fabiano Silva. "Kruskal's Algorithm for Query Tree Optimization". W 11th International Database Engineering and Applications Symposium (IDEAS 2007). IEEE, 2007. http://dx.doi.org/10.1109/ideas.2007.4318118.
Pełny tekst źródłaZeboudj, Meriem, i Khaled Belkadi. "Web Query Reformulation Using FireFly Algorithm". W 2020 Second International Conference on Embedded & Distributed Systems (EDiS). IEEE, 2020. http://dx.doi.org/10.1109/edis49545.2020.9296463.
Pełny tekst źródłaGoyal, A., A. Thakral i G. K. Sharma. "Improved A* Algorithm For Query Optimization". W 20th Conference on Modelling and Simulation. ECMS, 2006. http://dx.doi.org/10.7148/2006-0472.
Pełny tekst źródłaAlviano, Mario. "Query Answering in Propositional Circumscription". W 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.
Pełny tekst źródłaTamine, L., i M. Boughanem. "Query optimisation using an improved genetic algorithm". W the ninth international conference. New York, New York, USA: ACM Press, 2000. http://dx.doi.org/10.1145/354756.354842.
Pełny tekst źródłaRobertson, Glen, i Xiaoying Gao. "Improving AbraQ: An Automatic Query Expansion Algorithm". W 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.
Pełny tekst źródłaAl-Khateeb, Belal, Ali J. Al-Kubaisi i Sufyan T. Al-Janabi. "Query reformulation using WordNet and genetic algorithm". W 2017 Annual Conference on New Trends in Information & Communications Technology Applications (NTICT). IEEE, 2017. http://dx.doi.org/10.1109/ntict.2017.7976138.
Pełny tekst źródłaHARB, H., i L. CHEN. "A QUERY BY EXAMPLE MUSIC RETRIEVAL ALGORITHM". W Proceedings of the 4th European Workshop on Image Analysis for Multimedia Interactive Services. WORLD SCIENTIFIC, 2003. http://dx.doi.org/10.1142/9789812704337_0023.
Pełny tekst źródłaRaporty organizacyjne na temat "Query algorithm"
Thost, Veronika, Jan Holste i Ö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.
Pełny tekst źródłaRigotti, Christophe, i 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.
Pełny tekst źródłaRigotti, Christophe, i 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.
Pełny tekst źródłaEcke, Andreas, i 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.
Pełny tekst źródłaGil, Oliver Fernández, i 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.
Pełny tekst źródła