Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
A UML Variant for Modeling System Searchability
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 2425/2002
Book
Object-Oriented Information Systems
DOI
10.1007/3-540-46102-7
Copyright
2002
ISBN
978-3-540-44087-1
DOI
10.1007/3-540-46102-7_25
Pages
755-760
Subject Collection
Computer Science
SpringerLink Date
Tuesday, January 01, 2002
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (675.1 KB)
Free Preview
A UML Variant for Modeling System Searchability
Axel Uhl
7
and Horst Lichter
8
(7)
Interactive Objects Software GmbH, Freiburg, Germany
(8)
Aachen Technical University, Aachen, Germany
Abstract
Internet search engines today are facing problems in keeping upw ith the pace of web growth. Two facts are responsible: bandwidth bottlenecks due to central indexing;
deep web
(or
invisible web
) contents that are inaccessible for search engines. Powerful and flexibly extensible object-oriented frameworks are available that assist in the implementation of distributed search infrastructures, thus addressing the first problem. In order to address the second problem, searchability has to be designed into the online applications constituting the deep web, and integrations to the distributed search infrastructures have to be implemented. A model-driven approach to software construction can be used to specify an application’s searchability. This paper presents an extension to the UML that can be used to specify an application’s searchability in an efficient way. The resulting models can be used to generate large parts of the searchability implementation automatically.
Axel
Uhl
Email:
uhl@io-software.com
Horst
Lichter
Email:
lichter@informatik.rwth-aachen.de
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.107 • Server: mpweb07
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)