Rozprawy doktorskie na temat „Query algorithm”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich 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.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
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łaKangas, Carl-Evert. "Ranking Highscores : Evaluation of a dynamic Bucket with Global Query algorithm". Thesis, Umeå universitet, Institutionen för datavetenskap, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-127677.
Pełny tekst źródłaJayakeerthy, Arunkumar Thippur Lim Alvin S. "Query-localized route repair mechanism for ad-hoc on-demand distance vector routing algorithm". Auburn, Ala, 2009. http://hdl.handle.net/10415/1608.
Pełny tekst źródłaYang, Di. "Mining and Managing Neighbor-Based Patterns in Data Streams". Digital WPI, 2012. https://digitalcommons.wpi.edu/etd-dissertations/16.
Pełny tekst źródłaSevinc, Ender. "Genetic Algorithms For Distributed Database Design And Distributed Database Query Optimization". Phd thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/3/12611194/index.pdf.
Pełny tekst źródłaStoler, Moshe. "Query processing optimization for distributed relational database systems: an implementation of a heuristic based algorithm". Master's thesis, Virginia Polytechnic Institute and State University, 1987. http://hdl.handle.net/10919/64491.
Pełny tekst źródłaMaster of Engineering
Guzun, Gheorghi. "Distributed indexing and scalable query processing for interactive big data explorations". Diss., University of Iowa, 2016. https://ir.uiowa.edu/etd/2087.
Pełny tekst źródłaSilva, Asima. "Multiple continuous query processing with relative window predicates "Juggler"". Link to electronic thesis, 2004. http://www.wpi.edu/Pubs/ETD/Available/etd-0527104-223456/.
Pełny tekst źródłaKeywords: reordering predicates; multi-join operator; sliding windows; window predicates; join algorithm; continuous queries. Includes bibliographical references (p. 101-103).
Stantic, Bela, i n/a. "Access Methods for Temporal Databases". Griffith University. School of Information and Communication Technology, 2005. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20060906.144815.
Pełny tekst źródłaStantic, Bela. "Access Methods for Temporal Databases". Thesis, Griffith University, 2005. http://hdl.handle.net/10072/365973.
Pełny tekst źródłaThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information and Communication Technology
Full Text
Dieng, Cheikh Tidiane. "Etude et implantation de l'extraction de requetes frequentes dans les bases de donnees multidimensionnelles". Thesis, Cergy-Pontoise, 2011. http://www.theses.fr/2011CERG0530.
Pełny tekst źródłaThe problem of mining frequent queries in a database has motivated many research efforts during the last two decades. This is so because many interesting patterns, such as association rules, exact or approximative functional dependencies and exact or approximative conditional functional dependencies can be easily retrieved, which is not possible using standard techniques.However, the problem mining frequent queries in a relational database is not easy because, on the one hand, the size of the search space is huge (because encompassing all possible queries that can be addressed to a given database), and on the other hand, testing whether two queries are equivalent (which entails redundant support computations) is NP-Complete.In this thesis, we focus on projection-selection-join queries, assuming that the database is defined over a star schema. In this setting, we define a pre-ordering (≼) between queries and we prove the following basic properties:1. The support measure is anti-monotonic with respect to ≼, and2. Defining q ≡ q′ if and only if q ≼ q′ and q′ ≼ q, all equivalent queries have the same support.The main contributions of the thesis are, on the one hand to formally sudy properties of the pre-ordering and the equivalence relation mentioned above, and on the other hand, to prose a levewise, Apriori like algorithm for the computation of all frequent queries in a relational database defined over a star schema. Moreover, this algorithm has been implemented and the reported experiments show that, in our approach, runtime is acceptable, even in the case of large fact tables
Maniu, Silviu. "Gestion des données dans les réseaux sociaux". Thesis, Paris, ENST, 2012. http://www.theses.fr/2012ENST0053/document.
Pełny tekst źródłaWe address in this thesis some of the issues raised by the emergence of social applications on the Web, focusing on two important directions: efficient social search inonline applications and the inference of signed social links from interactions between users in collaborative Web applications. We start by considering social search in tagging (or bookmarking) applications. This problem requires a significant departure from existing, socially agnostic techniques. In a network-aware context, one can (and should) exploit the social links, which can indicate how users relate to the seeker and how much weight their tagging actions should have in the result build-up. We propose an algorithm that has the potential to scale to current applications, and validate it via extensive experiments. As social search applications can be thought of as part of a wider class of context-aware applications, we consider context-aware query optimization based on views, focusing on two important sub-problems. First, handling the possible differences in context between the various views and an input query leads to view results having uncertain scores, i.e., score ranges valid for the new context. As a consequence, current top-k algorithms are no longer directly applicable and need to be adapted to handle such uncertainty in object scores. Second, adapted view selection techniques are needed, which can leverage both the descriptions of queries and statistics over their results. Finally, we present an approach for inferring a signed network (a "web of trust")from user-generated content in Wikipedia. We investigate mechanisms by which relationships between Wikipedia contributors - in the form of signed directed links - can be inferred based their interactions. Our study sheds light into principles underlying a signed network that is captured by social interaction. We investigate whether this network over Wikipedia contributors represents indeed a plausible configuration of link signs, by studying its global and local network properties, and at an application level, by assessing its impact in the classification of Wikipedia articles.javascript:nouvelleZone('abstract');_ajtAbstract('abstract')
Phan, Duy-Hung. "Algorithmes d'aggrégation pour applications Big Data". Electronic Thesis or Diss., Paris, ENST, 2016. http://www.theses.fr/2016ENST0043.
Pełny tekst źródłaTraditional databases are facing problems of scalability and efficiency dealing with a vast amount of big-data. Thus, modern data management systems that scale to thousands of nodes, like Apache Hadoop and Spark, have emerged and become the de-facto platforms to process data at massive scales. In such systems, many data processing optimizations that were well studied in the database domain have now become futile because of the novel architectures and programming models. In this context, this dissertation pledged to optimize one of the most predominant operations in data processing: data aggregation for such systems.Our main contributions were the logical and physical optimizations for large-scale data aggregation, including several algorithms and techniques. These optimizations are so intimately related that without one or the other, the data aggregation optimization problem would not be solved entirely. Moreover, we integrated these optimizations in our multi-query optimization engine, which is totally transparent to users. The engine, the logical and physical optimizations proposed in this dissertation formed a complete package that is runnable and ready to answer data aggregation queries at massive scales. We evaluated our optimizations both theoretically and experimentally. The theoretical analyses showed that our algorithms and techniques are much more scalable and efficient than prior works. The experimental results using a real cluster with synthetic and real datasets confirmed our analyses, showed a significant performance boost and revealed various angles about our works. Last but not least, our works are published as open sources for public usages and studies
Saltin, Joakim. "Interactive visualization of financial data : Development of a visual data mining tool". Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-181225.
Pełny tekst źródłaOnder, Ibrahim Seckin. "Execution Of Distributed Database Queries On A Hpc System". Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/2/12611524/index.pdf.
Pełny tekst źródłaVerlaine, Lionel. "Optimisation des requêtes dans une machine bases de données". Paris 6, 1986. http://www.theses.fr/1986PA066532.
Pełny tekst źródłaPerez-Urbina, Hector M. "Tractable query answering for description logics via query rewriting". Thesis, University of Oxford, 2010. http://ora.ox.ac.uk/objects/uuid:cd62cd80-aa62-467b-87cd-4b9d0cfb2dbd.
Pełny tekst źródłaPreisinger, Timotheus. "Graph-based algorithms for Pareto preference query evaluation". Norderstedt Books on Demand, 2009. http://d-nb.info/1000465993/34.
Pełny tekst źródłaFaisal, Farhan. "Query-by-Pointing: Algorithms and Pointing Error Compensation". Fogler Library, University of Maine, 2003. http://www.library.umaine.edu/theses/pdf/FaisalF2003.pdf.
Pełny tekst źródłaPieris, Andreas. "Ontological query answering : new languages, algorithms and complexity". Thesis, University of Oxford, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.547515.
Pełny tekst źródłaCao, Phuong Thao. "Approximation of OLAP queries on data warehouses". Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00905292.
Pełny tekst źródłaWåreus, Linus, i Max Wällstedt. "Comparison and Implementation of Query Containment Algorithms for XPath". Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-186467.
Pełny tekst źródłaDenna rapport undersöker de praktiska aspekterna av att implementera Query Containment-algoritmer för queryspråket XPath. Query Containment är problemet att avgöra om resultaten av en query är en delmängd av resultaten av en annan query, oavsett databas. Query Containment-algoritmer kan användas för ändamålet att optimera queryingprocessen i databassystem. Två algoritmer har implementerats och jämförts, The Canonical Model och The Homomorphism Technique. Algoritmerna har jämförts med avseende på hastighet, lätthet att implementera, exakthet och användbarhet i riktiga databassystem. Prestandatester utvecklades för att mäta exekveringstider för algoritmerna på specifikt framtagna queries. Ett enkelt databassystem utvecklades för att undersöka prestandavinsten av att använda algoritmerna. Slutsatsen att The Homomorphism Technique presterar bättre än The Canonical Model i samtliga testfall med avseende på hastighet drogs. The Canonical Model är dock mer exakt än The Homomorphism Technique. Båda algoritmerna var lätta att implementera, men The Homomorphism Technique var lättare. I databassystemet fanns det en prestandavinst i att använda Query Containment-algoritmer för en viss typ av queries, men i de flesta fall var det en prestandaförlust. Ett databassystem som använder Query Containment-algoritmer för optimering bör för varje query avgöra om en sådan algoritm ska användas.
Eriksson, Simon. "COMPARING NATURAL LANGUAGE PROCESSING TO STRUCTURED QUERY LANGUAGE ALGORITHMS". Thesis, Umeå universitet, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-163310.
Pełny tekst źródłaThomazo, Michaël. "Conjunctive Query Answering Under Existential Rules - Decidability, Complexity, and Algorithms". Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2013. http://tel.archives-ouvertes.fr/tel-00925722.
Pełny tekst źródłaPreisinger, Timotheus [Verfasser]. "Graph-based algorithms for Pareto preference query evaluation / Timotheus Preisinger". Norderstedt : Books on Demand, 2009. http://d-nb.info/1000465993/34.
Pełny tekst źródłaDai, Xiangyuan. "Spatial queries based on non-spatial constraints". Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B38436395.
Pełny tekst źródłaDai, Xiangyuan, i 戴祥元. "Spatial queries based on non-spatial constraints". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B38436395.
Pełny tekst źródłaLiu, Kaiyang. "Efficient structural join processing algorithms /". View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?COMP%202005%20LIU.
Pełny tekst źródłaTrias, Mansilla Albert. "Unstructured P2P social search query routing algorithms for agentified social networks". Doctoral thesis, Universitat de Girona, 2013. http://hdl.handle.net/10803/131395.
Pełny tekst źródłaEl paradigma del poble presenta alguns beneficis enfront al de la biblioteca, com que les persones poden adaptar el contingut de la resposta en funció de qui tenen davant o fins i tot poden fer aclariments sobre el contingut, mentre el contingut dels textos es manté estàtic. La proliferació de les xarxes socials, conjuntament amb els avenços en intel·ligència artificial, permeten considerar l’automatització del paradigma del poble. Les contribucions d’aquesta tesi són: analitzar el paradigma del poble per veure quins aspectes són automatitzables; el protocol de cerca social Asknext, que utilitza missatges d’aturada; estudiar l’efecte de les característiques de les topologies de les xarxes socials en el protocol Asknext; l’algorisme Question Waves, que contribueix en millorar la rellevància de les respostes rebudes en el procés de cerca
Piwko, Karel. "Nativní XML rozhraní pro relační databázi". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-235541.
Pełny tekst źródłaZhang, Wangda, i 张望达. "Evaluating multi-way joins over discounted hitting time". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hdl.handle.net/10722/196484.
Pełny tekst źródłapublished_or_final_version
Computer Science
Master
Master of Philosophy
Yang, Jing. "Designing Superior Evolutionary Algorithms via Insights From Black-Box Complexity Theory". Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLX054/document.
Pełny tekst źródłaIt has been observed that the runtime of randomized search heuristics depend on one or more parameters. A number of results show an advantage of dynamic parameter settings, that is, the parameters of the algorithm are changed during its execution. In this work, we prove that the unary unbiased black-box complexity of the OneMax benchmark function class is $n ln(n) - cn pm o(n)$ for a constant $c$ which is between $0.2539$ and $0.2665$. This runtime can be achieved with a simple (1+1)-type algorithm using a fitness-dependent mutation strength. When translated into the fixed-budget perspective, our algorithm finds solutions which are roughly 13% closer to the optimum than those of the best previously known algorithms.Based on the analyzed optimal mutation strength for OneMax, we show that a self-adjusting choice of the number of bits to be flipped attains the same runtime (apart from $o(n)$ lower-order terms) and the same (asymptotic) 13% fitness-distance improvement over RLS. The adjusting mechanism is to adaptively learn the currently optimal mutation strength from previous iterations. This aims both at exploiting that generally different problems may need different mutation strengths and that for a fixed problem different strengths may become optimal in different stages of the optimization process.We then extend our self-adjusting strategy to population-based evolutionary algorithms in discrete search spaces. Roughly speaking, it consists of creating half the offspring with a mutation rate that is twice the current mutation rate and the other half with half the current rate. The mutation rate is then updated to the rate used in that subpopulation which contains the best offspring. We analyze how the $(1+lambda)$ evolutionary algorithm with this self-adjusting mutation rate optimizes the OneMax test function. We prove that this dynamic version of the $(1+lambda)$~EA finds the optimum in an expected optimization time (number of fitness evaluations) of $O(nlambda/loglambda+nlog n)$. This time is asymptotically smaller than the optimization time of the classic $(1+lambda)$ EA. Previous work shows that this performance is best-possible among all $lambda$-parallel mutation-based unbiased black-box algorithms.We also propose and analyze a self-adaptive version of the $(1,lambda)$ evolutionary algorithm in which the current mutation rate is part of the individual and thus also subject to mutation. A rigorous runtime analysis on the OneMax benchmark function reveals that a simple local mutation scheme for the rate leads to an expected optimization time of the best possible $O(nlambda/loglambda+nlog n)$. Our result shows that self-adaptation in evolutionary computation can find complex optimal parameter settings on the fly. At the same time, it proves that a relatively complicated self-adjusting scheme for the mutation rate can be replaced by our simple endogenous scheme
Zavodny, Jakub. "Factorisation in relational databases". Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:54c9a3a7-caac-40d9-90fb-83797ced9c5a.
Pełny tekst źródłaWaite, Edwin Richard. "Web Based Query Optimization Simulator". CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2519.
Pełny tekst źródłaWang, Wei. "Structural join : processing algorithms and size estimation /". View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20WANG.
Pełny tekst źródłaIncludes bibliographical references (leaves 107-120). Also available in electronic version. Access restricted to campus users.
Palacios, Villa Jesus Alejandro. "CGU: A common graph utility for DL Reasoning and Conjunctive Query Optimization". Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1101.
Pełny tekst źródłaOur main contributions are as follows. We present the design and implementation of a common graph utility that integrates the requirements for both CQO and DL reasoning. We then verify this model by also presenting the design and implementation for two drivers, one that implements a query optimizer for a conjunctive query language extended with descriptions, and one that implements a complete DL reasoner for a feature based DL dialect.
Yang, Yin. "Join processing in non-conventional databases /". View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?CSED%202009%20YANG.
Pełny tekst źródłaPoppe, Olga. "Event stream analytics". Digital WPI, 2018. https://digitalcommons.wpi.edu/etd-dissertations/530.
Pełny tekst źródłaCalonder, Michael. "Multi-objective clustering of gene expression data with evolutionary algorithms a query gene approach /". Zürich : ETH, Eidgenössische Technische Hochschule Zürich, Institut für Technische Informatik und Kommunikationsnetze, 2006. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=229.
Pełny tekst źródłaRode, Henning. "Methods and cost models for XPath Query Processing in main memory databases". [S.l. : s.n.], 2003. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB11051694.
Pełny tekst źródłaYe, Xun. "Design and Implementation of Routing Algorithms for Supporting Multi-dimensional Range Query in HD Tree". Thesis, University of Ottawa (Canada), 2011. http://hdl.handle.net/10393/28826.
Pełny tekst źródła