We investigate algorithms for evaluating moving window joins over pairs of unbounded streams. We introduce a unit-time-basis cost model to analyze the expected performance of thes...
For applications that involve rapidly changing textual data and also require traditional DBMS capabilities, current systems are unsatisfactory. In this paper, we describe a hybrid...
In several mobile applications, the data items broadcast are dependent upon one another. However, most prior studies on broadcasting dependent data mainly consider single broadcas...
Despite the recent proliferation of work on semistructured data models, there has been little work to date on supporting uncertainty in these models. In this paper, we propose a m...
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Clustering of large data bases is an important research area with a large variety of applications in the data base context. Missing in most of the research efforts are means for g...
Alexander Hinneburg, Daniel A. Keim, Markus Wawryn...
Intuitively, data management and data integration tools should be well-suited for exchanging information in a semantically meaningful way. Unfortunately, they suffer from two sign...
Alon Y. Halevy, Zachary G. Ives, Dan Suciu, Igor T...
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Ting...
An organization's data records are often noisy because of transcription errors, incomplete information, lack of standard formats for textual data or combinations thereof. A f...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...
Contemporary XPath query engines evaluate queries in time exponential in the sizes of input queries, a fact that has gone unnoticed for a long time. Recently, the first main