66 search results - page 3 / 14 » Dynamic indexability and lower bounds for dynamic one-dimens... |
SISAP
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
VLDB
2002
ACM
14 years 7 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
PODS
1997
ACM
13 years 11 months ago
1997
ACM
We consider the problem of indexing general database workloads (combinations of data sets and sets of potential queries). We de ne a framework for measuring the eciency of an ind...
WWW
2006
ACM
14 years 7 months ago
2006
ACM
An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures. In order to handle content and structure ran...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
for Dynamic Abstract Regions Joxan Jaffar Roland H.C. Yap School of Computing National University of Singapore 3 Science Drive 2, 117543, Singapore {joxan, ryap}@comp.nus.edu.sg Ke...