Sciweavers

710 search results - page 61 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
WWW
2004
ACM
14 years 8 months ago
Texquery: a full-text search extension to xquery
One of the key benefits of XML is its ability to represent a mix of structured and unstructured (text) data. Although current XML query languages such as XPath and XQuery can expr...
Sihem Amer-Yahia, Chavdar Botev, Jayavel Shanmugas...
WEBDB
2004
Springer
125views Database» more  WEBDB 2004»
14 years 1 months ago
Best-Match Querying from Document-Centric XML
On the Web, there is a pervasive use of XML to give lightweight semantics to textual collections. Such documentcentric XML collections require a query language that can gracefully...
Jaap Kamps, Maarten Marx, Maarten de Rijke, Bö...
CIKM
1993
Springer
13 years 12 months ago
Collection Oriented Match
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
Anurag Acharya, Milind Tambe
AMW
2011
12 years 11 months ago
Subqueries in SPARQL
Subqueries are a poweful feature which allows to enforce reuse, composition, rewriting and optimization in a query language. In this paper we perform a comprehensive study of the i...
Renzo Angles, Claudio Gutierrez
DEBS
2007
ACM
13 years 11 months ago
Temporal order optimizations of incremental joins for composite event detection
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
François Bry, Michael Eckert