Inside Adlib May 19 th 2009 Bert Degenhart Drenth The Adlib - - PowerPoint PPT Presentation

inside adlib
SMART_READER_LITE
LIVE PREVIEW

Inside Adlib May 19 th 2009 Bert Degenhart Drenth The Adlib - - PowerPoint PPT Presentation

Inside Adlib May 19 th 2009 Bert Degenhart Drenth The Adlib architecture Data Organised in tables Tables contain records, stored in XML All records in the same table are of the same record type Records can be access controlled Examples:


slide-1
SLIDE 1

Inside Adlib

May 19th 2009 Bert Degenhart Drenth

slide-2
SLIDE 2

The Adlib architecture

slide-3
SLIDE 3

Organised in tables Tables contain records, stored in XML All records in the same table are of the same record type Records can be access controlled Examples:

  • bjects, books, people, thesaurus terms

Data

slide-4
SLIDE 4

Fixed length or unlimited length Have a field name (multilingual) and a 2 character tag Can be repeated Can be multi-lingual Can be grouped MUST be indexed for searching

Fields

slide-5
SLIDE 5

Can index 1 or more fields One field can be in multiple indexes 2 major index types : word and term Are updated instantly after a record write | term indexes index the complete content of an occurrence | | word | indexes | chop | up | texts | in | single | words |

Indexes

slide-6
SLIDE 6

SEARCH is the CORE

slide-7
SLIDE 7

A search is like a tree

slide-8
SLIDE 8

FieldName operator SearchValue

Operators: ‘=‘, ‘>’, ‘<‘, ‘=>’ or ‘=<‘ Use quotes when searching for values with spaces Use comma ‘,’ to search for multiple values ‘or’ Or ‘+’ for ‘and’ Or ‘-’ for ‘but not’ Asterisk ‘*’ as wildcard (left, right middle)

Leaf : Simple search

slide-9
SLIDE 9

SimpleSearch booleanOperator SimpleSearch

Boolean operators ‘and’, ‘or’, ‘xor’, ‘and not’, ‘when’ ‘and’ has precedence over ‘or’ Use parenthesis to define your own precedence

Branches: Boolean searches

slide-10
SLIDE 10

all

Special searches

slide-11
SLIDE 11

random nnn [seed]

nnn determines number of returned records seed = start number for algorithm Same seed means same result

Randomize results

slide-12
SLIDE 12

Fieldname operator today [+|- nn]

Operators: ‘=‘, ‘>’, ‘<‘, ‘=>’ or ‘=< Field must be a date type nn = number of days to add / subtract from today

Date searches

slide-13
SLIDE 13

fieldName[isoCode] operator value

Valid for multilingual fields only isoCode determines language title[DE-de] = ‘das’

Language specific searches

slide-14
SLIDE 14

fieldName->fieldName operator value

For linked tables Second field name is the field in the linked table creator->birth.year = 1920 Can follow multiple links

Linked table searches

slide-15
SLIDE 15

Use of pointer files

slide-16
SLIDE 16

pointer nnn

pf’s are stored search results Aka ‘persistent sets’ Retrieves the result from a previously stored search

Pointer files

slide-17
SLIDE 17

profile nnn

Reruns the search statement from a previously stored search

Pointer files

slide-18
SLIDE 18

sort fieldName [ascending|descending]

sorting

slide-19
SLIDE 19