Sciweavers

75 search results - page 4 / 15
» Comparing Nested GPSJ Queries in Multidimensional Databases
Sort
View
INFOSCALE
2007
ACM
13 years 6 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou
SSDBM
2000
IEEE
87views Database» more  SSDBM 2000»
13 years 9 months ago
A Tool for Nesting and Clustering Large Objects
In implementations of non-standard database systems, large objects are often embedded within an aggregate of different types, i.e. a tuple. For a given size and access probabilit...
Stefan Dieker, Ralf Hartmut Güting, Miguel Ro...
SIGMOD
1996
ACM
133views Database» more  SIGMOD 1996»
13 years 9 months ago
Multi-dimensional Resource Scheduling for Parallel Queries
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
Minos N. Garofalakis, Yannis E. Ioannidis
ICDT
1995
ACM
96views Database» more  ICDT 1995»
13 years 8 months ago
On Two Forms of Structural Recursion
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
Dan Suciu, Limsoon Wong
ADBIS
2004
Springer
122views Database» more  ADBIS 2004»
13 years 10 months ago
Implementing a Query Language for Context-Dependent Semistructured Data
Abstract. In today’s global environment, the structure and presentation of information may depend on the underlying context of the user. To address this issue, in previous work w...
Yannis Stavrakas, Kostis Pristouris, Antonis Efand...