Abstract
To provide users with database-like query interfaces on HTML data several systems have been developed to extract structures from HTML pages. Among them treelike structures and path expressions are the most popular modeling and navigating tools respectively. Although path expressions are straightforward in representing top-down search patterns they provide very limited help in representing bottom-up and in-breadth search patterns. In this paper a lattice model is proposed to store Web data. The model provides an integrated mechanism to store text linking information HTML hierarchy and sequence order of HTML data. By incorporating lattice operators with comprehension syntax we show that the query language can represent top-down bottom-up and in-breadth searching patterns with uniform operators. It will be also shown that lattice comprehensions can represent all operators of path expressions except Kleen closure.
| Original language | English |
|---|---|
| Pages (from-to) | 156-164 |
| Number of pages | 9 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E82-D |
| Issue number | 1 |
| State | Published - 1999 |
Keywords
- Information retrieval
- Internet
- Lattices
- Model
- Query language
- WWW