137 search results - page 11 / 28 » Efficient Tree Search in Encrypted Data |
ICDE
2010
IEEE
14 years 9 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
ICDE
2007
IEEE
14 years 1 months ago
2007
IEEE
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
KDD
2004
ACM
14 years 10 months ago
2004
ACM
One major problem of existing methods to mine data streams is that it makes ad hoc choices to combine most recent data with some amount of old data to search the new hypothesis. T...
BDA
2004
13 years 11 months ago
2004
: XML DBMSs require new indexing techniques to efficiently process structural search and full-text search as integrated in XQuery. Much research has been done for indexing XML docu...
CCCG
2006
13 years 11 months ago
2006
A k-nearest neighbor search algorithm for the Pyramid technique is presented. The Pyramid technique divides d-dimensional data space into 2d pyramids. Given a query point q, we in...