Sciweavers

31 search results - page 3 / 7
» Database Graph Views: A Practical Model to Manage Persistent...
Sort
View
CIKM
2007
Springer
13 years 12 months ago
Towards practically feasible answering of regular path queries in lav data integration
Regular path queries (RPQ’s) are given by means of regular expressions and ask for matching patterns on labeled graphs. RPQ’s have received great attention in the context of s...
Manuel Tamashiro, Alex Thomo, Srinivasan Venkatesh
PPSWR
2005
Springer
13 years 11 months ago
Marriages of Convenience: Triples and Graphs, RDF and XML in Web Querying
Metadata processing is recognized as a central challenge for database research in the next decade. Already, novel desktop data management and search applications (cf. Apple’s Spo...
Tim Furche, François Bry, Oliver Bolzer
ESWS
2007
Springer
13 years 12 months ago
A Performance and Scalability Metric for Virtual RDF Graphs
Abstract. From a theoretical point of view, the Semantic Web is understood in terms of a stack with RDF being one of its layers. A Semantic Web application operates on the common d...
Michael Hausenblas, Wolfgang Slany, Danny Ayers
WWW
2008
ACM
14 years 6 months ago
Substructure similarity measurement in chinese recipes
Improving the precision of information retrieval has been a challenging issue on Chinese Web. As exemplified by Chinese recipes on the Web, it is not easy/natural for people to us...
Liping Wang, Qing Li, Na Li, Guozhu Dong, Yu Yang
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
13 years 11 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre