Results 1 - 10 of 665

Accelerating Queries on Very Large Datasets

by Ekow Otoo, Kesheng Wu , 2009
"... In this chapter, we explore ways to answer queries on large multi-dimensional data efficiently. Given a large dataset, a user often wants to access only a relatively small number of the records. Such a selection process is typically performed through an SQL query in a database management system (DBM ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
(DBMS). In general, the most effective technique to accelerate the query answering process is indexing. For this reason, our primary emphasis is to review indexing techniques for large datasets. Since much of scientific data is not under the management of DBMS systems, our review includes many indexing

ACCELERATING QUERY-BY-HUMMING ON GPU

by Pascal Ferraro, Laurent Imbert, Pierre Hanna, Thomas Izard
"... Searching for similarities in large musical databases has become a common procedure. Local alignment methods, based on dynamic programming, explore all the possible matchings between two musical pieces; and as a result return the optimal local alignment. Unfortunately these very powerful methods hav ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
motivation of this work is to exploit the huge computational power of commonly available graphic cards to develop high performance solutions for Query-by-Humming applications. In this paper, we present a fast implementation of a local alignment method, which allows to retrieve a hummed query in a database

Accelerating Queries with Group-By and Join by Groupjoin

by Guido Moerkotte, Thomas Neumann , 2011
"... Most aggregation queries contain both group-by and join operators, and spend a significant amount of time evaluating these two expensive operators. Merging them into one operator (the groupjoin) significantly speeds up query execution. We introduce two main equivalences to allow for the merging and ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Most aggregation queries contain both group-by and join operators, and spend a significant amount of time evaluating these two expensive operators. Merging them into one operator (the groupjoin) significantly speeds up query execution. We introduce two main equivalences to allow for the merging

Fast subsequence matching in time-series databases

by Christos Faloutsos, M. Ranganathan, Yannis Manolopoulos - PROCEEDINGS OF THE 1994 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA , 1994
"... We present an efficient indexing method to locate 1-dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature space ..."
Abstract - Cited by 533 (24 self) - Add to MetaCart
We present an efficient indexing method to locate 1-dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature

Vries. Combining indexing schemes to accelerate querying XML on content and structure

by Georgina Ramírez - Proc. CAAP'96. Lecture Notes in Comput. Sci. 1059:2--16 , 2004
"... This paper presents the advantages of combining multiple document representation schemes for query processing of XML queries on content and structure. We show how extending the Text Region approach [2] with the main features of the Binary Relation approach developed in [8] leads to a considerable sp ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
This paper presents the advantages of combining multiple document representation schemes for query processing of XML queries on content and structure. We show how extending the Text Region approach [2] with the main features of the Binary Relation approach developed in [8] leads to a considerable

Combining indexing schemes to accelerate querying XML on content and structure

by Arjen P. De Vries
"... This paper presents the advantages of combining multiple document representation schemes for query processing of XML queries on content and structure. We show how ex-tending the Text Region approach [2] with the main features of the Binary Relation approach developed in [8] leads to a considerable s ..."
Abstract - Add to MetaCart
This paper presents the advantages of combining multiple document representation schemes for query processing of XML queries on content and structure. We show how ex-tending the Text Region approach [2] with the main features of the Binary Relation approach developed in [8] leads to a considerable

Accelerating XPath location steps

by Torsten Grust - ACM SIGMOD Int. Conference on Management of Data , 2002
"... This work is a proposal for a database index structure that has been specifically designed to support the evaluation of XPath queries. As such, the index is capable to support all XPath axes (including ancestor, following, precedingsibling, descendant-or-self, etc.). This feature lets the index stan ..."
Abstract - Cited by 261 (18 self) - Add to MetaCart
This work is a proposal for a database index structure that has been specifically designed to support the evaluation of XPath queries. As such, the index is capable to support all XPath axes (including ancestor, following, precedingsibling, descendant-or-self, etc.). This feature lets the index

Covering Indexes for Branching Path Queries

by Raghav Kaushik, Philip Bohannon, Jeffrey F Naughton, Henry F Korth , 2002
"... In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tree- or graph-structured XML data. Our answer is yes-- the forward-and-backward index already proposed in the literature c ..."
Abstract - Cited by 127 (2 self) - Add to MetaCart
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tree- or graph-structured XML data. Our answer is yes-- the forward-and-backward index already proposed in the literature

Accelerating Spatial Range Queries

by Ros Stougiannis, Farhan Tauheed, Thomas Heinis, Anastasia Ailamaki
"... It is increasingly common for domain scientists to use computational tools to build and simulate spatial models of the phenomena they are studying. The spatial models they build are more and more detailed as well as dense and are consequently difficult to manage with today’s tools. A crucial problem ..."
Abstract - Add to MetaCart
problem when analyzing spatial models of increasing detail is the scalable execution of range queries. State-ofthe-art approaches like the R-Tree perform suboptimally on today’s models and do not scale for more dense, future models. The problem is that the amount of overlap in the tree structure increases

Fast proximity queries with swept sphere volumes

by Eric Larsen, Stefan Gottschalk, Ming C. Lin, Dinesh Manocha , 1999
"... We present novel algorithms for fast proximity queries using swept sphere volumes. The set of proximity queries includes collision detection and both exact and approximate separation distance computation. We introduce a new family of bounding volumes that correspond to a core primitive shape grown ..."
Abstract - Cited by 127 (20 self) - Add to MetaCart
. We present a novel analysis of proximity queries that highlights the relationship between collision detection and distance computation. We also present traversal techniques for accelerating distance queries. These algorithms have been used to perform proximity queries for applications including
Results 1 - 10 of 665