Sciweavers

6660 search results - page 925 / 1332
» Data Analysis for Query Processing
Sort
View
ICDE
2009
IEEE
131views Database» more  ICDE 2009»
16 years 6 months ago
Exploring a Few Good Tuples from Text Databases
Information extraction from text databases is a useful paradigm to populate relational tables and unlock the considerable value hidden in plain-text documents. However, information...
Alpa Jain, Divesh Srivastava
INFOCOM
2005
IEEE
15 years 10 months ago
BARD: Bayesian-assisted resource discovery in sensor networks
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
Fred Stann, John S. Heidemann
HOTSWUP
2009
ACM
15 years 9 months ago
Automating Database Schema Evolution in Information System Upgrades
The complexity, cost, and down-time currently created by the database schema evolution process is the source of incessant problems in the life of information systems and a major s...
Carlo Curino, Hyun Jin Moon, Carlo Zaniolo
139
Voted
COMPGEOM
2007
ACM
15 years 8 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
15 years 2 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...