Sciweavers

777 search results - page 69 / 156
» Optimization of Relational Preference Queries
Sort
View
160
Voted
WWW
2011
ACM
14 years 9 months ago
Rewriting queries on SPARQL views
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, ...
Wangchao Le, Songyun Duan, Anastasios Kementsietsi...
216
Voted
VLDB
2001
ACM
168views Database» more  VLDB 2001»
16 years 2 months ago
Answering queries using views: A survey
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessin...
Alon Y. Halevy
209
Voted
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
16 years 4 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
123
Voted
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
16 years 3 months ago
Mining long-term search history to improve search accuracy
Long-term search history contains rich information about a user's search preferences. In this paper, we study statistical language modeling based methods to mine contextual i...
Bin Tan, Xuehua Shen, ChengXiang Zhai
146
Voted
DPD
2002
168views more  DPD 2002»
15 years 2 months ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,...