2859 search results - page 279 / 572 » Querying Complex Structured Databases |
157
click to vote
TCS
2008
15 years 6 months ago
2008
We develop a unified framework for dealing with constructibility and absoluteness in set theory, decidability of relations in effective structures (like the natural numbers), and ...
308
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
163
click to vote
VLDB
2005
ACM
16 years 1 days ago
2005
ACM
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
214
click to vote
DASFAA
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract. Continuous monitoring of spatial queries has received significant research attention in the past few years. In this paper, we propose two efficient algorithms for the con...
203
click to vote
ER
2008
Springer
15 years 8 months ago
2008
Springer
Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and ...