Sciweavers

2001 search results - page 204 / 401
» Indexing in a Hypertext Database
Sort
View
ICDE
2010
IEEE
233views Database» more  ICDE 2010»
14 years 3 months ago
Polynomial heuristics for query optimization
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...
Nicolas Bruno, César A. Galindo-Legaria, Mi...
DEXAW
2003
IEEE
158views Database» more  DEXAW 2003»
14 years 3 months ago
Temporal Information Retrieval in Cooperative Search Engine
In business, the retrieval of up-to-date, or fresh, information is very important. It is difficult for conventional search engines based on a centralized architecture to retrieve ...
Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai
ER
1999
Springer
152views Database» more  ER 1999»
14 years 2 months ago
Semantically Accessing Documents Using Conceptual Model Descriptions
. When publishing documents on the web, the user needs to describe and classify her documents for the benefit of later retrieval and use. This paper presents an approach to semanti...
Terje Brasethvik, Jon Atle Gulla
VLDB
1999
ACM
107views Database» more  VLDB 1999»
14 years 2 months ago
The Value of Merge-Join and Hash-Join in SQL Server
Microsoft SQL Server was successful for many years for transaction processing and decision support workloads with neither merge join nor hash join, relying entirely on nested loop...
Goetz Graefe
VLDB
1998
ACM
120views Database» more  VLDB 1998»
14 years 2 months ago
Algorithms for Querying by Spatial Structure
: Structural queries constitute a special form of content-basedretrieval where the user specifiesa set of spatial constraints among query variables and asks for all configurations ...
Dimitris Papadias, Nikos Mamoulis, Vasilis Delis