Sciweavers

236
Voted
ICDE
1999
IEEE
113views Database» more  ICDE 1999»
16 years 6 months ago
I/O Complexity for Range Queries on Region Data Stored Using an R-tree
In this paper we study the node distribution of an Rtree storing region data, like for instance islands, lakes or human-inhabited areas. We will show that real region datasets are...
Guido Proietti, Christos Faloutsos
ICDE
1999
IEEE
140views Database» more  ICDE 1999»
16 years 6 months ago
Multiversion Reconciliation for Mobile Databases
As mobile computing devices become more and more popular, mobile databases have started gaining popularity. An important feature of these database systems is their ability to allo...
Shirish Hemant Phatak, B. R. Badrinath
ICDE
1999
IEEE
117views Database» more  ICDE 1999»
16 years 6 months ago
Semantic Brokering over Dynamic Heterogeneous Data Sources in InfoSleuth
InfoSleuth1is an agent-based system for information discovery and retrieval in a dynamic, open environment. This paper discusses InfoSleuth's multibroker design and implement...
Marian H. Nodine, William Bohrer, Anne H. H. Ngu
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 6 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
ICDE
1999
IEEE
143views Database» more  ICDE 1999»
16 years 6 months ago
Query Routing in Large-Scale Digital Library Systems
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous, and distributed collection of information sources. However, the inc...
Ling Liu