Sciweavers

1157 search results - page 185 / 232
» Storing and Querying XML Data using an RDMBS
Sort
View
CSR
2007
Springer
14 years 2 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
MIDDLEWARE
2004
Springer
14 years 1 months ago
A Content Model for Evaluating Peer-to-Peer Searching Techniques
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
Brian F. Cooper
CLUSTER
2005
IEEE
14 years 1 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 8 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
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...
Rasmus Pagh, Srinivasa Rao Satti
RIAO
2007
13 years 9 months ago
Homepage Finding in Hybrid Peer-to-Peer Networks
This paper illustrates a ranking scheme which combines fulltext, anchor text and URL structure for homepage finding in hybrid peer-to-peer networks. The experimental results show...
Enrico Bragante, Massimo Melucci