1888 search results - page 175 / 378 » Algorithms for Querying by Spatial Structure |
147
click to vote
PRICAI
1998
Springer
15 years 8 months ago
1998
Springer
Weaddress the general problemof finding algorithms for efficient, qualitative, point-basedtemporalreasoning over a set of operations. Weconsider general reasonerstailored for temp...
237
click to vote
PODS
2009
ACM
16 years 5 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
249
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...
146
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
150
click to vote
IDEAS
2008
IEEE
15 years 10 months ago
2008
IEEE
As the popularity of areas including document storage and distributed systems continues to grow, the demand for high performance XML databases is increasingly evident. This has le...