Sciweavers

907 search results - page 7 / 182
» Efficient Optimization of Iterative Queries
Sort
View
PODS
2003
ACM
158views Database» more  PODS 2003»
14 years 7 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
ICDE
2007
IEEE
175views Database» more  ICDE 2007»
14 years 9 months ago
Dynamic Batch Nearest Neighbor Search in Video Retrieval
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
Jie Shao, Zi Huang, Heng Tao Shen, Xiaofang Zhou, ...
CORR
1999
Springer
116views Education» more  CORR 1999»
13 years 7 months ago
Efficient and Extensible Algorithms for Multi Query Optimization
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...
Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bh...
ACL
2006
13 years 9 months ago
An Iterative Implicit Feedback Approach to Personalized Search
General information retrieval systems are designed to serve all users without considering individual needs. In this paper, we propose a novel approach to personalized search. It c...
Yuanhua Lv, Le Sun, Junlin Zhang, Jian-Yun Nie, Wa...
PVLDB
2008
100views more  PVLDB 2008»
13 years 7 months ago
Efficiently approximating query optimizer plan diagrams
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...
Atreyee Dey, Sourjya Bhaumik, Harish D., Jayant R....