Sciweavers

2145 search results - page 259 / 429
» Answering Queries Using Views
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 9 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
IDEAS
2003
IEEE
122views Database» more  IDEAS 2003»
15 years 9 months ago
Preferred Repairs for Inconsistent Databases
The objective of this paper is to investigate the problems related to the extensional integration of information sources. In particular, we propose an approach for managing incons...
Sergio Greco, Cristina Sirangelo, Irina Trubitsyna...
ESEM
2009
ACM
15 years 7 months ago
Understanding the use of inheritance with visual patterns
The goal of this work is to visualize inheritance in objectoriented programs to help its comprehension. We propose a single, compact view of all class hierarchies at once using a ...
Simon Denier, Houari A. Sahraoui
ICDE
2008
IEEE
425views Database» more  ICDE 2008»
17 years 3 months ago
NAGA: Searching and Ranking Knowledge
The Web has the potential to become the world’s largest knowledge base. In order to unleash this potential, the wealth of information available on the Web needs to be extracte...
Gjergji Kasneci, Fabian M. Suchanek, Georgiana Ifr...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 3 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang