Sciweavers

2859 search results - page 135 / 572
» Querying Complex Structured Databases
Sort
View
MOBIDE
2005
ACM
14 years 1 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
SIGMETRICS
2000
ACM
14 years 17 days ago
An analytical model of the working-set sizes in decision-support systems
This paper presents an analytical model to study how working sets scale with database size and other applications parameters in decision-support systems (DSS). The model uses appl...
Magnus Karlsson, Per Stenström
SIGMOD
2003
ACM
96views Database» more  SIGMOD 2003»
14 years 8 months ago
Toward network data independence
A number of researchers have become interested in the design of global-scale networked systems and applications. Our thesis here is that the database community's principles a...
Joseph M. Hellerstein
BIBE
2003
IEEE
183views Bioinformatics» more  BIBE 2003»
14 years 1 months ago
Effective Indexing and Filtering for Similarity Search in Large Biosequence Databases
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...
Ozgur Ozturk, Hakan Ferhatosmanoglu
DASFAA
1999
IEEE
79views Database» more  DASFAA 1999»
14 years 16 days ago
Early Separation of Filter and Refinement Steps in Spatial Query Optimization
The spatial query has been processed in two steps, the filter step and the refinement step, due to a large volume and high complexity of the spatial data. However, this approach h...
Ho-Hyun Park, Chan-Gun Lee, Yong-Ju Lee, Chin-Wan ...