Sciweavers

958 search results - page 2 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 4 months ago
Multidimensional Data Structures and Techniques for Efficient Decision Making
: - In this paper we present several novel efficient techniques and multidimensional data structures which can improve the decision making process in many domains. We consider onli...
Madalina Ecaterina Andreica, Mugurel Ionut Andreic...
COCOON
1998
Springer
13 years 8 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
DATESO
2009
119views Database» more  DATESO 2009»
13 years 2 months ago
Efficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
Peter Chovanec, Michal Krátký
PVLDB
2008
138views more  PVLDB 2008»
13 years 4 months ago
A skip-list approach for efficiently processing forecasting queries
Time series data is common in many settings including scientific and financial applications. In these applications, the amount of data is often very large. We seek to support pred...
Tingjian Ge, Stanley B. Zdonik
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
14 years 5 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh