text:
On the last Thursday every month I'm going to give you my favorite celebrity Instagrammer of the month! September's pick is the gorgeous Ariane Davis!
To know me is to know that I'm a lover of amazing makeup but even more so a POPPING lip. Which she is giving right now.
Ariane referred to this yellow number as "snatched" Saturday. She was definitely snatched, her skin looks amazing, and the dress compliments her!
Although she wasn't one of my top pics of this weeks #LHHATL reunion show, she still killed in this all white jumpsuit & dark lipstick!
hhw52x hhw52x
About the Author


text:
Boot Barn Item #: 2004028
Color: Click a button belowcolor
size: Click a button below Size Chartsize
- 100% Cotton
- Plaid print
- Snap front
- Front pockets with flaps and double snaps
- Double snaps on cuffs
- Front and back western yokes
Dress your best in this Cody James® Men's Plaid Snap Western Shirt. The 100% cotton, plaid, and pearl snaps give this shirt a classic stylish western look. All Cody James® shirts are made with light weight fabric that is durable, comfortable, and sized with a very full cut and extra long tails and sleeves, perfect for riding, ranching, or day-to-day wear.
Style(s): CJRD4
Lifestyle: Western
Material: Cotton
Color: Red
Print Cody James® celebrates America's western heritage and traditional values of hard work, integrity and community. We believe in quality products and good value. We've handcrafted our boots with the finest hides and hand-driven wood pegs, ensuring they're durable, authentic and affordable. Designed shirts, made of 100% double-washed cotton, performance-sized with extra long tail and sleeves, suited for riding, roping and ranching. And offer real fur felt hats – handmade by families who've been felting fur the same way for more than a hundred years. Hand-weaved straw hats, for warm weather months, belts and buckles round out the line. Cody James® -- western performance gear that makes sense. See for yourself.

subset: commoncrawl


text:
What has been your most memorable dining experience?
Fäviken, in Sweden - so moving an experience and such incredibly delicious food that it even hit me harder than eating at the legendary El Bulli.
Is there anything you would never try?
Raw offal might be hard to keep down, but other than that, I'm game.
What's your favourite comfort food?
Roasted piglet with rice and beans, Brazilian style.
If you had to eat one meal for the rest of your life, what would it be?
Bread and butter.
After a long week, what's your tipple of choice?
Any sort of Montrachet - can't say I'm a cheap date...
What are your three finer things in life that you secretly indulge in?
Indulging in secret takes most of the fun out of indulging. Raw bluefin tuna is an indulgence I have given up on, at this point I'd feel too guilty ordering a fish that is so endangered, even secretly.
Describe yourself in three foodie words…
Fearless, curious, insatiable.


text:
Breathing monitor helps users track their state of mind
Stress is typically thought of as having negative health consequences, but it can be difficult to know when or why we become stressed. While tools such as the handheld PIP sensor have previously aimed to let users know when they should relax, Spire is a wearable device that continuously tracks users' respiration and other metrics, letting them know when they need to take a deep breath.
Spotted another good idea???
Join our network and earn rewards


text:
Estrada pitches Brewers past AstrosSep 30, 2012 - 3:29 AM
Milwaukee's win, coupled with the St. Louis Cardinals' extra-inning loss to the Washington Nationals on Saturday has the Brewers four games off the pace for the NL's final wild card spot. Both teams have four games remaining.
Estrada (5-7) struck out 11, issued just one walk and scattered four hits to earn the victory. Livan Hernandez allowed three ninth-inning homers before Jose Veras recorded the game's final out.
Aramis Ramirez and Norichika Aoki both had three hits, two RBI and two runs scored for the Brewers, who dropped a 7-6 decision to the Astros in Friday's series opener.
Dallas Keuchel (3-8) allowed seven runs on eight hits over just 2 1/3 innings to take the loss on Saturday. The rookie left-hander walked one and struck out two.
"It's kind of disappointing to end my year on this note, but it's my own fault," said Keuchel.
Fernando Martinez and Brian Bogusevic both belted two-run homers for Houston in the ninth and Tyler Greene added a solo blast.
Hart went back-to-back with Ramirez to begin the second, which also featured a two-out, two-run bloop single by Aoki.
An inning later, Hart followed consecutive base hits by Ryan Braun and Ramirez with his 30th homer of the season, which found the seats in right field for a 7-0 lead.
"I'll probably stay in the lineup," said Hart, who has been dealing with plantar fasciitis in his left foot. "I want to win as many games as possible. I still want to be competitive."
Carlos Gomez reached with a Tobago later in the frame and Jean Segura followed with a shot into the right-center field gap off Chuckie Fick, but Brandon Barmes robbed Segura with a diving grab and doubled Gomez off second base to end the inning.
In the fourth, Aoki doubled, Braun walked with two outs, and both runners moved up on a wild pitch before Ramirez ripped an RBI infield single off the foot of Fick.
Logan Schafer plated Aoki and made it 9-0 with a sacrifice fly in the eighth.
Game Notes
Estrada recorded the fourth double-digit strikeout game of his career ... Hart has 14 career multi-homer games ... The Brewers have hit back-to-back home runs 10 times this season ... Milwaukee second baseman Eric Farris notched his first major league hit with an infield single in the eighth.
Sep 29 10:23 PM
- Tyler Greene two-out, solo Home Run (11) to left. Brandon Barnes due up.
Astros 5, Brewers 9 Top 9, 2 OutsSep 29 10:19 PM
- Pinch-Hitter Brian Bogusevic two-out, two-run Home Run (7) to center scored Jason Castro. Tyler Greene due up.
Astros 4, Brewers 9 Top 9, 2 OutsSep 29 10:16 PM
- 52
rootsRUWTbot Added 8 roots
Astros 4, Brewers 9 Top 9, 2 OutsSep 29 10:16 PM
- Fernando Martinez two-out, two-run Home Run (4) to center scored Scott Moore. Jason Castro due up.
Astros 2, Brewers 9 Top 9, 2 OutsSep 29 10:14 PM
- 44
rootsRUWTbot Added 8 roots
Astros 2, Brewers 9 Top 9, 2 OutsSep 29 10:14 PM
- Pinch-Hitter Logan Schafer sacrifice fly to score Norichika Aoki. Runner on first with two outs and Corey Hart due up.
Astros 0, Brewers 9 Bot 8, 2 OutsSep 29 10:05 PM
- 36
rootsRUWTbot Added 8 roots
Astros 0, Brewers 9 Bot 8, 2 OutsSep 29 10:05 PM
- Aramis Ramirez singled to pitcher scored Norichika Aoki. On the play, Ryan Braun advances to third. Runners on first and third with two outs and Corey Hart due up.
Astros 0, Brewers 8 Bot 4, 2 OutsSep 29 8:47 PM
- Corey Hart none-out, three-run Home Run 2 (30) to right scored Ryan Braun and Aramis Ramirez. Jonathan Lucroy due up.
Astros 0, Brewers 7 Bot 3, 0 OutsSep 29 8:09 PM
- 28
rootsRUWTbot Added 17 roots
Astros 0, Brewers 7 Bot 3, 0 OutsSep 29 8:09 PM
- Norichika Aoki singled to center scored Jonathan Lucroy and Jean Segura. Runner on first with two outs and Rickie Weeks due up.
Astros 0, Brewers 4 Bot 2, 2 OutsSep 29 7:53 PM
- Corey Hart Home Run (29) to center. Jonathan Lucroy due up.
Astros 0, Brewers 2 Bot 2, 0 OutsSep 29 7:44 PM
- Aramis Ramirez lead-off Home Run (27) to center. Corey Hart due up.
Astros 0, Brewers 1 Bot 2, 0 OutsSep 29 7:43 PM
Top 1, 0 Outs
Sep 29 7:12 PM
- 11
rootsRUWTbot Added 11 roots
Astros vs. BrewersDec 20 6:02 AM
Related News
- Orioles-Astros Preview May 23
- Brewers-Braves Preview May 23
- Baseball Capsules May 22
- Syndergaard Ks 11, Conforto homers as Mets sweep Brewers May 22
- Hamels fans 11, Rangers down Keuchel, Astros 9-2 for sweep May 22
- Eickhoff shuts down Braves over 7 innings, Phillies win 5-0 May 22
- Braun back in Brewers' lineup vs Mets after missing 4 games May 22
- LEADING OFF: Bradley's 26-game hit streak, Braun recovering May 22
- Baseball Capsules May 22
- Rangers-Astros Preview May 21
- Brewers-Mets Preview May 21
- Andrus, Ramos lead Rangers over Astros 2-1 May 21


text:
Let us know when your receive great advice so we can thank our lawyers and point others with similar questions in the right direction.Got it!
However, he's about 8 years behind on filing! I'm getting IRS letters in the mail- but he keeps telling me ge will get to it- and I BETTER NOT file without him.
What do I do?!
Last year, 2,105 criminal tax convictions were made and 1,810 taxpayers were incarcerated. Although civil penalties are normally assessed, if the IRS discovers a habitual non-filer before voluntary disclosure, either through its own non-filer programs or through an informant, the IRS will often refer the matter to the Criminal Investigation Division (CID) to determine if criminal prosecution is warranted.
Failing to File a Tax Return can be a misdemeanor. Normally civil tax penalties are assessed, instead of criminal. However, if charged, you could face up to 1 year in jail and $25k in fines for each year you failed to file. One thing to note is that you can only face criminal charges for not filing a tax return (with civil penalties there is no time limit) if it was due no more than six years ago.
More commonly, in cases where returns are not filed, the IRS will file Substitute for Returns (SFR); essentially the IRS prepares and files for a tax return based on what it knows. The IRS won't consider all the tax benefits (e.g., deductions and other credits) you might otherwise be entitled to claim. Once filed, the IRS will proceed to collections. Remember, not filing is one thing. Not being able to pay is another. There are numerous options for dealing with not being able to pay the IRS.
There are many reasons why taxpayers fall behind on filing. Some people just get into a bad habit and year after year passes and they put off the expense or the work of reconstructing all their records, or they are simply afraid. However, this problem won't go away.
I strongly suggest you and your husband go see a tax attorney that has experience dealing with non-filers and who can assist you with correcting the problem before it gets worse.
Best of Luck.
The posting attorney is admitted to the U.S. Tax Court and authorized to represent clients in all 50 states before the IRS. Outside of IRS matters, the posting attorney is licensed to practice law generally in the State of Texas and no other state. The information provided in this post is for general educational purposes only and should not be relied upon as legal advice by any party. No attorney-client relationship is formed with any party by the mere posting (or reading) of this information on the AVVO website. Circular 230 Disclaimer - Advice given in this response cannot be used to eliminate penalties with the IRS or any other governmental agencyAsk a similar question
The answer by Mr. Stoltz was right on point. I would, however, add the following, If the taxpayer willfully fails to file a tax return and pay the resulting tax liability, the taxpayer may be charged with a felony and subject to a jail term of up to 5 years, in addition to other penalties, in certain cases involving cash transactions related to business returns (See Sections 7203 and 6050I of the Internal Revenue Code). Also, the normal three year statute of limitations (for purposes of assessment) does not begin until the return is filed. Therefore, an assessment can be made at any time when a return has not been filed. Remember, there are two different statutes of limitations that apply here. There is the typical three year assessment period after the return is filed and the six year criminal prosecution period for willful failure to file.
Failing to file is playing with fire. I would strongly urge you to contact a tax lawyer.Ask a similar question
You have a complicated situation. As Texas is a community property state, your and your husband's tax returns are linked: 1/2 of all items of income and deductions from your husband's finances belong on your return and 1/2 of all items of income and deductions from your finances belong on your husband's return. For this reason it is difficult for either spouse in a community property state to file an income tax returns without all the necessary tax information for both spouses.
Given your husband's uncooperative posture, I suggest you talk with a tax lawyer or CPA to guide you through the options available to you. I realize that is why you posted your question here, but there are too many facts and issues that must be considered and analyzed before you could receive appropriate advice.
Best of luck,Ask a similar question
This is the stuff of nightmares. He HAS to start filing. Some statutes of limitations are a good thing, like the 3 years to examine a return that pass after a return is filed. It doesn't start until a return is filed. You have to examine what his refusal to file is doing to you, to your marriage and your future. At a minimum, see a CPA or tax attorney to look at options for you both.
If you cannot afford an attorney, look for a local Legal Aid or other low income legal services group. Or, use the AVVO.com web site to find an attorney in your area. In addition to that, contact your local bar association for referral to an attorney who specializes in this or talk to friends and neighbors to ask about an attorney they have used and liked. Often, but not always, the attorney will do an initial consultation free of charge. You will then be in a better position to determine what to do next. Best of luck to you!
If you liked this answer, click on the thumbs up! Thanks. Eliz. C. A. Johnson Post Office Box 8 Danville, California 94526-0008 Legal disclaimer: I do not practice law in any state but California. As such, any responses to posted inquiries, such as the one above, are limited to a general understanding of law in California and not to any other jurisdiction. In addition, no response to any posted inquiry should be deemed to constitute legal advice, nor to constitute the existence of an attorney/client or other contractual or fiduciary relationship, inasmuch as legal advice can only be provided in circumstances in which the attorney is able to ask questions of the person seeking legal advice and to thus gather appropriate information.Ask a similar question
The bottom line is that you need to file these returns. If your husband will not file you can file as married filing separately. To not file a tax return is criminal. Since the IRS is already sending you letters it won't me long before this issue can become more serious for you. The excuse that your husband will not let you file will not be a valid defense. You need to make a decision - your husband is not leading you down a good path. Let him know that there are a lot of options for dealing with unpaid taxes. However, the options are very limited for unfiled returns. The penalties are also greater - plus the potential for criminal charges. If you have a refund coming in any of these years you can only go back 3 years form the due date of the return.
Any individual seeking legal advice for their own situation should retain their own legal counsel as this response provides information that is general in nature and not specific to any person's unique situation. Circular 230 Disclaimer - Advice given in this response cannot be used to eliminate penalties with the IRS or any other governmental agency.Ask a similar question
Post a free question on our public forum.Ask a Question
- or -
Search for lawyers by reviews and ratings.Find a Lawyer


text:
Gift with Purchase
Look In Box Smokey Eye Look ($16 - $162 Value)
Sale: $16.00 – $36.50
BOBBI BROWN Pretty Powerful Pink III Pot Rouge
What it is: Bobbi Brown introduces limited-edition Powerful Pink III, which, with your purchase, will support Bobbi's $300,000 donation to Kiva, a global non-profit organization that helps low income women in over 80 countries secure microloans and create better futures for themselves.Why it's different: This creamy color formula can be ... Learn More
CARGO Swimmables™ Lip Liner
Create long-lasting definition around the lips with Cargo's Swimmables Lip Liner, a waterproof, extreme-wear pencil that preps your pucker and serves as a long-wearing lip base. Incredibly concentrated pigments provide rich, transfer-resistant color that fills and blends effortlessly for a variety of budge-proof, pool-to-party looks. Color(s): canaria, jaipur, moscow, oahu. ... Learn More
DIOR Rouge Contour Classic Lip Liner
A soft, creamy formula that lines and defines lips precisely, easily. Long-wearing and smudge-resistant. Color(s): airy mauve 573, amethyst, brown fig 593, candy rose 463, chocolate 588, earth 433, english brick 543, garnet, heather rose 553, holiday red 863, linen 513, mahogany 833, mysterious plum 988, mystic mauve, mythical brown ... Learn More
GIORGIO ARMANI 'Smooth Silk' Lip Pencil
An incredibly soft lip pencil for subtle, precise definition. The silky texture allows for easy application and flawless results. To extend the hold of your lip color, fill lips in completely with Smooth Silk Lip Pencil before applying your lipstick. Choose from a wide range of shades to complement every ... Learn More
GUERLAIN Lasting Color High Precision Lip Liner
For perfect lip definition, Guerlain designed a retractable lip liner, available in 8 shades to match every lipstick! A soft, thin and precise line that defines and corrects the lip outline for a perfect finish and long-lasting hold. Color(s): bois de santal 44, bois des indes 42, feve tonka 43, ... Learn More
HOURGLASS Panoramic Long Wear Lip Pencil
"This exceptional liner delivers all-day wear without smudging or feathering. Icon is always in my makeup kit. It's the essential step for creating dramatic red lips with real staying power." -Carisa Janes, HOURGLASS founderWhat it is: A highly pigmented, richly emollient and long-wearing pencil with a blending brush.Who it's for: ... Learn More
LA PRAIRIE Luxe Lip Liner Automatique
Portable duet featuring a velvety smooth lip liner to define and sculpt the lips and a professional lip brush on the opposite end to blend liner and lipstick into one cohesive wash of color. Housed in a luxurious silver case, each pencil comes fully loaded and provides one color refill ... Learn More
LANCÔME Le Crayon Contouring Lip Crayon
What it is: Rich, creamy color in an automatic pencil that never needs sharpening.What it does: Its soft, rounded tip swivels up to provide lips with lasting color and perfect definition, while preventing lipstick from feathering or bleeding.How to use: Start by lining your cupid's bow. Then, line the top ... Learn More


text:
The Good Doctor
Oncologist Tamara Hopkins hosts rummage sales to help raise funds for her patient's medical costs. more
May 23, 2016 1:54 PM Life
The Portrait of Health
After spending more than two decades of his life in the medical field, it seems fitting that doctor-turned-artist Henry Domke prefers to display his work in hospitals rather than art galleries. more
Sep 22, 2015 3:11 PM Life


text:
Last year, Barack Obama stunned the nation when he freed five deadly terrorists from Guantanamo Bay in exchange for known-deserter Bowe Bergdahl.
Now, new reports have revealed that Obama is planning to aid Muslim terrorists once again by freeing ten terrorists from Guantanamo Bay, possibly as soon as this month.
You're likely to see some progress in June," an unnamed senior defense official commented, according to Breitbart. "I just talked to the National Security Council and State [Department], so we can say maybe up to 10 — no specific timeframe, but in the near future. And then we're actively engaged with a number of countries in additional negotiations regarding the 57 that are eligible. But sometime this summer, maybe June, up to 10."
As part of an Interagency review, the Pentagon has cleared 57 of the facility's 122 prisoners for transfer to detention centers in other countries. Obama sped up these transfers in anticipation for the Republican takeover of congress late last year. His goal was to empty out Guantanamo before the GOP could block his efforts, but he did not quite succeed: there have been no transfers since January.
Now, Obama is racing to free as many prisoners as he can, regardless of how dangerous they are, so that he can close Guantanamo forever.
"I think it's fair to say he's fully engaged in all things Guantanamo — transfers, dealing with the Senate and the House and the Hill, talking with the White House on a regular basis," said Secretary Defense Carter.
"He has also said that he wants to take a holistic approach," added the official. "So he wants to focus on the 57 who are cleared for transfer, but he wants to see what we're doing with the rest of those. So he's thinking about all 122, not just the 57."
On Wednesday, the Senate began debating the 2016 National Defense Authorization Act (NDAA), which has become the battleground for the fight on whether to keep Guantanamo Bay open or to close it.
"Both existing versions of House and Senate NDAA would extend current restrictions on transferring prisoners to the United States, and restore stricter provisions stripped out in past years," reported Defense One. "In some cases, they would also add new obstacles, essentially blocking many of the third-party transfers. The House version would withhold 25 percent of Carter's budget as punishment for what House Armed Services Chairman Rep. Mac Thornberry (R-TX) characterized as foot-dragging on providing documents related to the detainees swapped for Bowe Bergdahl."
The White House has already threatened to veto any bill that would place restrictions on the transfer of detainees at Guantanamo Bay.
What do you think about this? Let us know your thoughts in the comments section.


text:
Feline Fox Necklace
Natural looking jewellery for those times when you just don't want to look glam.
Under the sea and back in touch with nature. Puts a whole new twist to weaving icy pole sticks as a kid. These look so natural and send a message your in touch with nature.Added 8 Years Ago from Thegrandsocial


text:
BookRenter.com's 5-Star Satisfaction Guarantee
We strive to deliver the best value to our customers and ensure complete satisfaction for all our textbook rentals.
- You can return your online books for any reason within our refund period – no questions asked.
- Every order is available for express shipping, and return shipping is always free.
- You'll be happy with the quality of your books (or we'll ship you another one on our dime).
- You can extend your rental up to 14 days – at the same cheap daily rental rate.
- If you decide to keep the book it will never cost more than the purchase price.
As always, you have access to over 5 million titles. Plus, you can choose from 5 rental periods, so you only pay for what you'll use. And if you ever run into trouble, our top-notch U.S. based Customer Service team is ready to help by email, chat or phone.
* Free shipping excludes HI, AK and PR.
Product Details
Binding:Paperback Textbook
Publisher:General Books LLC
ISBN: 9780217437608 / 0217437605 Adamites & Preadamites,; Or, a Popular Discussion Concerning the Remote Representatives of the Human Species & Their Relation to the
Out of Stock
We're fresh out of that one today.
So sorry. Try back another time as our inventory fluctuates daily.Try Another Book?


text:
Digging It
A groundbreaking ceremony is held on the site of the new Rock Chalk Park in northwest Lawrence. The park will feature a track and field venue with 7,000 permanent seats and about 3,000 temporary ones. The new soccer stadium will accommodate 2,500 while the new Softball stadium will seat 1,500.
Image: Matt Jacobson, KU Athletics


text:
Creative Journaling
Greenwood Events
Saturday, 19 November 2016 from 10:00 to 16:00 (GMT)
Event Details
Helping you find creative approaches to problem solving in everyday life.
Explore your innate wisdom and intuition through visual journaling.
Aims to introduce participants to creative journaling for personal use or with clients/students.
This workshop is aimed at discovering how journaling may be used for creative reflection and wellbeing. Participants will learn journaling techniques that help promote wellbeing. We will look at examples of journaling for health and explore barriers to journaling. All materials supplied for exercises.
This workshop is suitable for individuals and therapists.
Morning session: Breathe weaving; sensory approaches to journaling; groupwork journaling techniques.
Afternoon session: Meditation and journaling; mapping emotions; body maps; toolbox for the future.
Trish Miller is an arts facilitator with 30 years experience working in the community, schools and therapy based settings.
How much?
£60 if paid in advance or £65 at the door.
Refreshments, snacks, handouts and CPD certificate are included in the price.
Note – lunch is not included.
How do I register?
Above or by requesting and registration form from email@example.com.
Minimum and Maximum numbers: Min 10 – Max 20 Please note that these workshops are subject to cancellation if we do not reach the minimum numbers requried to make it viable.
The Sharing Space
· Would you like to present at a seminar or workshop?
· Can you recommend a speaker?
· Do you have a topic you would like to hear about?
Then email firstname.lastname@example.com.
Pass it on! Feel free to pass this invitation on to colleagues and counselling centres – everyone is welcome!
When & Where
Dunblane Cathedral Halls
The Cross
FK15 0AQ Dunblane
United Kingdom
Saturday, 19 November 2016 from 10:00 to 16:00 (GMT)
Add to my calendar
Greenwood Events
Greenwood Events organises affordable workshops for counsellors in Scotland. Go to www.greenwoodevents.co.uk for further information or contact firstname.lastname@example.com.


text:
The Art of Dining: A History of Cooking and Eating
Using National Trust resources and information, this book provides a social history of food, from medieval times to the 20th century - what food was available, where it came from, how it was prepared, served and taken. It contains 90 historical recipes and their modern adaptations. Sara Paston-Williams tackles the subject chronologically, from the cavernous kitchens and great halls of medieval houses like Cotehele in Cornwall, to the technology of late-Victorian service areas like Cragside in Northumberland, producing food for ornate dining rooms and intimate parlours. Other books by her include "National Trust Book of Christmas & Festive Day Recipes", "National Trust Book of Pies", "National Trust Book of Fish Cookery", "National Trust Kitchen Store Cupboard Recipes" and "Beatrix Potter's Country Cookbook".
Please visit Help Page for Questions
regarding ISBN / ISBN-10 / ISBN10, ISBN-13 / ISBN13, EAN / EAN-13, and Amazon
Home | ISBN Directory | Affiliate
Program | Contact
Copyright © 2003-2014 AllDiscountBooks.net All rights reserved.


text:
Our Pretties
I consider myself a very optimistic and positive person,I like to smile and to joke. At the same time I'm very serious about life and know what I want. I'm goal oriented and I try to get what I want. In relations I'm very caring and supportive, romantic and reliable. I'm sure that if we want to have good relations with people, we should treat people as we want to be treated.
I have a lot of different interests, but I prefer to tell you about them in our future communication. It's impossible to tell all in this shot message.
Need partner: 25 - 50 years old
For me ideal man is a man who I will feel myself comfortable with. He is a man who I can rely on, who can support me when I need it and who will love me as much as I will love him.


