Sciweavers

668 search results - page 23 / 134
» Algorithmics and Applications of Tree and Graph Searching
Sort
View
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 8 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
ER
2006
Springer
112views Database» more  ER 2006»
15 years 5 months ago
A DAG Comparison Algorithm and Its Application to Temporal Data Warehousing
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
Johann Eder, Karl Wiggisser
146
Voted
BMCBI
2008
208views more  BMCBI 2008»
15 years 2 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
15 years 6 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
WSC
2008
15 years 4 months ago
The improved sweep metaheuristic for simulation optimization and application to job shop scheduling
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
George Jiri Mejtsky