Sciweavers

64 search results - page 1 / 13
» Expressiveness and Performance of Full-Text Search Languages
Sort
View
EDBT
2006
ACM
112views Database» more  EDBT 2006»
14 years 5 months ago
Expressiveness and Performance of Full-Text Search Languages
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for...
Chavdar Botev, Sihem Amer-Yahia, Jayavel Shanmugas...
WEBDB
2010
Springer
167views Database» more  WEBDB 2010»
13 years 10 months ago
Tree patterns with Full Text Search
Tree patterns with full text search form the core of both XQuery Full Text and the NEXI query language. On such queries, users expect a relevance-ranked list of XML elements as an...
Maria-Hendrike Peetz, Maarten Marx
ICLP
1999
Springer
13 years 9 months ago
CLAIRE: Combining Sets, Search, and Rules to Better Express Algorithms
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...
Yves Caseau, François-Xavier Josset, Fran&c...
SIGMOD
2010
ACM
250views Database» more  SIGMOD 2010»
13 years 5 months ago
Expressive and flexible access to web-extracted data: a keyword-based structured query language
Automated extraction of structured data from Web sources often leads to large heterogeneous knowledge bases (KB), with data and schema items numbering in the hundreds of thousands...
Jeffrey Pound, Ihab F. Ilyas, Grant E. Weddell
NLPRS
2001
Springer
13 years 9 months ago
Migemo: Incremental Search Method for Languages with Many Character Faces
We introduce a new incremental search method called Migemo for languages with many character faces. Migemo performs the incremental search by dynamically expanding the input patte...
Satoru Takabayashi, Hiroyuki Komatsu, Toshiyuki Ma...