2859 search results - page 232 / 572 » Querying Complex Structured Databases |
201
Voted
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
A defining characteristic of continuous queries over on-line data streams, possibly bounded by sliding windows, is the potentially infinite and time-evolving nature of their input...
220
click to vote
VLDB
2003
ACM
16 years 2 months ago
2003
ACM
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
126
Voted
GEOS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Often the information present in a spatial knowledge base is represented at a different level of granularity and abstraction than the query constraints. For querying onto...
129
Voted
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
120
Voted
DASFAA
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract. Visibility query is fundamental to many analysis and decisionmaking tasks in virtual environments. Visibility computation is time complex and the complexity escalates in ...