Spelling suggestions: "subject:"query languages"" "subject:"query ianguages""
1 |
Data modelling, subtyping and functional programmingHowells, William Gareth James January 1991 (has links)
No description available.
|
2 |
Continuous monitoring of multi-dimensional queries /Mouratidis, Kyriakos. January 2006 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2006. / Includes bibliographical references (leaves 144-146). Also available in electronic version.
|
3 |
Spatial queries based on non-spatial constraintsDai, Xiangyuan., 戴祥元. January 2006 (has links)
published_or_final_version / abstract / Computer Science / Master / Master of Philosophy
|
4 |
Spatial queries based on non-spatial constraintsDai, Xiangyuan. January 2006 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2007. / Title proper from title frame. Also available in printed format.
|
5 |
Adaptive scheduling algorithm selection in a streaming query systemPielech, Bradford Charles. January 2003 (has links)
Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: streaming query; query processing; database. Includes bibliographical references (p. 57-59).
|
6 |
Evaluating multi-way joins over discounted hitting timeZhang, Wangda, 张望达 January 2013 (has links)
The prevalence of graphs in emerging applications has recently raised a lot of research interests. To acquire interesting information hidden in large graphs, tasks including link prediction, collaborative recommendation, and reputation ranking, all make use of proximities between graph nodes. The discounted hitting time (DHT), which is a random-walk similarity measure for graph node pairs, has shown to be useful in various applications. In this thesis, we examine a novel query, called the multi-way join (or n-way join), over DHT scores. Given a graph and n sets of nodes, the n-way join retrieves a ranked list of n-tuples with the k highest scores, according to some aggregation function of DHT values. By extracting such top-k results, this query enables the analysis and prediction of various complex relationships among n sets of nodes on a large graph.
Since an n-way join is expensive to evaluate, we develop the Partial Join algorithm (or PJ). This solution decomposes an n-way join into a number of top-m 2-way joins, and combines their results to construct the answer of the n-way join. Since the process of PJ may necessitate the computation of top-(m + 1) 2-way joins, we study an incremental solution, which saves the trouble of recomputation and allows the results of top-(m+1) 2-way join to be derived quickly from the top-m 2-way join results earlier computed. For better performance, we further examine efficient processing algorithms and pruning techniques for 2-way joins. Through extensive experiments on three real graph datasets, we show that the proposed PJ algorithm accurately evaluates n-way joins, and is four orders of magnitude faster than basic solutions. / published_or_final_version / Computer Science / Master / Master of Philosophy
|
7 |
A multi-paradigm query interface for an object-oriented databaseDoan, Dac Khoa January 1996 (has links)
No description available.
|
8 |
Multiple continuous query processing with relative window predicates "Juggler"Silva, Asima. January 2004 (has links)
Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: reordering predicates; multi-join operator; sliding windows; window predicates; join algorithm; continuous queries. Includes bibliographical references (p. 101-103).
|
9 |
Query-by-pointing: algorithms and pointing error compensation /Faisal, Farhan, January 2003 (has links) (PDF)
Thesis (M.S.) in Spatial Information Science and Engineering--University of Maine, 2003. / Includes vita. Includes bibliographical references (leaves 86-91).
|
10 |
Spatial and continuous spatial queries on smart mobile clients /Hu, Haibo. January 2005 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2005. / Vita. Includes bibliographical references (leaves 136-145). Also available in electronic version.
|
Page generated in 0.0431 seconds