text:
In a multidatabase system, schematic conicts between two objects are usually of interest
- Abner Baker
- 2 years ago
- Views:
1 So Far (Schematically) yet So Near (Semantically) Amit Sheth 1 and Vipul Kashyap 2 1 Bellcore, 444 Hoes Lane, Piscataway, NJ Department of Computer Science, Rutgers University, New Brunswick, NJ Abstract In a multidatabase system, schematic conicts between two objects are usually of interest only when the objects have some semantic anity. In this paper we try to reconcile the two perspectives. We rst dene the concept of semantic proximity and provide a semantic taxonomy. We then enumerate and classify the schematic and data conicts. We discuss possible semantic similarities between two objects that have various types of schematic and data conicts. Issues of uncertain information and inconsistent information are also addressed. 1 Introduction Many organizations face the challenge of interoperating among multiple independently developed database systems to perform critical functions. With high interconnectivity and access to many information sources, the primary issue in the future will not be how to eciently process the data that is known to be relevant, but which data is relevant. Three of the best known approachestodealwithmultiple databases are tightlycoupled federation, loosely-coupled federation, and interdependent data management [SL90][She91a]. A critical task in creating a tightly-coupled federation is that of schema integration (e.g., [DH84]). A critical task in accessing data in a loosely-coupled federation [LA86, HM85] is to dene a view over multiple databases or to dene a query using a multidatabase language. A critical task in interdependent data managementistode- ne multidatabase interdependencies [RSK91]. An additional approach is based on the paradigm of Intelligent and Cooperative Information Systems [PLS92] which involves exchange of information and expertise. In performing any of these critical tasks, and hence in any approach to interoperability of database systems, the fundamental question is that of identifying objects in dierent databases that are semantically related, and then resolve the schematic dierences among semantically related objects. In this paper, we are interested in the dual perspective that emphasizes both the semantic similarities and the schematic
2 Domain Definition Incompatibility Entity Definition Incompatibility Incompatibility Data Value Incompatibility Abstraction Level Incompatibility Schematic Discrepancy Figure 1: Structural Incompatibilities due to Heterogeneity (representational/ structural) dierences. While there is a signicant amount of literature discussing schematic dierences, work on semantic issues (e.g., [Ken91]) in the database context is scarce. Classication or taxonomies of schematic dierences appear in [DH84, BOT86, CRE87, KLK91, KS91]. However, purely schematic considerations do not suce to determine the similaritybe- tween objects [FKN91][SG89]. In this paper we try to reconcile the two perspectives. We develop a semantic taxonomy emphasizing semantic similarities between objects and show its relationship to a structural taxonomy emphasizing schematic (structural/representational) dierences among the objects. In section 2 we introduce the concept of semantic proximitythatcharacterizes the degree of semantic similaritybetween a pair of objects. Understanding and representing semantic similarities and schematic dierences between objects may involve understanding and modeling uncertainty, inconsistency and incompleteness of information pertaining to the objects (at both intensional and extensional levels), and the relationships between the objects. We address some of the issues of uncertainty and inconsistency. In section 3, we describe fuzzy terminological relationships [FKN91] by expressing the fuzzy strengths as a function of the semantic proximitybetween two objects. Section 6 addresses the data value incompatibility problem which arises out of the inconsistency between related data and the semantic similarities possible between inconsistent data. The remaining sections deal with a broad class of schematic dierences and the possible semantic similarities between the objects having those dierences. Section 4 deals with the domain incompatibility problem [CRE87] which arises when attributes have different domain denitions. Section 5 discusses the entity denition incompatibility problem [CRE87] which arises when the entity descriptors used for the same entity are partially compatible. Section 7 deals with the abstraction level incompatibility problem [DH84] which arises when the same entity is represented at dierent levels of abstraction. Section 8 deals with the schematic discrepancy problem [KLK91] which arises when data in one database corresponds to schema elements in another.
3 2 Semantic Similarities between Objects In this section, we introduce the concept of semantic proximity to characterize semantic similarities between objects, and use it to provide a classication of semantic similarities between objects. We distinguish between the real world, and the model world which is a representation of the real world. The term object in this paper refers to an object in a model world (i.e., a representation or intensional denition in the model world, e.g., an object class denition in object-oriented models) as opposed to an entity or a concept in the real world. These objects may model information at any level of representation, viz. attribute level or entity level. 1 Wood [Woo85] denes semantics to be \the scientic study of the relations between signs and symbols and what they denote or mean." It is not possible to completely dene what an object denotes or means in the model world [SG89]. We consider these to be aspects of real world semantics (RWS) of an object 2. Our emphasis is on identifying semantic similarity even when the objects have signicant representational dierences [She91b]. Semantic proximity is an attempt to characterize the degree of semantic similarity between two objects using the RWS. It provides a qualitative measure to distinguish between the terms introduced in [She91b], viz. semantic equivalence, semantic relationship, semantic relevance and semantic resemblance. Two objects can be semantically similar in one of the above four ways. Semantic equivalence is semantically closer than semantic relationship and so on. 2.1 A Model for Semantic Classication Given two objectso 1 and O 2, the semantic proximity between them is dened by the 4-tuple given by sempro(o 1,O 2 )=<Context, Abstraction, (D 1,D 2 ), (S 1,S 2 )> where D i is domain of O i and S i is state of O i. A context of an object is the primary vehicle to capture the RWS of the object. Thus, the respective contexts of the objects, and to a lesser extent the abstraction used to map the domains of the objects, help to capture the semantic aspect of the relationship between the two objects Context of the two Objects Each object has its own context. The term context in sempro refers to the context in which a particular semantic similarity holds. This context may be related to or dierent from the contexts in which the objects were dened. It is possible for two objects to be 1 Objects at the entity level can be denoted by single-place predicates P(x) and attributes can be denoted by two-place predicates Q(x,y) [SG89]. 2 The term \real world semantics" distinguishes from the \(model) semantics" that can be captured using the abstractions in a semantic data model. Our denition is also intensional in nature, and diers from the extensional denition of Elmasri et al. [ELN86] who dene RWS of an object to be the set of real world objects it represents
4 semantically closer in one context than in another context. Some of the alternatives for representing a context in an interoperable database system are as follows. In [SM91], the context is identied as the semantics associated with an application's view of existing data and is called the application semantic view. They propose a rule-based representation to associate metadata with a given attribute, and use this rule based representation to dene the application's semantic view of the data. Just as a context may be associated with an application, it can also be associated with a database or a group of databases (e.g., the object is dened in the context of DB1). When many entities participate in a relationship, the entities can be thought of as belonging to the same context, which in this case is identied as the relationship in which the entities participate. In a federated database approach, we can use a federated schema [SL90] to identify a context to which two objects may belong to. From the ve-level schema architecture for a federated database system [SL90], a context can be specied in terms of an export schemas (a context that is closer to a database) or an external schema (a context that is closer to an application). We can also build a context hierarchy, by considering the contexts associated with the external schemas to be subcontexts of the context associated with the appropriate federated schema. At a very elementary level, a context can be thought of as a named collection of the domains of the Objects. Sometimes a context can be "hard-coded" into the denition of an object. For example, when we have the two entities EMPLOYEE and TELECOMM-EMPLOYEE, the TELECOMMUNICATIONS context is "hard-coded" in the second entity. Weare interested in representing and reasoning about context as an explicit concept. In our classication scheme, we are often interested in the cases where the context(s) of the objects under consideration can be determined to be one of the following. (In cases other than ALL and NONE, specic instances of sempro must name context(s) explicitly.) { ALL, i.e. the sempro of the objects is being dened wrt all possible contexts. The specic context need not be named. { SAME, i.e. the sempro of the objects is being dened wrt thesamecontext. The context must be explicitly specied in an instance of a sempro. { SOME, i.e. the sempro of the objects are being dened wrt more than one context. The applicable contexts must be individually or collectively specied in an instance of a sempro.
5 { SUB-CONTEXTS, when the sempro can be dened in a previously dened context that is further constrained. The subcontext must be specied in an instance of a sempro. { NONE, i.e. the objects under consideration do not exhibit any useful semantic similarity under any context. Additional research is needed to identify appropriate representations of context, and develop a practical framework for semi-automatic ways of comparing and manipulating contexts (e.g., taking a union of two contexts). While it may not be possible to precisely dene the context of an object, it may be useful to simply name it at a specic level of information modeling architecture (e.g., external schema or federated schema). A partial context specication can be used by humans to decide whether the context for modeling of two objects is the same or dierent, and whether the comparison of semantic similarity of objects is valid in all possible contexts or specic ones. Examples and discussions in the rest of the paper will clarify these points. An abstraction, discussed next, by itself cannot capture the semantic similarity, because it is always possible to construct a mapping between two semantically unrelated objects. However, if there is a semantic similarity between two objects, then we should be able to do so wrt a particular (or all) context(s) Abstraction used to map the Objects We use the term abstraction to refer to a mechanism used to map the domains of the objects to each other or to the domain of a common third object. Some of the more useful and well dened abstractions are: A total 1-1 value mapping between the domains of the objects, i.e., for every value in the domain of one object, there exists a value in the domain of the other object and vice versa. Also there is a one to one correspondence between the values of the two domains. A partial many-one mapping between the domains of the objects. In this case some values in either domain might remain unmapped, or a value in one domain might be associated with many values in another domain. The generalization abstraction to relate the domains of the concerned objects. One domain can generalize/specialize the other, or domains of both the objects can be generalized/specialized to a third domain. Both can be expressed using the mechanism of mappings between the domains of the concerned objects as follows : { Generalization can be expressed as a total, many-one mapping from the union of the domains of the objects being generalized to the domain of the generalized object. { Specialization can be expressed as a total, many-one mapping from the domain of the specialized object to the domain of the object being specialized.
6 D1 is a subset of D2 x D3 x D4 Domain of Object(D1) X X Domain of attr(d2) Domain of attr(d4) Domain of attr(d3) Figure 2: Domain of an Object and it's Attributes The aggregation abstraction to relate the domains of the objects. This can be expressed as a partial, 1-1 mapping between the cross-product of the domains of the objects being aggregated and the domain of the aggregated object. Functional Dependencies. They can be expressed as a partial, many-one mapping between the cross-products of the domains of the determining objects and the cross-product of the domains of the determined objects. ANY. This is used to denote that any abstraction such as the ones dened above may be used to dene a mapping between two objects. NONE. This is used to denote that there is no mapping dened between two semantically related objects. NEG. This is used to denote that there is no mapping possible between two semantically unrelated objects Domains of the Objects Domains refer to the sets of values from which the objects can take their values. When using an object-oriented model, the domains of objects can be thought of as types, whereas the collections of objects might themselves be thought of as classes. A domain can be either atomic (i.e., cannot be decomposed any further) or composed of other atomic or composite domains. The domain of an object can be thought of as a subset of the crossproduct of the domains of the properties of the object. Analogously, we can have other combinations of domains, viz. union and intersection of domains. An important distinction between a context and a domain should be noted. One of the ways to specify a context is as a named collection of the domains of objects, i.e. it is associated with a group of objects. A domain on the other hand is a property ofan object and is associated with the description of that object.
7 2.1.4 States (extensions) of the Objects The state of an object can be thought of as an extension of an object recorded in a database or databases. However, this extension must not be confused with the actual state of the entity (according to the Real World Semantics) being modeled. Two objects having dierent extensions can have the same state Real World Semantics (and hence be semantically equivalent). We now use the above model to dene a semantic taxonomy consisting of various types of semantic similarities between the objects. 2.2 Semantic Equivalence This the strongest measure of semantic proximity two objects can have. Two objects are dened to be semantically equivalent when they represent the same real world entity or concept. Expressed in our model, it means that given two objects O 1 and O 2, it should be possible to dene a total 1-1 value mapping between the domains of these two objects in any context. Thus we can write it as: sempro(o 1,O 2 )=<ALL, total 1-1 value mapping, (D 1,D 2 ), > 3 The notion of equivalence described above depends on the denition of the domains of the objects and can be more specically called domain semantic equivalence. We can also dene a stronger notion of semantic equivalence between two objects which incorporates the state of the databases to which the two objects belong. This equivalence is called state semantic equivalence, and is dened as: sempro(o 1,O 2 )=<ALL, M, (D 1,D 2 ), (S 1,S 2 ) > where M is a total 1-1 value mapping between (D 1,S 1 )and(d 2,S 2 ). Unless explicitly mentioned, we shall use semantic equivalence to mean domain semantic equivalence. 2.3 Semantic Relationship This is a weaker type of semantic similarity than semantic equivalence. Two objects are said to be semantically related when there exists a partial many-one value mapping, or a generalization, or aggregation abstraction between the domains of the two objects. Here we relax the requirement of a 1-1 mapping in a way that given O 1 we can identify O 2 but not vice versa. The requirement that the mapping be denable in any context is not relaxed. Thus we can dene the semantic relationship as: sempro(o 1,O 2 )=<ALL, M, (D 1,D 2 ), > where M = partial many-one value mapping, generalization, or aggregation 3 We use the " " sign to denote don't care.
8 Employee Name Role1 Database1 Employee Number Role2 Database2 OBJECTS CONTEXTS Role1 = role-of(employeename, Database1) = Identifier Role2 = role-of(employeenumber, Database2) = Identifier Thus, Role1 = Role2 2.4 Semantic Relevance Figure 3: Roles played by objects in their contexts We consider twoobjectstobesemantically relevant if they can be related to each other using some abstraction in the same context. Thus the notion of semantic relevance between two objects is context dependent, i.e., two objects may be semantically relevant in one context, but not so in another. Objects can be related to each other using any abstraction. sempro(o 1,O 2 )=<SAME, ANY, (D 1,D 2 ), > 2.5 Semantic Resemblance This is the weakest measure of semantic proximity,whichmight be useful in certain cases. Here, we consider the case where the domains of two objects cannot be related to each other by any abstraction in any context. Hence, the exact nature of semantic proximity between two objects is very dicult to specify. In this case, the user may be presented with extensions of both the objects. In order to express this type of semantic similarity, we introduce an aspect of context, which we call role, by extending the concept of role dened in [EN89]. Semantic resemblance is dened in detail in section 2.5.2
9 2.5.1 Role played by an Object in a Context This refers to the relationship between an object and the semantic context to which it belongs. We characterize this relationship as a binary function, which has the object and it's context as the arguments and the name of the role as the value. role : object context! rolename The mapping dened above may be multi-valued, as it is possible for an object to have multiple roles in the same context. However, for our purposes, we shall assume the mapping to be a single-valued binary function Roles and Semantic Resemblance Whenever two objects cannot be related to each other by any abstraction in any context, but they have the same roles in their respective context(s) (where the respective contexts may or may not be the same), they can be said to semantically resemble each other. This is a generalization of DOMAIN-DISJOINT-ROLE-EQUAL concept in [LNE89]. sempro(o 1,O 2 )=<context, NONE, (D 1,D 2 ), > where context = context(o 1 ) [ context(o 2 ) and D 1 6=D 2 and role-of(o 1, context) = role-of(o 2, context) Example : In this example we demonstrate the semantic aspect of the similarity between two objects captured by context.itispossiblefortwo objects to be semantically closer in one context as compared to another context. Thus, it is possible for the same structural schema to have dierent semantic similarities. Consider two objects: OBJ1 = TELECOM-EMPLOYEE(ID, SALARY,...) OBJ2 = BANK-EMPLOYEE(ID, SALARY,...) Suppose the IRS (a government income tax department) wants to query both these objects wrt the tax bracket they fall in. OBJ1 and OBJ2 can be defined to be semantically relevant using the following information: context = context(obj1) = context(obj2) = IRS (i.e., context = SAME) abstraction : EMPLOYEE(ID, SALARY) = generalize(obj1, OBJ2) What if there is no single context, such as the one needed for the IRS application, in which the above objects are to be considered? Should the objects then, be considered for schema integration? The weaker semantic proximity of semantic resemblance can be defined between OBJ1 and OBJ2 using the following information:
10 Semantic Proximity Context, Abstraction Similar[Context = SOME (LUB), Abstraction = NONE] Dissimilar[Context = NONE, Abstraction = NONE] Semantic Resemblance Semantic Incompatibility Context = SOME, Abstraction = ANY Abstraction = ANY (except total 1-1 value mapping) Context = ALL Semantic Relevance Semantic Relationship Abstraction = Total 1-1 value mapping Semantic Equivalence Figure 4: Semantic Classication of Object Similarities context(obj1) = TELECOMMUNICATION context(obj2) = BANKING role-of(obj1, TELECOMMUNICATION) = SUBORDINATE role-of(obj2, BANKING) = SUBORDINATE 2.6 Semantic Incompatibility While all the proximity measures dened above describe semantic similarity, semantic incompatibility asserts semantic dissimilarity. Lack of any semantic similarity does not automatically imply that the objects are semantically incompatible. Establishing semantic incompatibility requires asserting that there is no context and no abstraction in which the domains of the two objects can be related. Furthermore, the two objects cannot have similar roles in the context(s) in which they exist. sempro(o 1,O 2 )=<NONE, NEG, (D 1,D 2 ), > where context = context(o 1 ) [ context(o 2 ) is undened, and Abstraction = NEG, signifying the dissimilarity and D 1 may ormay not be equal to D 2 and role-of(o 1, context) and role-of(o 2,context) are incomparable
11 3 Semantic Proximity and Uncertainty Modeling Specifying object relationships involve determining equivalence or subtype assertions between schema objects (e.g., entities) and between attributes. One approach has been to group attributes in a taxonomy of equivalence classes [ELN86, ME84] or a subtype hierarchy [SG89][SM92] and specify object relationships based on assertions among attributes. Another approach has been to annotate attributes or objects with a set of concepts from a global concept space [YSDK91] and determine the object relationships based on the concepts they are related to. Whether giving assertions among attributes or concepts, in practice we often can give only a fuzzy (i.e., uncertain or ambiguous) assertion. Being able to model uncertainty can help in identifying a larger class of assertions leading to better identication of semantic proximities among the objects. 3.1 Previous approaches to model uncertainty There have been attempts to model uncertainty in the relationships between objects. One approach has been to determine the similarity of objects by utilizing fuzzy and incomplete terminological knowledge [FKN91] together with schema knowledge. The diculty of this approach is that the assignment of fuzzy strengths is based on intuition, and albeit arbitrary. We are of the opinion that such an assignment of certainty measures is a context sensitive process and depends on the relation between the domains of the terminological entities involved. Thus, these factors could form a basis for assignment of the fuzzy strengths. Another approach has been that of using partial values and maybe tuples [DeM89]. In this approach, the partial and maybe information has a more formal basis, i.e., a value mapping between the domains of the objects. In our opinion fuzzy logic gives us a more complete framework than the 3-valued logic used to denote the maybe tuples, to represent the full range of uncertain information. Mapping information as a basis for determining uncertainty is inadequate in many cases and in such cases, using the context and the extensions of the objects can be helpful. Example : Consider two objects STUDENT and DEPARTMENT defined as follows STUDENT(Id#, Name, Grade) DEPARTMENT(Num, Name, Address) Let Domain(STUDENT.Id#) = {123, 456, 789} and Domain(DEPARTMENT.Num) = {321, 654, 987} It is possible to define a Mapping between the domains defined above, but this does not mean that STUDENT.Id# is equivalent to DEPARTMENT.Num A third approach [BGMP90, TCY93] has used discrete probability distributions to model uncertainty. However, probability values are either assigned as a measure of belief or by an analysis of the underlying sample. If the values are assigned as a measure of belief as in [Zad78], then there should be specied an underlying basis for specifying these
12 measures. Also, if these values are assigned by analyzing the underlying sample, then they depend on the extensions or state of the objects, which might be rendered obsolete in a continually changing database. The implicit independence assumption which says that the probabilities modeling the uncertainty of an attribute are independent of the probability values of the other attributes does not appear to accurately reect the Real World Semantics. Example : Consider two objects INSTR1 and INSTR2 as defined below INSTR1(SS#, HPhone, OPhone) INSTR2(SS#, Phone) in two different databases. M 1 : INSTR1.HPhone! INSTR2.Phone M 2 : INSTR1.OPhone! INSTR2.Phone be two mappings dene between the attributes of the objects. Obviously M 1 and M 2 are not independent of each other and are related to each other through the mappings M 3 : INSTR1.SS# INSTR1.HPhone! INSTR2.SS# INSTR2.Phone M 4 : INSTR1.SS# INSTR1.OPhone! INSTR2.SS# INSTR2.Phone We propose representing the uncertainty in the integration assertions by using the concept of semantic proximity dened in the previous section. We also show how the semantic proximities can provide a well dened basis for the assignment of fuzzy strengths. We also show how heuristics used to assign the fuzzy strengths can be simulated using the semantic proximity as the basis. 3.2 Fuzzy Strengths as a function of Semantic Proximity In this section we establish the semantic proximity as a basis for the assignment of fuzzy strengths to the terminological relationships between two semantically similar objects. As noted in the previous section, when we assign fuzzy strengths to semantic similarities between schema objects, they should reect the Real World Semantics. Thus any such assignment of belief measures should depend on and reect : The context(s) to which the two schema objects belong to. The mapping(s) which may exist between the domains of the objects or the domains of the individual attributes of the objects. Here, it may be noted that the mappings between two attributes of the objects might not be independent of each other, but maybe dependent. Thus, instead of having mappings A 1 1! A 2 1 and A 1 2! A 2 2, where A i j is the j th attribute of the i th object, we might have mappings between pairs of attributes, i.e. A 1 1 A 1 2! A 2 1 A 2 2. Hence, the implicit independence assumption of [BGMP90] might not accurately reect the mappings.
13 The state(s) or the extensions of the two objects. The semantic proximity described in the previous section is able to capture this information which represents the semantic similarity between two objects according to the Real World Semantics. Also the interactions between any two attributes of an object can be captured using the interactions between the mappings of the two attributes, thus avoiding the need for the implicit independence assumption. We dene an uncertainty function between two objects O 1 and O 2 which maps the semantic proximity to the real interval [0,1]. Thus : sempro(o 1,O 2 )! [0,1] i.e., (Context, Abstraction, (D 1,D 2 ), (S 1,S 2 )) = X where 0 X 1. is a user dened function such that it accurately reects the Real World Semantics and may not have specic mathematical properties. It may or may not be a computable function. If it is a computable function, that would mean that we can automate the process of assigning the fuzzy strengths to the semantic relations between schema objects. However, it would require the semantic proximities discussed earlier. Two users might choose to dene the function dierently, but now we have a basis on which to judge, given the semantic proximity, which function is a better reection of the Real World Semantics. If is not computable, a human makes an assignment based on the context(s), the mapping(s) between the domains of the two objects, and possibly the states of the two objects. Earlier we dened the various kinds of semantic proximities. Now, based on these semantic proximities, we develop a bounded correctness criterion which any user dened uncertainty function should follow. Bounded correctness criterion Given a user dened uncertainty function, let the values to which it maps the various semantic proximities be given as follows : (State-Equivalent) = X StateEq (Domain-Equivalent) = X DomEq (Related) = X Relat (Relevant) = X Relev (Resemble) = X Res (Incompatible) = X In A criterion that a heuristic may meet to justify consistent derivation of the fuzzy strengths is the bounded correctness criteria specied as follows : 1. X StateEq = < X Res X Relev X Relat X DomEq < 1 3. X In =0
14 3.3 Simulation of heuristics using semantic proximity for assignment of Fuzzy Strengths In this section we debate whether the denition of the user dened uncertainty function described in the previous section can capture all the heuristics used to assign fuzzy measures. We show how some of the proposed heuristics used for assignment of fuzzy strengths to the relationships can be simulated using the semantic proximities and by dening an appropriate uncertainty function The heuristic of % of common attributes This is a very simple heuristic [ELN86] to represent using the semantic proximity. It is a heuristic which essentially exploits the structural similarity between two entities. The uncertainty function will be independent of the context(s) and the states of the objects. Given the semantic proximity, the uncertainty function can be dened as follows : (Contexts, fm i g,(fd 1 i g, fd 2 i g), (S 1,S 2 )) = jfd 1 igj100 jfattr(o 1 )gj where M i is a mapping between the domains of the ith attribute of the two objects and can be represented as M i :D 1 i! D 2 i. Example : Consider two Union Incompatible entities as follows : Student 1 (Id#, Name, Grade) Student 2 (Id#, Name, Address) The semantic proximity can be given as : sempro(student 1, Student 2 ) = <ALL, fm Id#,M N ame g,(fd 1 Id#,D 1 N ame g, fd 2 Id#,D 2 N ame g), > The uncertainty function is then given as : (Student 1, Student 2 )= jfd 1 Id# D 1 Name gj100 jfid# N ame Gradegj The heuristic of instance participation This heuristic uses the concept of the cardinality constraints of the entities participating in the mappings [EN89, VH91] to dene the uncertainty function. Also, though this function expresses more semantic information than the previous one, it is independent of the context(s) of the two objects. Thus we can dene the uncertainty function, for a semantic proximity with the cardinality constraints of the objects participating in the mappings, as follows : Let O 1 and O 2 be twoschema objects and let their semantic proximity be given as follows : sempro(o 1,O 2 )=<ALL, Abstraction, (D 1,D 2 ), >
15 where Abstraction is a total many-one value mapping between the domains with the cardinality constraints of the domains participating in the mapping given as : D 1! (min 1, max 1 )andd 2! (min 2,max 2 ) where min i and max i are the minimum and maximum number of elements of domain D i participating in the mappings. (Contexts, Abstraction, (D 1,D 2 ), (S 1,S 2 )) = (min 1+max 1 )(min 2 +max 2 ) 4max 1 max 4 Domain Incompatibility Problem In this section we discuss the incompatibilities that arise between two objects when they have diering denitions of semantically similar attribute domains. A broad denition of this incompatibility was given in [CRE87]. We examine in detail the aspects in which two attribute domain denitions can dier and give a comprehensive enumeration of the resulting types of incompatibilities. For each enumerated conict, we identify the likely semantic proximities between the domains. 4.1 Naming Conicts Two attributes that are semantically alike might have dierent names. They are known as synonyms. Example : Consider two databases having the relations : STUDENT(Id#, Name, Address) TEACHER(SS#, Name, Address) STUDENT.Id# and TEACHER.SS# are synonyms. Mappings between synonyms can often be established wrt all contexts. In such cases, two objects O 1 and O 2 can be considered to be semantically equivalent. Two attributes that are semantically unrelated might have the same names. They are known as homonyms. Example : Consider two databases having the relations : STUDENT(Id#, Name, Address) BOOK(Id#, Name, Author) STUDENT.Id# and BOOK.Id# are homonyms. Since homonyms are semantically unrelated, there cannot be any context, in which there is an abstraction which maps one homonym to another. In such cases, two objects O 1 and O 2 can be considered to be semantically incompatible.
16 4.2 Data Representation Conicts Two attributes that are semantically similar might have dierent data types or representations. Example : STUDENT.Id# is dened as a 9 digit integer. TEACHER.SS# is dened as an 11 character string. Conversion mappings or routines between dierent data representations can often be established wrt all contexts. In such cases, two objects O 1 and O 2 can be considered to be semantically equivalent. 4.3 Data Scaling Conicts Two attributes that are semantically similar might be represented using dierent units and measures. There is a one-one mapping between the values of the domains of the two attributes. For instance, the salary attribute might have values in $ and $. Typically mappings between data represented in dierent scales can be easily expressed in terms of a function or a lookup table, or by using dynamic attributes as in [LA86] and wrt all contexts. In such cases, two objects O 1 and O 2 can be considered to be semantically equivalent. 4.4 Data Precision Conicts Two attributes that are semantically similar might be represented using dierent precisions. This case is dierent from the previous case in that there may not be one-one mapping between the values of the domains. There may beamany-one mapping from the domain of the precise attribute to the domain of the coarse attribute. Example Let the attribute Marks have aninteger value from 1 to 100. Let the attribute Grades have the values fa, B, C, D, Fg. There may beamany-one mapping from Marks to Grades. Grades is the coarser attribute. Typically, mappings can be specied from the precise data scale to the coarse data scale wrt all contexts. The other way round, e.g., given a letter grade identifying the precise numerical score, is typically not possible. In such cases, two objects O 1 and O 2 can be considered to have asemantic relationship. 4.5 Default Value Conicts This type of conict depends on the denition of the domain of the concerned attributes. The default value of an attribute is that value which itisdenedtohave in the absence
17 Marks Grades A B C D 1-20 F Table 1: Mapping between Marks and Grades of more information about the real world. These conicts were discussed in [KS91] and can be classied as the broader class of domain incompatibility conicts. In this case, two attributes mighthave dierent default values in dierent databases. For instance, the default value for Age of an adult might bedenedas18years in one database and as 21 years in another. It may not be possible to specify mappings between a default value of one attribute to the default value of another in all contexts. However, it is often possible to dene a mapping between them wrt the same context. In such cases,thetwo objects O 1 and O 2 can be considered to be semantically relevant, i.e., their semantic proximity can be dened as follows : sempro(age 1, Age 2 )=<SAME, Abstraction, (D 1,D 2 ), > Context = SAME = LegalDriver for Age 1 and Age 2 Abstraction = 1-1 value mapping 4.6 Attribute Integrity Constraint Conicts Two semantically similar attributes might be restricted by constraints whichmight not be consistent with each other. For instance, in dierent databases, the attribute Age might follow these constraints : Example : C1 : Age 18 C2 : Age > 21 C1 and C2 are inconsistent and hence the integrity constraints on the attribute Salary are said to conict. Depending on the nature of the integrity constraints involved, it might be possible to generalize the constraints and have a mapping from the specic to the general constraints. However, in certain cases the nature of inconsistency mightbesuch that a mapping might not be possible. Even in that case, the objects O 1 and O 2 can be considered to semantically resemble each other, if they have the same role in their respective context(s).
18 Naming Conflicts Data Representation Conflicts (Semantic Equivalence) Synonyms (Semantic Equivalence) Homonyms (Semantic Incompatibility) Data Scaling Conflicts (Semantic Equivalence) Domain Incompatibility Data Precision Conflicts (Semantic Relationship) Default Value Conflicts (Semantic Relevance) Attribute Integrity Constraint Conflicts (Semantic Resemblance) Figure 5: Domain Incompatibility and the likely types of semantic proximities sempro(age 1, Age 2 )=<context, NONE, (D 1,D 2 ), > where context = context(age 1 ) [ context(age 2 ) and D 1 6=D 2 and role-of(age 1, context) = role-of(age 2,context) = AGE 5 Entity Denition Incompatibility Problem In this section we discuss the incompatibilities that arise between two objects when the entity descriptors used by the objects are only partially compatible, even when the same type of entity is being modeled. The broad denition of this class of conicts was given in [CRE87]. Here we examine in detail the scenarios in which the entity denitions of semantically similar entities might conict to give a more precise and comprehensive enumeration of the above class of conicts. For each enumerated conict, we identify the likely semantic proximities between the entities. 5.1 Database Identier Conicts In this case, the entity descriptions in two databases are incompatible because they use identier records that are semantically dierent. In a relational model scenario, this would translate to two relations modeling the same entity having semantically dierent keys. This is also known as the key equivalence problem.
19 Example : STUDENT1(SS#, Course, Grades) STUDENT2(Name, Course, Grades) STUDENT1.SS# and STUDENT2.Name are semantically different keys. The semantic proximity of objects having this kind of conict depends on whether it is possible to dene an abstraction to map the keys in one database to another. However, if we assume that the context(s) of the identiers are dened in the local schemas, we know that they play the role of identication in their respective contexts. Hence, the weakest possible measure of semantic proximity applies, though stronger measures might apply too. The semantic resemblance between the above two objects can be dened as : sempro(o 1,O 2 )=<LS 1 [ LS 2,,(D 1,D 2 ), > where D 1 = Domain(key(O 1 )) and D 2 = Domain(key(O 2 )) and role-of(key(o 1 ), LS 1 ) = role-of(key(o 2 ), LS 2 ) = IDENTIFIER 5.2 Naming Conicts Semantically alike entities might be named dierently in dierent databases. For instance, EMPLOYEE and WORKERS might betwo objects describing the same set of entities. They are known as synonyms of each other. Typically, mappings between synonyms can often be established. In such cases objects O 1 and O 2 having this kind of a conict can be considered to be semantically equivalent. On the other hand, semantically unrelated entities might have the same name in dierent databases. For instance, TICKETS might be the name of a relation which models movie tickets in one database, whereas it might model trac violation tickets in another database. They are known as homonyms of each other. Since homonyms are semantically dissimilar, there cannot be any context, in which there is an abstraction which maps one homonym to another. Thus two objects O 1 and O 2 having this conict can be considered to be semantically incompatible. Note that the above conicts are dierent from the Naming Conicts discussed in Section 4.1 of this paper. The conicts discussed in Section 4.1 arise due to dierences in the naming of attributes whereas, conicts in this section arise due to dierences in the naming of entities. 5.3 Union Compatibility Conicts Descriptors of semantically similar entities might not be union compatible with each other. Two entities are union incompatible when the set of attributes are semantically unrelated in such away that a one-one mapping is not possible between the two sets of attributes. Example : STUDENT1(Id#, Name, Grade)
20 STUDENT2(Id#, Name, Address) are two entities that are union incompatible. Since mappings can be established between the objects on the basis of the common and identifying attributes, objects O 1 and O 2 can be considered to have asemantically relationship, i.e. their semantic proximity can be dened as follows: sempro(o 1,O 2 )=<ALL, fm ID,M i g,(fd 1 ID,D 1 i g, fd 2 ID,D 2 i g), > where M ID is a total 1-1 value mapping between the identiers of the two objectsd 1 ID and D 2 ID, M i may be a total/partial 1-1/many-one value mapping between D 1 i and D 2 i and represents the mapping between the ith attribute which is common between the two objects. 5.4 Schema Isomorphism Conicts Semantically similar entities may have dierent number of attributes, giving rise to schema isomorphism conicts. Example : INSTRUCTOR1(SS#, HomePhone, OffPhone) INSTRUCTOR2(SS#, Phone) is an example of schema non-isomorphism. It should be noted that this can be considered an artifact of the Data Precision Con- icts identied in section 4.4 of this paper, as the Phone number of INSTRUCTOR1 can be considered to be represented in a more precise manner than the Phone number of INSTRUCTOR2. However, the conicts discussed in section 4.4 are due to dierences in the domains of the attributes representing the same information and hence are attribute level conicts. Whereas, conicts in this sections arise due to dierences in the way the entities INSTRUCTOR1 and INSTRUCTOR2 are dened in the two databases and hence are entity level conicts. Since mappings can be established between the objects on the basis of the common and identifying attributes, objects O 1 and O 2 can be considered to have asemantic relationship, i.e. their semantic proximity can be dened as follows: sempro(instructor 1, Instructor 2 ) = <ALL, fm ID,M 1 g,(fd 1 ID,D 1 2,D 1 3 g, fd 2 ID,D 2 2 g), > where M ID is a total 1-1 value mapping between D 1 ID and D 2 ID and represents the mapping between the identiers of the two objects. M 1 may be a total/partial 1-1/many-one value mapping between D 1 2 [ D 1 3 and D Missing Data Item Conicts This conict arises when of the entity descriptors modeling semantically similar entities, one has a missing attribute. This type of conict is subsumed by the conicts discussed
virtual class local mappings semantically equivalent local classes ... Schema Integration
Data Integration Techniques based on Data Quality Aspects Michael Gertz Department of Computer Science University of California, Davis One Shields Avenue Davis, CA 95616, USA email@example.com IngoMore information
Managing large sound databases using Mpeg7
Max Jacob 1 1 Institut de Recherche et Coordination Acoustique/Musique (IRCAM), place Igor Stravinsky 1, 75003, Paris, France Correspondence should be addressed to Max Jacob (firstname.lastname@example.com) ABSTRACTMore information
2. Conceptual Modeling using the Entity-Relationship Model
ECS-165A WQ 11 15 Contents 2. Conceptual Modeling using the Entity-Relationship Model Basic concepts: entities and entity types, attributes and keys, relationships and relationship types Entity-RelationshipMore information
Thesis work and research project
Thesis work and research project Hélia Pouyllau, INRIA of Rennes, Campus Beaulieu 35042 Rennes, email@example.com July 16, 2007 1 Thesis work on Distributed algorithms for endto-end QoS contractMore information
Invertible elements in associates and semigroups. 1
Quasigroups and Related Systems 5 (1998), 53 68 Invertible elements in associates and semigroups. 1 Fedir Sokhatsky Abstract Some invertibility criteria of an element in associates, in particular in n-aryMore information
Relational model. Relational model - practice. Relational Database Definitions 9/27/11. Relational model. Relational Database: Terminology
COS 597A: Principles of Database and Information Systems elational model elational model A formal (mathematical) model to represent objects (data/information), relationships between objects ConstraintsMore information
Integrating Benders decomposition within Constraint Programming
Integrating Benders decomposition within Constraint Programming Hadrien Cambazard, Narendra Jussien email: {hcambaza,firstname.lastname@example.com École des Mines de Nantes, LINA CNRS FRE 2729 4 rue Alfred Kastler BPMore information
IT2305 Database Systems I (Compulsory)
Database Systems I (Compulsory) INTRODUCTION This is one of the 4 modules designed for Semester 2 of Bachelor of Information Technology Degree program. CREDITS: 04 LEARNING OUTCOMES On completion of thisMore information
Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets
Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets Nathaniel Hendren January, 2014 Abstract Both Akerlof (1970) and Rothschild and Stiglitz (1976) show thatMore information
Data Integration: A Theoretical Perspective
Data Integration: A Theoretical Perspective Maurizio Lenzerini Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza Via Salaria 113, I 00198 Roma, Italy firstname.lastname@example.com ABSTRACTMore information
1 the relational data model The relational model of data was introduced by E.F. Codd (1970). 1.1 relational model concepts The relational model repres
database systems formal definitions of the relational data model [03] s. yurttaοs 1 1 the relational data model The relational model of data was introduced by E.F. Codd (1970). 1.1 relational model conceptsMore information
programming languages, programming language standards and compiler validation
Software Quality Issues when choosing a Programming Language C.J.Burgess Department of Computer Science, University of Bristol, Bristol, BS8 1TR, England Abstract For high quality software, an importantMore information
IV. The (Extended) Entity-Relationship Model
IV. The (Extended) Entity-Relationship Model The Extended Entity-Relationship (EER) Model Entities, Relationships and Attributes Cardinalities, Identifiers and Generalization Documentation of EER DiagramsMore information
IT2304: Database Systems 1 (DBS 1)
: Database Systems 1 (DBS 1) (Compulsory) 1. OUTLINE OF SYLLABUS Topic Minimum number of hours Introduction to DBMS 07 Relational Data Model 03 Data manipulation using Relational Algebra 06 Data manipulationMore information
THE ENTITY- RELATIONSHIP (ER) MODEL CHAPTER 7 (6/E) CHAPTER 3 (5/E) 2 LECTURE OUTLINE Using High-Level, Conceptual Data Models for Database Design Entity-Relationship (ER) model Popular high-level conceptualMore information
Degrees of Truth: the formal logic of classical and quantum probabilities as well as fuzzy sets.
Degrees of Truth: the formal logic of classical and quantum probabilities as well as fuzzy sets. Logic is the study of reasoning. A language of propositions is fundamental to this study as well as trueMore information
Chapter 7 Application Protocol Reference Architecture
Application Protocol Reference Architecture Chapter 7 Application Protocol Reference Architecture This chapter proposes an alternative reference architecture for application protocols. The proposed referenceMore information
Issues and Approaches of Database Integration
Issues and Approaches of Database Integration Christine Parent and Stefano Spaccapietra In many large companies the widespread usage of computers has led a number of different application-specific databasesMore information
COMP 378 Database Systems Notes for Chapter 7 of Database System Concepts Database Design and the Entity-Relationship Model
COMP 378 Database Systems Notes for Chapter 7 of Database System Concepts Database Design and the Entity-Relationship Model The entity-relationship (E-R) model is a a data model in which information storedMore information
Database Security Sabrina De Capitani di Vimercati, Dip. Elettronica, Universita di Brescia, 25123 Brescia, Italy Pierangela Samarati, Dip. di Tecnologie dell'informazione, Universita di Milano, 26013More information
Report on the Dagstuhl Seminar Data Quality on the Web
Report on the Dagstuhl Seminar Data Quality on the Web Michael Gertz M. Tamer Özsu Gunter Saake Kai-Uwe Sattler U of California at Davis, U.S.A. U of Waterloo, Canada U of Magdeburg, Germany TU Ilmenau,More information
THE IMPACT OF INHERITANCE ON SECURITY IN OBJECT-ORIENTED DATABASE SYSTEMS David L. Spooner Computer Science Department Rensselaer Polytechnic Institute Troy, New York 12180 The object-oriented programmingMore information
Automating Software Development Process Using Fuzzy Logic
Automating Software Development Process Using Fuzzy Logic Francesco Marcelloni 1 and Mehmet Aksit 2 1 Dipartimento di Ingegneria dell Informazione, University of Pisa, Via Diotisalvi, 2-56122, Pisa, Italy,More information
Language. Johann Eder. Universitat Klagenfurt. Institut fur Informatik. Universiatsstr. 65. A-9020 Klagenfurt / AUSTRIA
PLOP: A Polymorphic Logic Database Programming Language Johann Eder Universitat Klagenfurt Institut fur Informatik Universiatsstr. 65 A-9020 Klagenfurt / AUSTRIA February 12, 1993 Extended Abstract TheMore information
Normalization in OODB Design
Normalization in OODB Design Byung S. Lee Graduate Programs in Software University of St. Thomas St. Paul, Minnesota firstname.lastname@example.com Abstract When we design an object-oriented database schema, we needMore information
Introducing Formal Methods. Software Engineering and Formal Methods
Introducing Formal Methods Formal Methods for Software Specification and Analysis: An Overview 1 Software Engineering and Formal Methods Every Software engineering methodology is based on a recommendedMore information
Lesson 8: Introduction to Databases E-R Data Modeling
Lesson 8: Introduction to Databases E-R Data Modeling Contents Introduction to Databases Abstraction, Schemas, and Views Data Models Database Management System (DBMS) Components Entity Relationship DataMore information
On the general structure of ontologies of instructional models
On the general structure of ontologies of instructional models Miguel-Angel Sicilia Information Engineering Research Unit Computer Science Dept., University of Alcalá Ctra. Barcelona km. 33.6 28871 AlcaláMore information
Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statementMore information
Reverse Engineering of Relational Databases to Ontologies: An Approach Based on an Analysis of HTML Forms
Reverse Engineering of Relational Databases to Ontologies: An Approach Based on an Analysis of HTML Forms Irina Astrova 1, Bela Stantic 2 1 Tallinn University of Technology, Ehitajate tee 5, 19086 Tallinn,More information
Extending Data Processing Capabilities of Relational Database Management Systems.
Extending Data Processing Capabilities of Relational Database Management Systems. Igor Wojnicki University of Missouri St. Louis Department of Mathematics and Computer Science 8001 Natural Bridge RoadMore information
Ontologies for Enterprise Integration
Ontologies for Enterprise Integration Mark S. Fox and Michael Gruninger Department of Industrial Engineering,University of Toronto, 4 Taddle Creek Road, Toronto, Ontario M5S 1A4 tel:1-416-978-6823 fax:1-416-971-1373More information
An Object Model for Business Applications
An Object Model for Business Applications By Fred A. Cummins Electronic Data Systems Troy, Michigan email@example.com ## ## This presentation will focus on defining a model for objects--a generalizedMore information
Foundations of Information Management
Foundations of Information Management - WS 2012/13 - Juniorprofessor Alexander Markowetz Bonn Aachen International Center for Information Technology (B-IT) Data & Databases Data: Simple information Database:More information
A terminology model approach for defining and managing statistical metadata
A terminology model approach for defining and managing statistical metadata Comments to : R. Karge (49) 30-6576 2791 mail firstname.lastname@example.com Content 1 Introduction... 4 2 Knowledge presentation...More information
Reusable Knowledge-based Components for Building Software. Applications: A Knowledge Modelling Approach
Reusable Knowledge-based Components for Building Software Applications: A Knowledge Modelling Approach Martin Molina, Jose L. Sierra, Jose Cuena Department of Artificial Intelligence, Technical UniversityMore information
types, but key declarations and constraints Similar CREATE X commands for other schema ëdrop X name" deletes the created element of beer VARCHARè20è,
Dening a Database Schema CREATE TABLE name èlist of elementsè. Principal elements are attributes and their types, but key declarations and constraints also appear. Similar CREATE X commands for other schemaMore information
2. Basic Relational Data Model
2. Basic Relational Data Model 2.1 Introduction Basic concepts of information models, their realisation in databases comprising data objects and object relationships, and their management by DBMS s thatMore information
Database Design and the ER model
Database Design and the ER model 1. Database design Database design: Description of the data environment An abstraction, driven by anticipated applications Database model: A formalism for specifying databaseMore information
Introduction. Database Management Systems
Introduction Database Management Systems Database Management System (DBMS) Collection of interrelated data and set of programs to access the data Convenient and efficient processing of data Database ApplicationMore information
CBV Semantics (Draft) Navit Fedida, John Havlicek, Nissan Levi, and Hillel Miller Motorola, Inc. 7700 W. Parmer Lane Austin, TX 78729 13 January 2002 Abstract A precise denition is given of the semanticsMore information
Clustering and scheduling maintenance tasks over time
Clustering and scheduling maintenance tasks over time Per Kreuger 2008-04-29 SICS Technical Report T2008:09 Abstract We report results on a maintenance scheduling problem. The problem consists of allocatingMore information
The Entity-Relationship Model
The Entity-Relationship Model 221 After completing this chapter, you should be able to explain the three phases of database design, Why are multiple phases useful? evaluate the significance of the Entity-RelationshipMore information
Data Quality in Information Integration and Business Intelligence
Data Quality in Information Integration and Business Intelligence Leopoldo Bertossi Carleton University School of Computer Science Ottawa, Canada : Faculty Fellow of the IBM Center for Advanced StudiesMore information
Computing and Informatics, Vol. 20, 2001,????, V 2006-Nov-6 UPDATES OF LOGIC PROGRAMS Ján Šefránek Department of Applied Informatics, Faculty of Mathematics, Physics and Informatics, Comenius University,More information
A Multidatabase System as 4-Tiered Client-Server Distributed Heterogeneous Database System
A Multidatabase System as 4-Tiered Client-Server Distributed Heterogeneous Database System Mohammad Ghulam Ali Academic Post Graduate Studies and Research Indian Institute of Technology, Kharagpur Kharagpur,More information
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimesMore information
Requirements for Context-dependent Mobile Access to Information Services
Requirements for Context-dependent Mobile Access to Information Services Augusto Celentano Università Ca Foscari di Venezia Fabio Schreiber, Letizia Tanca Politecnico di Milano MIS 2004, College Park,More information
A set is a Many that allows itself to be thought of as a One. (Georg Cantor)
Chapter 4 Set Theory A set is a Many that allows itself to be thought of as a One. (Georg Cantor) In the previous chapters, we have often encountered sets, for example, prime numbers form a set, domainsMore information
Fuzzy Implication Rules. Adnan Yazıcı Dept. of Computer Engineering, Middle East Technical University Ankara/Turkey
Fuzzy Implication Rules Adnan Yazıcı Dept. of Computer Engineering, Middle East Technical University Ankara/Turkey Fuzzy If-Then Rules Remember: The difference between the semantics of fuzzy mapping rulesMore information
CHAPTER-6 DATA WAREHOUSE 1 CHAPTER-6 DATA WAREHOUSE 6.1 INTRODUCTION Data warehousing is gaining in popularity as organizations realize the benefits of being able to perform sophisticated analyses of theirMore information
Criticality of Schedule Constraints Classification and Identification Qui T. Nguyen 1 and David K. H. Chua 2
Criticality of Schedule Constraints Classification and Identification Qui T. Nguyen 1 and David K. H. Chua 2 Abstract In construction scheduling, constraints among activities are vital as they govern theMore information
Intelligent Agents. Based on An Introduction to MultiAgent Systems and slides by Michael Wooldridge
Intelligent Agents Based on An Introduction to MultiAgent Systems and slides by Michael Wooldridge Denition of an Agent An agent is a computer system capable of autonomous action in some environment, inMore information
RELATIONAL DATABASE DESIGN g Good database design - Avoiding anomalies g Functional Dependencies g Normalization & Decomposition Using Functional Dependencies g 1NF - Atomic Domains and First Normal FormMore information
! " # The Logic of Descriptions. Logics for Data and Knowledge Representation. Terminology. Overview. Three Basic Features. Some History on DLs
,!0((,.+#$),%$(-&.& *,2(-$)%&2.'3&%!&, Logics for Data and Knowledge Representation Alessandro Agostini firstname.lastname@example.com University of Trento Fausto Giunchiglia firstname.lastname@example.com The Logic of Descriptions!$%&'()*$#)More information
Data Modeling. Database Systems: The Complete Book Ch. 4.1-4.5, 7.1-7.4
Data Modeling Database Systems: The Complete Book Ch. 4.1-4.5, 7.1-7.4 Data Modeling Schema: The structure of the data Structured Data: Relational, XML-DTD, etc Unstructured Data: CSV, JSON But where doesMore information
KNOWLEDGE FACTORING USING NORMALIZATION THEORY J. VANTHIENEN M. SNOECK Katholieke Universiteit Leuven Department of Applied Economic Sciences Dekenstraat 2, 3000 Leuven (Belgium) tel. (+32) 16 28 58 09More information
Conceptual Design Using the Entity-Relationship (ER) Model
Conceptual Design Using the Entity-Relationship (ER) Model Module 5, Lectures 1 and 2 Database Management Systems, R. Ramakrishnan 1 Overview of Database Design Conceptual design: (ER Model is used atMore information
Neighborhood Data and Database Security
Neighborhood Data and Database Security Kioumars Yazdanian, FrkdCric Cuppens e-mail: yaz@ tls-cs.cert.fr - cuppens@ tls-cs.cert.fr CERT / ONERA, Dept. of Computer Science 2 avenue E. Belin, B.P. 4025,31055More information
IMPROVING DATA INTEGRATION FOR DATA WAREHOUSE: A DATA MINING APPROACH Kalinka Mihaylova Kaloyanova St. Kliment Ohridski University of Sofia, Faculty of Mathematics and Informatics Sofia 1164, BulgariaMore information
Chapter 7 Data Modeling Using the Entity- Relationship (ER) Model
Chapter 7 Data Modeling Using the Entity- Relationship (ER) Model Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 7 Outline Using High-Level Conceptual Data Models forMore information
Introduction to time series analysis
Introduction to time series analysis Margherita Gerolimetto November 3, 2010 1 What is a time series? A time series is a collection of observations ordered following a parameter that for us is time. ExamplesMore information
Integrating XML Data Sources using RDF/S Schemas: The ICS-FORTH Semantic Web Integration Middleware (SWIM)
Integrating XML Data Sources using RDF/S Schemas: The ICS-FORTH Semantic Web Integration Middleware (SWIM) Extended Abstract Ioanna Koffina 1, Giorgos Serfiotis 1, Vassilis Christophides 1, Val TannenMore information
Data Integration and Data Cleaning in DWH
Frühjahrssemester 2010 Data Integration and Data Cleaning in DWH Dr. Diego Milano Organization Motivation: Data Integration and DWH Data Integration Schema (intensional) Level Instance (extensional) Level:More information
Lecture 16 : Relations and Functions DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondenceMore information
The Entity-Relationship Model
The Entity-Relationship Model Chapter 2 Slides modified by Rasmus Pagh for Database Systems, Fall 2006 IT University of Copenhagen Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 TodayMore information
Universal. Event. Product. Computer. 1 warehouse.
Dynamic multi-dimensional models for text warehouses Maria Zamr Bleyberg, Karthik Ganesh Computing and Information Sciences Department Kansas State University, Manhattan, KS, 66506 Abstract In this paper,More information
Verication by Finitary Abstraction Weizmann Institute of Sciences and Universite Joseph Fourier, Grenoble Fourth International Spin Workshop (SPIN'98) Paris 2.11.98 Joint work with: Y. Kesten Ben GurionMore information
CS 4604: Introduc0on to Database Management Systems. B. Aditya Prakash Lecture #5: En-ty/Rela-onal Models- - - Part 1
CS 4604: Introduc0on to Database Management Systems B. Aditya Prakash Lecture #5: En-ty/Rela-onal Models- - - Part 1 Announcements- - - Project Goal: design a database system applica-on with a web front-More information
It all depends on independence
Working Papers Institute of Mathematical Economics 412 January 2009 It all depends on independence Daniel Eckert and Frederik Herzberg IMW Bielefeld University Postfach 100131 33501 Bielefeld Germany email:More information
Draft Martin Doerr ICS-FORTH, Heraklion, Crete Oct 4, 2001
A comparison of the OpenGIS TM Abstract Specification with the CIDOC CRM 3.2 Draft Martin Doerr ICS-FORTH, Heraklion, Crete Oct 4, 2001 1 Introduction This Mapping has the purpose to identify, if the OpenGISMore information
Integration of Heterogeneous Object Schemas? Jia-Ling Koh and Arbee L.P. Chen. National Tsing Hua University
Integration of Heterogeneous Object Schemas? Jia-Ling Koh and Arbee L.P. Chen Department of Computer Science National Tsing Hua University Hsinchu, Taiwan 300, R.O.C. Email : email@example.com Abstract.More information
A Federated Architecture for Information Management
A Federated Architecture for Information Management DENNIS HEIMBIGNER University of Colorado, Boulder DENNIS McLEOD University of Southern California An approach to the coordinated sharing and interchangeMore information
Chapter 4 Multi-Stage Interconnection Networks The general concept of the multi-stage interconnection network, together with its routing properties, have been used in the preceding chapter to describeMore information
A brief overview of developing a conceptual data model as the first step in creating a relational database.
Data Modeling Windows Enterprise Support Database Services provides the following documentation about relational database design, the relational database model, and relational database software. IntroductionMore information
INTEROPERABILITY IN DATA WAREHOUSES Riccardo Torlone Roma Tre University http://torlone.dia.uniroma3.it/ SYNONYMS Data warehouse integration DEFINITION The term refers to the ability of combining the contentMore information
Problems often have a certain amount of uncertainty, possibly due to: Incompleteness of information about the environment,
Uncertainty Problems often have a certain amount of uncertainty, possibly due to: Incompleteness of information about the environment, E.g., loss of sensory information such as vision Incorrectness inMore information
META DATA QUALITY CONTROL ARCHITECTURE IN DATA WAREHOUSING Ramesh Babu Palepu 1, Dr K V Sambasiva Rao 2 Dept of IT, Amrita Sai Institute of Science & Technology 1 MVR College of Engineering 2 firstname.lastname@example.com information
Classification of Fuzzy Data in Database Management System
Classification of Fuzzy Data in Database Management System Deval Popat, Hema Sharda, and David Taniar 2 School of Electrical and Computer Engineering, RMIT University, Melbourne, Australia Phone: +6 3More information
Software development process
OpenStax-CNX module: m14619 1 Software development process Trung Hung VO This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 2.0 Abstract A software developmentMore information
Data Base Management Systems (DBMS) Study Material (Objective Type questions with Answers) Shared by Akhil Arora Powered by www. your A to Z competitive exam guide Database Objective type questions Q.1More information
Modern Systems Analysis and Design
Modern Systems Analysis and Design Prof. David Gadish Structuring System Data Requirements Learning Objectives Concisely define each of the following key data modeling terms: entity type, attribute, multivaluedMore information
Semantic interoperability of dual-model EHR clinical standards
Semantic interoperability of dual-model EHR clinical standards Catalina Martínez-Costa Departamento de Informática y Sistemas, Facultad de Informática Universidad de Murcia, CP 30100, Murcia firstname.lastname@example.com information
Definition of the CIDOC Conceptual Reference Model
Definition of the CIDOC Conceptual Reference Model Produced by the ICOM/CIDOC Documentation Standards Group, continued by the CIDOC CRM Special Interest Group Version 4.2.4 January 2008 Editors: Nick Crofts,More information
Chapter 3. Data Modeling Using the Entity-Relationship (ER) Model
Chapter 3 Data Modeling Using the Entity-Relationship (ER) Model Chapter Outline Overview of Database Design Process Example Database Application (COMPANY) ER Model Concepts Entities and Attributes EntityMore information
PS engine. Execution
A Model-Based Approach to the Verication of Program Supervision Systems Mar Marcos 1 y, Sabine Moisan z and Angel P. del Pobil y y Universitat Jaume I, Dept. of Computer Science Campus de Penyeta Roja,More information
Bridge from Entity Relationship modeling to creating SQL databases, tables, & relations
1 Topics for this week: 1. Good Design 2. Functional Dependencies 3. Normalization Readings for this week: 1. E&N, Ch. 10.1-10.6; 12.2 2. Quickstart, Ch. 3 3. Complete the tutorial at http://sqlcourse2.com/More information
Secure Cooperative Data Access in Multi-Cloud Environment
Mason Archival Repository Service http://mars.gmu.edu etd @ Mason (Electronic Theses and Dissertations) The Volgenau School of Engineering 2013 Secure Cooperative Data Access in Multi-Cloud EnvironmentMore information
Email: email@example.com firstname.lastname@example.com
Ontologies: Principles, Methods and Applications Mike Uschold & Michael Gruninger AIAI-TR-191 February 1996 To appear in Knowledge Engineering Review Volume 11 Number 2, June 1996 Mike Uschold MichaelMore information
Lightweight Data Integration using the WebComposition Data Grid Service
Lightweight Data Integration using the WebComposition Data Grid Service Ralph Sommermeier 1, Andreas Heil 2, Martin Gaedke 1 1 Chemnitz University of Technology, Faculty of Computer Science, DistributedMore information
2 Associating Facts with Time
TEMPORAL DATABASES Richard Thomas Snodgrass A temporal database (see Temporal Database) contains time-varying data. Time is an important aspect of all real-world phenomena. Events occur at specific pointsMore information
Describing, manipulating and pricing financial contracts: The MLFi language
Describing, manipulating and pricing financial contracts: The MLFi language Centre for Financial Research, Judge Institute of Management Cambridge, 14 March 2003 (revised January 2005) Jean-Marc Eber LexiFi,More information
Regular Expressions and Automata using Haskell
Regular Expressions and Automata using Haskell Simon Thompson Computing Laboratory University of Kent at Canterbury January 2000 Contents 1 Introduction 2 2 Regular Expressions 2 3 Matching regular expressionsMore information
Chapter 1: Introduction
Chapter 1: Introduction Database System Concepts, 5th Ed. See www.db book.com for conditions on re use Chapter 1: Introduction Purpose of Database Systems View of Data Database Languages Relational DatabasesMore information
The Language of Mathematics
CHPTER 2 The Language of Mathematics 2.1. Set Theory 2.1.1. Sets. set is a collection of objects, called elements of the set. set can be represented by listing its elements between braces: = {1, 2, 3,More information
Semantic Search in Portals using Ontologies
Semantic Search in Portals using Ontologies Wallace Anacleto Pinheiro Ana Maria de C. Moura Military Institute of Engineering - IME/RJ Department of Computer Engineering - Rio de Janeiro - Brazil [awallace,anamoura]@de9.ime.eb.brMore information
CSE 132A. Database Systems Principles
CSE 132A Database Systems Principles Prof. Victor Vianu 1 Data Management An evolving, expanding field: Classical stand-alone databases (Oracle, DB2, SQL Server) Computer science is becoming data-centric:More information
On Development of Fuzzy Relational Database Applications
On Development of Fuzzy Relational Database Applications Srdjan Skrbic Faculty of Science Trg Dositeja Obradovica 3 21000 Novi Sad Serbia email@example.com Aleksandar Takači Faculty of Technology BulevarMore information
An example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the conceptMore information
Data mining knowledge representation
Data mining knowledge representation 1 What Defines a Data Mining Task? Task relevant data: where and how to retrieve the data to be used for mining Background knowledge: Concept hierarchies InterestingnessMore information