Sciweavers

662 search results - page 3 / 133
» A comparative benchmark of large objects in relational datab...
Sort
View
VLDB
2005
ACM
93views Database» more  VLDB 2005»
13 years 11 months ago
The TEXTURE Benchmark: Measuring Performance of Text Queries on a Relational DBMS
We introduce a benchmark called TEXTURE (TEXT Under RElations) to measure the relative strengths and weaknesses of combining text processing with a relational workload in an RDBMS...
Vuk Ercegovac, David J. DeWitt, Raghu Ramakrishnan
SSDBM
2005
IEEE
131views Database» more  SSDBM 2005»
13 years 11 months ago
Searching for Related Objects in Relational Databases
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...
Xiaoxin Yin, Jiawei Han, Jiong Yang
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
13 years 6 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
14 years 5 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...
ICDE
2009
IEEE
145views Database» more  ICDE 2009»
14 years 17 days ago
Context-Aware Object Connection Discovery in Large Graphs
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
James Cheng, Yiping Ke, Wilfred Ng, Jeffrey Xu Yu