Sciweavers

92 search results - page 8 / 19
» Representing and Querying Changes in Semistructured Data
Sort
View
VISUALIZATION
1993
IEEE
14 years 20 days ago
Visual Feedback in Querying Large Databases
In this paper, we describe a database query system that provides visual relevance feedback in querying large databases. The goal of our system is to support the query specificati...
Daniel A. Keim, Hans-Peter Kriegel, Thomas Seidl
IEICET
2008
67views more  IEICET 2008»
13 years 8 months ago
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uch...
VLDB
2005
ACM
110views Database» more  VLDB 2005»
14 years 2 months ago
U-DBMS: A Database System for Managing Constantly-Evolving Data
In many systems, sensors are used to acquire information from external environments such as temperature, pressure and locations. Due to continuous changes in these values, and lim...
Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
14 years 2 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
WADS
2001
Springer
106views Algorithms» more  WADS 2001»
14 years 1 months ago
Succinct Dynamic Data Structures
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao