491 search results - page 9 / 99 » Optimizing complex queries with multiple relation instances |
SSDBM
2005
IEEE
14 years 1 months ago
2005
IEEE
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a pr...
IJCAI
2001
13 years 8 months ago
2001
Supervised and unsupervised learning methods have traditionally focused on data consisting of independent instances of a single type. However, many real-world domains are best des...
SIGMOD
1996
ACM
13 years 11 months ago
1996
ACM
Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods a...
COCO
2000
Springer
13 years 12 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
ICDE
2007
IEEE
14 years 1 months ago
2007
IEEE
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...