[Please remove <h1>]
Spring 2001
| DB
meeting: |
Friday, May 11th, 2:00 pm, DC1331 |
| Speaker: |
Lei Chen |
| Topic: |
Modeling Video Data
With widely varying use of video data, the simple VCR functions can
no longer satisfy users' requirement. Techniques for content-based video
data modeling, indexing and retrieval have been developed to address these
demands. However, efficient modeling of video remains a research topic.
Compared to text or image data, video data is more complicated, because
of its temporality and high semantic charateristics. In this presentation,
shot based, annotation based and video object based modeling techniques
are reviewed and compared. |
| Snacks: |
Frank Tompa |
| DB
meeting: |
Friday, May 18th, 2:00 pm, DC1331 |
| Speaker: |
Mariano Consens |
| Topic: |
Data Management issues in emerging P2P network programming platforms,
such as JXTA (see
http://www.jxta.org). JXTA is defined
as a set protocols, which use XML-encoded messages, designed to be independent
of transport protocols. It can be implemented on top of TCP/IP, HTTP, Bluetooth,
etc. |
| Snacks: |
Lei Chen |
| DB
meeting: |
Friday, June 1st, 2:00 pm, DC1331 |
| Speaker: |
David Toman |
| Topic: |
I will talk about the idea Grant and I had some time ago about storing/querying
XML in an ordinary rdbms; what works and what doesn't (and speculations
on why). |
| Snacks: |
|
| DB
meeting: |
Friday, June 8th, 2:00 pm, DC1331 |
| Speaker: |
Ivan Bowman |
| Topic: |
Optimizing temporal queries: efficient handling of duplicates
The SQL/TP language allows users to compose queries against an abstract
database, and then translates these queries to SQL for execution on a commercial
RDBMS. The translation is defined to provide SQL duplicate semantics.
By considering the context of translation, we are able to use a more efficient
translation when the number of duplicates does not affect the correctness
of the result. |
| Snacks: |
David Toman |
| DB
meeting: |
Friday, June 15th, 2:00 pm, DC1331 |
| Speaker: |
Lubomir Stanchev |
| Topic: |
The secrets of getting precise answers when querying incomplete
information
I will show how to do bag relational algebra with aggregation over
a particular representation of incomplete information called c-tables (Grahne
'84). The c-table representation is an extension of the Codd relational
model with richer semantics for null values. The reason c-tables were chosen
for the exploration is that they are the least expressive relational representation
of incomplete information over which relational algebra is closed and can
be "well defined". The need for duplicate preserving relational algebra
over this representation of incomplete information is justified by introducing
aggregation over c-tables with duplicates. |
| Snacks: |
Ivan Bowman |
| DB
meeting: |
Friday, June 22nd, 2:00 pm, DC1331 |
| Speaker: |
Reem Al-Halimi |
| Topic: |
Word Spread as an Indicator of Text Category
Traditional information retrieval has generally viewed text as an unordered
collection of words. This so called "bag-of-words" view is sufficient for
many retrieval tasks including query matching and document clustering.
However, by definition the bag-of-words view lacks insight into the flow
of information in the text. In this talk I will present an alternative
view of text that retains some of the topic flow information by preserving
relative word positions, and describe our ongoing research on how this
information can be used to automatically categorize text. |
| Snacks: |
Lubomir Stanchev |
| DB
meeting: |
Friday, June 29th, 2:00 pm, DC1331 |
| Speaker: |
Ken Salem |
| Topic: |
I will survey some of the literature on dynamic histograms - that is,
histograms that can adapt automatically and incrementally to changes in
the underlying data distribution. |
| Snacks: |
Reem Al-Halimi |
| DB
meeting: |
Friday, July 6th, 2:00 pm, DC1331 |
| Speaker: |
Huizhu Liu |
| Topic: |
TBA |
| Snacks: |
Ken Salem |
This page is maintained by
Frank
Tompa and
Ken Salem.
