Sciweavers

128 search results - page 19 / 26
» Efficient Evaluation of Multiple Preference Queries
Sort
View
VLDB
1994
ACM
118views Database» more  VLDB 1994»
13 years 11 months ago
Query Optimization by Predicate Move-Around
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagi...
CIKM
2008
Springer
13 years 9 months ago
MedSearch: a specialized search engine for medical information retrieval
People are thirsty for medical information. Existing Web search engines often cannot handle medical search well because they do not consider its special requirements. Often a medi...
Gang Luo, Chunqiang Tang, Hao Yang, Xing Wei
CIKM
2006
Springer
13 years 11 months ago
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
Dimitri Theodoratos, Stefanos Souldatos, Theodore ...
VLDB
1998
ACM
87views Database» more  VLDB 1998»
13 years 11 months ago
Fast High-Dimensional Data Search in Incomplete Databases
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the ...
Beng Chin Ooi, Cheng Hian Goh, Kian-Lee Tan
IWOMP
2010
Springer
13 years 9 months ago
How OpenMP Applications Get More Benefit from Many-Core Era
With the approaching of the many-core era, it becomes more and more difficult for a single OpenMP application to efficiently utilize all the available processor cores. On the other...
Jianian Yan, Jiangzhou He, Wentao Han, Wenguang Ch...