552 search results - page 95 / 111 » Efficient Algorithms for Processing XPath Queries |
120
Voted
EXPDB
2006
ACM
15 years 5 months ago
2006
ACM
In data warehousing applications, the ability to efficiently delete large chunks of data from a table is very important. This feature is also known as Rollout. Rollout is generall...
ISCAS
2005
IEEE
15 years 5 months ago
2005
IEEE
—Unknown protein sequences are often compared to a set of known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithm...
107
click to vote
CIKM
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
101
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract-- Mapping mashups are emerging Web 2.0 applications in which data objects such as blogs, photos and videos from different sources are combined and marked in a map using AP...
100
click to vote
IDEAL
2003
Springer
15 years 5 months ago
2003
Springer
In China-US Million Book Digital Library, output of the digitalization process is more than one terabyte of text in OEB and PDF format. To access these data quickly and accurately,...