4438 search results - page 202 / 888 » Speculative Query Processing |
215
click to vote
MDM
2010
Springer
15 years 9 months ago
2010
Springer
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
202
click to vote
PVLDB
2010
15 years 5 months ago
2010
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
197
click to vote
EPEW
2008
Springer
15 years 8 months ago
2008
Springer
We define a mechanism for specifying performance queries which combine instantaneous observations of model states and finite sequences of observations of model activities. We reali...
193
click to vote
DBVIS
1993
15 years 11 months ago
1993
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
280
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Linguistic research and natural language processing employ large repositories of ordered trees. XML, a standard ordered tree model, and XPath, its associated language, are natural...