Expressions are very useful in a number of applications for describing the interest of the user in particular data items. Examples of such application domains include publish/subscribe, ecommerce, web site personalization. In recent work, database techniques have been utilized for efficiently matching large number of expressions with data. These techniques include storing expressions as data in the database and then indexing these expressions to quickly identify expressions that match a given data item. In this thesis a new model for expressions is presented that allows definition of richer expressions than provided in previous work. Implementation of this expression model is then described. The implementation includes sequential search as well as an indexing approach. The thesis then presents an experimental performance study that shows the benefit of the indexing approach.
| Identifer | oai:union.ndltd.org:uno.edu/oai:scholarworks.uno.edu:td-1352 |
| Date | 20 January 2006 |
| Creators | Jampa, Raj |
| Publisher | ScholarWorks@UNO |
| Source Sets | University of New Orleans |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | University of New Orleans Theses and Dissertations |
Page generated in 0.002 seconds