Sciweavers

611 search results - page 11 / 123
» Querying Tree-Structured Data Using Dimension Graphs
Sort
View
DEXA
2005
Springer
80views Database» more  DEXA 2005»
14 years 1 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
MOBIQUITOUS
2007
IEEE
14 years 1 months ago
Assessing Standard and Inverted Skip Graphs Using Multi-Dimensional Range Queries and Mobile Nodes
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
Gregory J. Brault, Christopher J. Augeri, Barry E....
ESWS
2005
Springer
14 years 1 months ago
Querying RDF Data from a Graph Database Perspective
Abstract. This paper studies the RDF model from a database perspective. From this point of view it is compared with other database models, particularly with graph database models, ...
Renzo Angles, Claudio Gutiérrez
AISC
2010
Springer
14 years 14 days ago
Dimensions of Formality: A Case Study for MKM in Software Engineering
Abstract. We study the formalization process of a collection of documents created for a Software Engineering project from an MKM perspective. We analyze how document and collection...
Andrea Kohlhase, Michael Kohlhase, Christoph Lange...
AIA
2006
13 years 9 months ago
Efficient Algorithm for Calculating Similarity between Trajectories Containing an Increasing Dimension
Time series data is usually stored and processed in the form of discrete trajectories of multidimensional measurement points. In order to compare the measurements of a query traje...
Perttu Laurinen, Pekka Siirtola, Juha Röning