Sciweavers

1656 search results - page 85 / 332
» Labeling Schemes with Queries
Sort
View
VLDB
2004
ACM
128views Database» more  VLDB 2004»
14 years 2 months ago
An Annotation Management System for Relational Databases
We present an annotation management system for relational databases. In this system, every piece of data in a relation is assumed to have zero or more annotations associated with ...
Deepavali Bhagwat, Laura Chiticariu, Wang Chiew Ta...
IR
2006
13 years 9 months ago
Evolving local and global weighting schemes in information retrieval
This paper describes a method, using Genetic Programming, to automatically determine term weighting schemes for the vector space model. Based on a set of queries and their human de...
Ronan Cummins, Colm O'Riordan
SSDBM
2002
IEEE
128views Database» more  SSDBM 2002»
14 years 2 months ago
Compressing Bitmap Indexes for Faster Search Operations
In this paper, we study the effects of compression on bitmap indexes. The main operations on the bitmaps during query processing are bitwise logical operations such as AND, OR, N...
Kesheng Wu, Ekow J. Otoo, Arie Shoshani
VLDB
2002
ACM
120views Database» more  VLDB 2002»
14 years 9 months ago
Efficient schemes for managing multiversionXML documents
Multiversion support for XML documents is needed in many critical applications, such as software configuration control, cooperative authoring, web information warehouses, and "...
Shu-Yao Chien, Vassilis J. Tsotras, Carlo Zaniolo
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 8 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...