Sciweavers

11213 search results - page 246 / 2243
» Low-contention data structures
Sort
View
JSS
2008
139views more  JSS 2008»
15 years 5 months ago
Dynamic interval-based labeling scheme for efficient XML query and update processing
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
Jung-Hee Yun, Chin-Wan Chung
TKDE
2010
190views more  TKDE 2010»
15 years 3 months ago
Effectively Indexing the Uncertain Space
—With the rapid development of various optical, infrared, and radar sensors and GPS techniques, there are a huge amount of multidimensional uncertain data collected and accumulat...
Ying Zhang, Xuemin Lin, Wenjie Zhang, Jianmin Wang...
DEBU
2010
127views more  DEBU 2010»
15 years 2 months ago
Provenance in ORCHESTRA
Sharing structured data today requires agreeing on a standard schema, then mapping and cleaning all of the data to achieve a single queriable mediated instance. However, for setti...
Todd J. Green, Grigoris Karvounarakis, Zachary G. ...
JSC
2002
74views more  JSC 2002»
15 years 5 months ago
Computing Transformation Semigroups
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of...
Steve Linton, G. Pfeiffer, Edmund F. Robertson, Ni...
ENTCS
2006
112views more  ENTCS 2006»
15 years 5 months ago
Synchronous Dataflow Pattern Matching
We introduce variant types and a pattern matching operation to synchronous dataflow languages. These languages are used in the design of reactive systems. As these systems grow in...
Grégoire Hamon