Sciweavers

777 search results - page 50 / 156
» Optimization of Relational Preference Queries
Sort
View
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
14 years 10 months ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold
VLDB
2004
ACM
126views Database» more  VLDB 2004»
14 years 2 months ago
ROX: Relational Over XML
An increasing percentage of the data needed by business applications is being generated in XML format. Storing the XML in its native format will facilitate new applications that e...
Alan Halverson, Vanja Josifovski, Guy M. Lohman, H...
MOBIDE
2009
ACM
14 years 3 months ago
Toward context and preference-aware location-based services
The explosive growth of location-detection devices, wireless communications, and mobile databases has resulted in the realization of location-based services as commercial products...
Mohamed F. Mokbel, Justin J. Levandoski
ICDE
1998
IEEE
153views Database» more  ICDE 1998»
14 years 10 months ago
Flattening an Object Algebra to Provide Performance
Algebraic transformation and optimization techniques have been the method of choice in relational query execution, but applying them in OODBMS is difficult due to the complexity o...
Peter A. Boncz, Annita N. Wilschut, Martin L. Kers...
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
14 years 16 days ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen