Sciweavers

664 search results - page 8 / 133
» Generalized Search Trees for Database Systems
Sort
View
WEBDB
2010
Springer
167views Database» more  WEBDB 2010»
15 years 4 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
WWW
2008
ACM
16 years 15 days ago
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
Guoliang Li, Jianhua Feng, Jianyong Wang, Bei Yu, ...
VLDB
1999
ACM
151views Database» more  VLDB 1999»
15 years 4 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
15 years 11 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...
PODS
2001
ACM
145views Database» more  PODS 2001»
15 years 12 months ago
Optimization of Sequence Queries in Database Systems
The need to search for complex and recurring patterns in database sequences is shared by many applications. In this paper, we discuss how to express and support efficiently sophis...
Reza Sadri, Carlo Zaniolo, Amir M. Zarkesh, Jafar ...