Sciweavers

4255 search results - page 264 / 851
» Cover
Sort
View
FOSSACS
2011
Springer
14 years 10 months ago
Ordinal Theory for Expressiveness of Well Structured Transition Systems
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
Rémi Bonnet, Alain Finkel, Serge Haddad, Fe...
PODS
2003
ACM
132views Database» more  PODS 2003»
16 years 6 months ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 6 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
SEMWEB
2009
Springer
16 years 1 months ago
What Four Million Mappings Can Tell You about Two Hundred Ontologies
The field of biomedicine has embraced the Semantic Web probably more than any other field. As a result, there is a large number of biomedical ontologies covering overlapping area...
Amir Ghazvinian, Natalya Fridman Noy, Clement Jonq...
FOCS
2008
IEEE
16 years 1 months ago
Size Bounds and Query Plans for Relational Joins
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
Albert Atserias, Martin Grohe, Dániel Marx