6746 search results - page 487 / 1350 » Multimodal Database Query |
154
Voted
PODS
2003
ACM
16 years 6 months ago
2003
ACM
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...
130
Voted
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
166
click to vote
SIGMOD
1999
ACM
15 years 10 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
178
click to vote
SIGMOD
1996
ACM
15 years 10 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...
183
click to vote
GEOINFO
2003
15 years 7 months ago
2003
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...