Sciweavers

6905 search results - page 57 / 1381
» Querying Multidimensional Databases
Sort
View
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
14 years 11 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
VLDB
2007
ACM
105views Database» more  VLDB 2007»
14 years 10 months ago
Using a distributed quadtree index in peer-to-peer networks
Abstract Peer-to-peer (P2P) networks have become a powerful means for online data exchange. Currently, users are primarily utilizing these networks to perform exact-match queries a...
Egemen Tanin, Aaron Harwood, Hanan Samet
ICDE
1991
IEEE
145views Database» more  ICDE 1991»
14 years 1 months ago
DOT: A Spatial Access Method Using Fractals
Existing Database Management Systems (DBMSs) do not handle efficiently multi-dimensional data such as boxes, polygons, or even points in a multi-dimensional space. We examine acc...
Christos Faloutsos, Yi Rong
ICDE
2004
IEEE
137views Database» more  ICDE 2004»
14 years 11 months ago
Selectivity Estimation for XML Twigs
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
CCGRID
2005
IEEE
14 years 3 months ago
Servicing range queries on multidimensional datasets with partial replicas
Partial replication is one type of optimization to speed up execution of queries submitted to large datasets. In partial replication, a portion of the dataset is extracted, re-org...
Li Weng, Ümit V. Çatalyürek, Tahs...