649 search results - page 42 / 130 » Improved and Optimized Partitioning Techniques in Database Q... |
129
Voted
GEOINFO
2003
15 years 3 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...
109
click to vote
ESA
2010
Springer
15 years 3 months ago
2010
Springer
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...
120
Voted
ICDCS
2005
IEEE
15 years 7 months ago
2005
IEEE
Database queries, in particular, event-driven continuous queries, are useful for many pervasive computing applications, such as video surveillance. In order to enable these applic...
ICDE
2010
IEEE
15 years 8 months ago
2010
IEEE
— Information extraction systems are traditionally implemented as a pipeline of special-purpose processing modules. A major drawback of such an approach is that whenever a new ex...
200
click to vote
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
We present our prototype system, OMCAT, which optimizes the reevaluation of a set of pending continuous spatio-temporal queries on trajectory data, when some of the trajectories a...