Sciweavers

777 search results - page 68 / 156
» Optimization of Relational Preference Queries
Sort
View
IDEAS
2007
IEEE
148views Database» more  IDEAS 2007»
14 years 4 months ago
Boundedness of Regular Path Queries in Data Integration Systems
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
Gösta Grahne, Alex Thomo
WEBI
2010
Springer
13 years 8 months ago
An Efficient Method for Tagging a Query with Category Labels Using Wikipedia towards Enhancing Search Engine Results
This paper intends to present a straightforward, extensive, and noise resistant method for efficiently tagging a web query, submitted to a search engine, with proper category label...
Milad Alemzadeh, Fakhri Karray
JODS
2006
206views Data Mining» more  JODS 2006»
13 years 10 months ago
Emergent Semantics in Knowledge Sifter: An Evolutionary Search Agent Based on Semantic Web Services
This paper addresses the various facets of emergent semantics in content retrieval systems such as Knowledge Sifter, an architecture and system based on the use of specialized agen...
Larry Kerschberg, Hanjo Jeong, Wooju Kim
PLDI
1995
ACM
14 years 1 months ago
APT: A Data Structure for Optimal Control Dependence Computation
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
Keshav Pingali, Gianfranco Bilardi
PVLDB
2010
123views more  PVLDB 2010»
13 years 8 months ago
Sharing-Aware Horizontal Partitioning for Exploiting Correlations During Query Processing
Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each ...
Kostas Tzoumas, Amol Deshpande, Christian S. Jense...