Sciweavers

342 search results - page 26 / 69
» Conjunctive Queries over Trees
Sort
View
148
Voted
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
16 years 3 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
208
Voted
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
16 years 3 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 6 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
217
Voted
ICDE
2005
IEEE
131views Database» more  ICDE 2005»
16 years 4 months ago
On the Sequencing of Tree Structures for XML Indexing
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
Haixun Wang, Xiaofeng Meng
97
Voted
COMSIS
2010
15 years 25 days ago
MFI-tree: An effective multi-feature index structure for weighted query application
Multi-Feature Index Tree (MFI-Tree), a new indexing structure, is proposed to index multiple high-dimensional features of video data for video retrieval through example. MFI-Tree e...
Yunfeng He, Junqing Yu