- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 31 to 40 of 95 (0.034 seconds)Spelling suggestions: "subject:"query languages"" "subject:"query ianguages""
| 31 |
Aggregate nearest neighbor queries /Hui, Michael Chun Kit. January 2004 (has links)
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004. / Includes bibliographical references (leaves 91-95). Also available in electronic version. Access restricted to campus users.
|
| 32 |
Join processing in non-conventional databases /Yang, Yin. January 2009 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2009. / Includes bibliographical references (p. 92-97).
|
| 33 |
Optimization of queries with case expressions /Wang, Qiong. January 2007 (has links)
Thesis (M.Sc.)--York University, 2007. Graduate Programme in Computer Science / Typescript. Includes bibliographical references. Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR32031
|
| 34 |
D-CAPE -- A self-tuning continuous query plan distribution architectureSutherland, Timothy Michael. January 2004 (has links)
Thesis (M.S.) -- Worcester Polytechnic Institute. / Keywords: data stream; data management; continuous query; distributed.
|
| 35 |
VAMANA -- A high performance, scalable and cost driven XPath engineRaghavan, Venkatesh. January 2004 (has links)
Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: query optimization; cost estimation; XPath engine; query processing; index-based execution Includes bibliographical references. (p.49-51)
|
| 36 |
K-nearest-neighbor queries with non-spatial predicates on range attributes /Wong, Wing Sing. January 2005 (has links)
Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2005. / Includes bibliographical references (leaves 60-61). Also available in electronic version.
|
| 37 |
Efficient structural join processing algorithms /Liu, Kaiyang. January 2005 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2005. / Includes bibliographical references (leaves 77-84). Also available in electronic version.
|
| 38 |
Design, implementation and performance tests for query sampling in DB2 /Guo, Junjie. January 2004 (has links)
Thesis (M.Sc.)--York University, 2004. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 112-116). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: LINK NOT YET AVAILABLE.
|
| 39 |
Integrating a universal query mechanism into Java /Robinson, Aaron R. January 2007 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 2007. / Typescript. Includes bibliographical references (leaves 47-48).
|
| 40 |
State spill policies for state intensive continuous query plan evaluationJbantova, Mariana G. January 2007 (has links)
Thesis (M.S.) -- Worcester Polytechnic Institute. / Keywords: Continuous query processing; Adaptation policies; Partitioned window join operator. Includes bibliographical references (p.).
|
Page generated in 0.0393 seconds