Sciweavers

1933 search results - page 244 / 387
» Query Containment Using Views
Sort
View
SSD
2005
Springer
153views Database» more  SSD 2005»
15 years 8 months ago
Constrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...
IPPS
2000
IEEE
15 years 7 months ago
Parallel Information Retrieval on an SCI-Based PC-NOW
This paper presents an efficient parallel information retrieval (IR) system which provides fast information service for the Internet users on lowcost high-performance PC-NOW enviro...
Sang-Hwa Chung, Hyuk-Chul Kwon, Kwang Ryel Ryu, Ha...
PSB
2003
15 years 4 months ago
MAP: Searching Large Genome Databases
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
Tamer Kahveci, Ambuj K. Singh
IJCAI
1997
15 years 4 months ago
Toward Structured Retrieval in Semi-structured Information Spaces
A semi-structured information space consists of multiple collections of textual documents containing fielded or tagged sections. The space can be highly heterogeneous, because eac...
Scott B. Huffman, Catherine Baudin
BMCBI
2010
183views more  BMCBI 2010»
15 years 3 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...