Sciweavers

2859 search results - page 376 / 572
» Querying Complex Structured Databases
Sort
View
114
Voted
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
15 years 6 months ago
Lower Bounds for Dynamic Algorithms
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
Michael L. Fredman
132
Voted
IPL
2006
103views more  IPL 2006»
15 years 2 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen
103
Voted
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
15 years 11 months ago
Top-k Correlative Graph Mining.
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
159
Voted
BMCBI
2006
164views more  BMCBI 2006»
15 years 2 months ago
BIOZON: a system for unification, management and analysis of heterogeneous biological data
Integration of heterogeneous data types is a challenging problem, especially in biology, where the number of databases and data types increase rapidly. Amongst the problems that o...
Aaron Birkland, Golan Yona
SSD
2009
Springer
180views Database» more  SSD 2009»
15 years 9 months ago
Indexing Moving Objects Using Short-Lived Throwaway Indexes
With the exponential growth of moving objects data to the Gigabyte range, it has become critical to develop effective techniques for indexing, updating, and querying these massive ...
Jens Dittrich, Lukas Blunschi, Marcos Antonio Vaz ...