Sciweavers

31 search results - page 1 / 7
» Tree patterns with Full Text Search
Sort
View
WEBDB
2010
Springer
167views Database» more  WEBDB 2010»
13 years 9 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
DEXA
2005
Springer
138views Database» more  DEXA 2005»
13 years 10 months ago
Full-Text and Structural XML Indexing on B+-Tree
XML query processing is one of the most active areas of database research. Although the main focus of past research has been the processing of structural XML queries, there are gro...
Toshiyuki Shimizu, Masatoshi Yoshikawa
ESA
2011
Springer
269views Algorithms» more  ESA 2011»
12 years 4 months ago
Alphabet-Independent Compressed Text Indexing
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...
Djamal Belazzougui, Gonzalo Navarro
TCBB
2010
136views more  TCBB 2010»
13 years 2 months ago
Efficient Extraction of Protein-Protein Interactions from Full-Text Articles
—Proteins and their interactions govern virtually all cellular processes, such as regulation, signaling, metabolism, and structure. Most experimental findings pertaining to such ...
Jörg Hakenberg, Robert Leaman, Nguyen Ha Vo, ...
PKC
2010
Springer
118views Cryptology» more  PKC 2010»
13 years 6 months ago
Text Search Protocols with Simulation Based Security
This paper presents an efficient protocol for securely computing the fundamental problem of pattern matching. This problem is defined in the two-party setting, where party P1 hold...
Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen