Sciweavers

486 search results - page 30 / 98
» An Efficient Path Index for Querying Semi-structured Data
Sort
View
ICDE
2007
IEEE
104views Database» more  ICDE 2007»
16 years 1 months ago
Indexing Uncertain Categorical Data
Uncertainty in categorical data is commonplace in many applications, including data cleaning, database integration, and biological annotation. In such domains, the correct value o...
Sarvjeet Singh, Chris Mayfield, Sunil Prabhakar, R...
VLDB
1995
ACM
129views Database» more  VLDB 1995»
15 years 3 months ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
16 years 13 hour ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
CIKM
2006
Springer
15 years 1 months ago
Processing relaxed skylines in PDMS using distributed data summaries
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...
Katja Hose, Christian Lemke, Kai-Uwe Sattler
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
15 years 12 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li