Sciweavers

59 search results - page 8 / 12
» An External Memory Data Structure for Shortest Path Queries
Sort
View
PVLDB
2010
122views more  PVLDB 2010»
13 years 5 months ago
On Graph Query Optimization in Large Networks
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
Peixiang Zhao, Jiawei Han
DEBU
2010
128views more  DEBU 2010»
13 years 4 months ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...
ICDE
2006
IEEE
112views Database» more  ICDE 2006»
14 years 8 months ago
XSEED: Accurate and Fast Cardinality Estimation for XPath Queries
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel,...
Ashraf Aboulnaga, Ihab F. Ilyas, M. Tamer Özs...
INFORMATICALT
2006
116views more  INFORMATICALT 2006»
13 years 7 months ago
Optimized on Demand Routing Protocol of Mobile Ad Hoc Network
In this paper optimization of DSR is achieved using New Link Cache structure and Source Transparent Route Maintenance Method. The new link cache effectively utilizes the memory by ...
Chinnappan Jayakumar, Chenniappan Chellappan
SODA
1994
ACM
105views Algorithms» more  SODA 1994»
13 years 8 months ago
Approximate Data Structures with Applications
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young