|
DbTalks: Spring 2004
Contact: Wendy Hui Wang,
Jessica Zhao Zheng
- Jan 23, 2004 at 4:00pm in CICSR304, Discussion Panel: XML Storage
- Jan 30, 2004 at 4:00pm in CICSR304, Discussion Panel: XML Indexing & Index-based Join Algorithms
- Feb 06, 2004 at 4:00pm in CICSR304, Presentation: Fine Analysis of Intersection Problems for Indexed Search Engines
- Feb 13, 2004 at 4:00pm in CICSR304, Discussion Panel: Cancelled
- Feb 20, 2004 at 4:00pm in CICSR304, Discussion Panel: Email Summarization
- Feb 27, 2004 at 4:00pm in CICSR304, Discussion Panel: Cancelled
- Mar 05, 2004 at 4:00pm in CICSR304, Discussion Panel: Cancelled
- Mar 12, 2004 at 4:00pm in CICSR304, Discussion Panel: Similarity Matching in Time Series Databases
- Mar 19, 2004 at 4:00pm in CICSR304, Presentation: Professor Lee Iverson, ECE Department
- Mar 26, 2004 at 3:30pm in Database Lab(CICSR 308C), Open-House Event
- Apr 02, 2004 at 4:00pm in CICSR304, Discussion Panel: XPath Processing
- Apr 09, 2004 Good Friday, Discussion Panel Cancelled(Happy Holiday)
- Apr 16, 2004 at 4:00pm in CICSR304, Discussion Panel: cancelled
- Apr 23, 2004 at 4:00pm in CICSR304, Discussion Panel: Information Retrivial(I)
- Apr 30, 2004 at 4:00pm in CICSR304, Discussion Panel: Compression on XML
- May 07, 2004 at 4:00pm in CICSR304, Discussion Panel: A Normal Form for XML Documents
- May 14, 2004 at 4:00pm in CICSR304, Thesis Presentation
- May 21, 2004 at 4:00pm in CICSR304, Discussion Panel: Cancelled
- May 28, 2004 at 4:00pm in CICSR304, Thesis Presentation:Zhimin Chen
Details:
- Friday, Jan 23, 2004 at 4:00pm in CICSR304
Discussion Panel: XML Storage
Leader: Pingdong Ai
Papers:
- Friday, Jan 30, 2004 at 4:00pm in CICSR304
Discussion Panel: XML Indexing & Index-based Join Algorithms
Leader: Jessica Zhen Zhao
Papers:
- Friday, Feb 6, 2004 at 4:00pm in CICSR304
Presentation: Fine Analysis of Intersection Problems for Indexed Search Engines
Leader: Jeremy Babay
Abstract:
- Friday, Feb 20, 2004 at 4:00pm in CICSR304
Discussion Panel:Email Summarization
Leader: Xiaodong Zhou
Papers:
- Friday, Mar 12, 2004 at 4:00pm in CICSR304
Discussion Panel:Similarity Matching in Time Series Databases
Leader: Yuhan Cai
Abstract:
Sequences (time series) constitute a large portion of data stored in computers. New emerging applications, particularly database mining application, require that databases be enhanced with the capability to process "similarity" queries. Similarity queries can be classified into two categories:
- (a) Whole Matching: the sequences to be compared have the same length n.
- (b) Subsequence Matching: the query sequence is smaller; we look for a subsequence in the large sequence that best matches the query sequence.
The first paper focuses on (a), while the second one focuses on (b).
Papers:
- Efficient Similarity Search In Sequence Databases[1], Rakesh Agrawal, Christos Faloutsos, Arun Swami, Proceedings of the 4th International Conference of Foundations of Data Organization and Algorithms (FODO)
- Fast Subsequence Matching in Time-Series Databases[2] ,Christos Faloutsos, M Ranganathan, Yannis Manolopoulos, Proceedings 1994 ACM SIGMOD Conference, Mineapolis, MN
- Friday, Mar 19, 2004 at 4:00pm in CICSR304
Presentation:NODAL: a Network-Oriented Document Abstraction Language
Leader: Professor Lee Iverson, ECE Department
Abstract:
For many years, researchers and software developers have been seeking to develop systems and applications to enable efficient and effective group work and organizational memory. The systems proposed
and developed have in many respects had little impact on the
effectiveness of group activities outside the laboratory. Other
researchers have identified many of the challenges that groupware
systems face, but these insights have done little to structure
subsequent research.
We suggest that these difficulties are primarily due to an operating
system model and a model of application development that has
significantly restricted the ability of users to properly manage their
own data and work products much less share them with others.
Moreover, it is nearly impossible to effectively integrate collaborative
activities with natural practices of work and communication.
Instead, we propose an alternative system architecture,
the DKC model, that places HCI, knowledge representation and
management, and distributed, hypertext operating systems in a
coordinated structure. We clearly delineate the roles of each of
these aspects within the whole, collaborative environment. By adopting
this model, we suggest that researchers and developers of both
single-user and collaborative systems will be able to design
effective, multi-platform, multi-application, and multi-workplace
collaborative environments that may finally have some impact
beyond the laboratory.
In addition, I will describe the architecture of a proposed universal data layer
to be used in the context of this DKC model: NODAL, the Network-Oriented
Document Abstraction Language. I am currently developing a prototype of
NODAL as a storage middleware layer.
Papers:
- Friday, Mar 26, 2004 at 3:30pm in Database Lab(CICSR308C)
Open-House Event
Details: Poster Presentation
- Friday, Apr 2, 2004 at 4:00pm in CICSR304
Discussion Panel:XPath Processing
Leader: Wendy Hui Wang
Papers:
- Friday, Apr 23, 2004 at 4:00pm in CICSR304
Discussion Panel:A first look at Information Retrieval:Models, Evaluation and Query Languages
Leader: Ganesh Ramesh
Abstract:This is the first talk in a series of talks on Information retrieval. To better understand the merger of classic DB style querying and full text querying supported in IR systems, it is important to take a look into the field of information retrieval.
In this talk, classic models of IR are presented. A discussion on some alternate models of IR is presented with an exposition of retrival evaluation. The talk concludes with a description of query languages and operations that are used in conventional IR systems.
Reference:
Modern Information Retrieval - Ricardo Baeza-Yates and Berthier Ribeiro-Neto (Addison-Wesley)
- Friday, Apr 30, 2004 at 4:00pm in CICSR304
Discussion Panel:Compression on XML
Leader: Angela Bonifati
Abstract: XML suffers from the major limitation of high redundancy. Even if
compression can be beneficial for XML data, however, once
compressed, the data can be seldom browsed and queried in an
efficient way. To address this problem, we propose XQueC, an
XQuery processor and Compressor, aiming at covering a
large set of XQuery queries in the compressed domain. We shred
compressed XML into suitable data structures, which leads to
in-memory effective savings and let data be queried while
compressed. XQueC is the first system to take advantage of the
query workload to choose the compression algorithms and to group the
compression data granules under common properties.
Finally, we experimentally show that good trade-offs between
compression ratio and query capability can be achieved in several
real cases, as those covered by an XML benchmark. On average,
XQueC improves over previous XML query-aware compression systems,
still being reasonably closer to general-purpose query-unaware XML
compressors. Also, QETs for a wide variety of queries show that
XQueC can reach speed comparable to XQuery engines on uncompressed
data.
Papers:
- Friday, May 7, 2004 at 4:00pm in CICSR304
Discussion Panel:A Normal Form for XML Documents
Leader: Elaine Chang
Papers:
- Friday, May 14, 2004 at 4:00pm in CICSR304
Thesis Presentation:
Leader: Yuhan Cai
Papers:
- Friday, May 21, 2004 at 4:00pm in CICSR304
Discussion Panel:A first look at Information Retrieval:Models, Evaluation and Query Languages(II)
Leader: Ganesh Ramesh
Abstract:The second talk in Information Retrieval
Reference:
Modern Information Retrieval - Ricardo Baeza-Yates and Berthier Ribeiro-Neto (Addison-Wesley)
- Friday, May 28, 2004 at 4:00pm in CICSR304
Thesis Presentation:
Leader: Zhimin Chen
|
|
|
|
|